Download:
|
by Michael Zibulevsky
Online]. Available: http://iew3.technion.ac.il/ ∼ mcib
http://iew3.technion.ac.il/~mcib/summax11.ps.gz
Add To MetaCart
Abstract:
We study nonsmooth unconstrained optimization problem, which includes sum of pairwise maxima of smooth functions. Minimum l 1-norm approximation is a particular case of this problem. Combining ideas Lagrange multipliers with smooth approximation of max-type function, we obtain a new kind of nonquadratic augmented Lagrangian. Our approach does not require articial variables, and preserves sparse structure of Hessian in many practical cases. We present the corresponding method of multipliers, and its convergence analysis for a dual counterpart, resulting in a proximal point maximization algorithm. The practical eciency of the algorithm is supported by computational results for large-scale problems, arising in structural optimization. 1
Citations
|
1410
|
Convex Analysis
– Rockafellar
- 1970
|
|
441
|
Atomic decomposition by basis pursuit
– Chen, Donoho, et al.
- 1999
|
|
279
|
Constrained Optimization and Lagrange Multiplier Methods. Athena Scientific
– Bertsekas
- 1996
|
|
89
|
source separation by sparse decomposition in a signal dictionary
– Zibulevsky, Pearlmutter, et al.
- 2000
|
|
78
|
A class of smoothing functions for nonlinear and mixed complementarity problems," Mathematical Programming
– Chen, Mangasarian
- 1994
|
|
31
|
Modified Barrier Functions (Theory and Methods
– Polyak
- 1992
|
|
27
|
Entropic Proximal Mappings with Applications to Nonlinear Programming
– Teboulle
- 1992
|
|
25
|
Convergence of the exponential multiplier method for convex programming
– Tseng, Bertsekas
- 1993
|
|
23
|
Penalty/barrier multiplier methods for convex programming problems
– Ben-Tal, Zibulevsky
- 1997
|
|
19
|
A new method for optimal truss topology design
– BENDSE
- 1993
|
|
17
|
Minimization Methods for Non-Di€erentiable Functions
– Shor
- 1985
|
|
16
|
Penalty/barrier multiplier algorithm for semidefinite programming
– Mosheyev, Zibulevsky
- 2000
|
|
16
|
A dual approach to solving nonlinear programming problems by unconstrained optimization
– Rockafellar
- 1973
|
|
8
|
Penalty/barrier multiplier methods for min-max and constrained smooth convex programs,” Opt
– Ben-Tal, Yuzefovich, et al.
- 1992
|
|
8
|
Penalty/Barrier Multiplier Methods for Large-Scale Nonlinear and Semidefinite Programming
– Zibulevsky
- 1996
|
|
6
|
Optimization methods for truss geometry and topology design
– Bendse, Ben-Tal, et al.
- 1994
|
|
5
|
A Globally Convergent Penalty-Barrier Algorithm for Nonlinear Programming and its Computational Performance", Rutcor Research Report
– Breitfeld, Shanno
- 1994
|
|
5
|
Extraction of a single source from multichannel data using sparse decomposition
– Zibulevsky, Zeevi
- 2001
|
|
4
|
A smoothing technique for nondi#erentiable optimization problems
– Ben-Tal, Teboulle
- 1989
|
|
2
|
Multiplier Methods for Convex
– Kort, Bertsekas
- 1973
|
