Sciweavers

30 search results - page 1 / 6
» Sub-Sampled Newton Methods I: Globally Convergent Algorithms
Sort
View
STOC
2007
ACM
132views Algorithms» more  STOC 2007»
14 years 6 months ago
On the convergence of Newton's method for monotone systems of polynomial equations
Monotone systems of polynomial equations (MSPEs) are systems of fixed-point equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomial with p...
Stefan Kiefer, Michael Luttenberger, Javier Esparz...
SIP
2003
13 years 7 months ago
Time Domain Optimization Techniques for Blind Separation of Non-stationary Convolutive Mixed Signals
This paper aims to solve the problem of Blind Signal Separation (BSS) in a convolutive environment based on output correlation matrix diagonalization. Firstly an extension of the ...
Iain Russell, Alfred Mertins, Jiangtao Xi
ISPD
1997
ACM
68views Hardware» more  ISPD 1997»
13 years 10 months ago
Faster minimization of linear wirelength for global placement
A linear wirelength objective more e ectively captures timing, congestion, and other global placement considerations than a squared wirelength objective. The GORDIAN-L cell placem...
Charles J. Alpert, Tony F. Chan, Dennis J.-H. Huan...
SIAMJO
2010
87views more  SIAMJO 2010»
13 years 4 months ago
A Second Derivative SQP Method: Global Convergence
Abstract. Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second deri...
Nicholas I. M. Gould, Daniel P. Robinson
JMLR
2010
143views more  JMLR 2010»
13 years 4 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...