30 search results - page 1 / 6 » Sub-Sampled Newton Methods I: Globally Convergent Algorithms |
STOC
2007
ACM
14 years 4 months ago
2007
ACM
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...
SIP
2003
2003
Time Domain Optimization Techniques for Blind Separation of Non-stationary Convolutive Mixed Signals
13 years 5 months ago
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 ...
ISPD
1997
ACM
13 years 8 months ago
1997
ACM
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...
SIAMJO
2010
13 years 2 months ago
2010
Abstract. Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second deri...
JMLR
2010
13 years 2 months ago
2010
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...