Download:
|
by Alfred O. Hero
CSPL), Dept. EECS, University ofMichigan, Ann Arbor
http://www.eecs.umich.edu/~hero/Preprints/cspl-313.ps.Z
Add To MetaCart
Abstract:
In this paper, we present a study of the proximal point algorithm using very general regularizations for minimizing possibly nondierentiable and nonconvex locally Lipschitz functions. We deduce from the proximal point scheme simple and implementable bundle methods for the convex and nonconvex cases. The originality of our bundle method is that the bundle information incorporates the subgradients of both the objective and the regularization function. The resulting method opens up a broad class of regularizations which are not restricted to quadratic, convex or even dierentiable functions.
Citations
|
217
|
Self-recovering equalization and carrier tracking in two-dimensional data communication systems
– Godard
- 1980
|
|
116
|
Monotone operators and the proximal point algorithm
– Rockafellar
- 1976
|
|
81
|
A version of the bundle idea for minimizing a nonsmooth function: conceptual idea, convergence analysis, numerical results
– Schramm, Zowe
- 1992
|
|
77
|
On projection algorithms for solving convex feasibility problems
– Bauschke, Borwein
- 1996
|
|
75
|
Proximity control in bundle methods for convex nondifferentiable minimization
– Kiwiel
- 1990
|
|
63
|
Maximum likelihood for incomplete data via the EM algorithm
– Dempster, Laird, et al.
- 1977
|
|
36
|
New processing techniques based on the constant modulus adaptive algorithm
– Treichler, Larimore
- 1985
|
|
32
|
Solution of Equations and Systems of Equations
– Ostrowski
- 1966
|
|
29
|
Practical aspects of the Moreau-Yosida regularization: Theoretical preliminaries
– Lemaréchal, Sagastizábal
- 1997
|
|
28
|
Entropic Proximal Mappings with Applications to Nonlinear Programming
– Teboulle
- 1992
|
|
22
|
Regularisation d'inequation variationnelles par approximations successives. Revue Francaise d'Informatique et de Recherche Operationnelle
– Martinet
- 1970
|
|
21
|
Entropy-Like Proximal Methods in Convex Programming
– Iusem, Svaiter, et al.
- 1994
|
|
19
|
Optimization and Nonsmooth Analysis. Wiley-Interscience
– Clarke
- 1983
|
|
18
|
An aggregate subgradient method for nonsmooth convex minimization
– Kiwiel
- 1983
|
|
16
|
A method of conjugate subgradients for minimizing nondifferentiable functions
– Wolfe
- 1975
|
|
15
|
Convergence of proximal-like algorithms
– Teboulle
- 1997
|
|
14
|
An approach to variable metric bundle methods
– Lemar'echal, Sagastiz'abal
- 1994
|
|
11
|
Optimization numerique. Aspects theoriques et pratiques, volume 27
– Gilbert, Sagastizabal
- 1997
|
|
5
|
Restricted step and Levenberg-Marquard techniques in proximal bundle methods for nonconvex nondifferentiable optimization
– Kiwiel
- 1996
|
|
4
|
Hiriart Urruty and C. Lemarechal. Convex Analysis and Minimization Algorithms I-II
– B
- 1993
|
|
3
|
Estimees localement fortement homogenes. Comptes Rendus de l'Academie des Sciences
– Nikolova
- 1997
|
|
3
|
Augmented lagragians and application of the proximal point algorithm in convex programming
– Rockafellar
- 1976
|
|
3
|
New normalized constant modulus algorithms with relaxation
– Tanrikulu, Constantinides, et al.
- 1997
|
|
2
|
On a bundle algorithm for nonsmooth optimization. Nonlinear Programming
– Lemarechal, Strodiot, et al.
- 1981
|
|
2
|
A modi and extension of Lemarechal's algorithm for nonsmooth minimization. nondierential and variational techniques in optimization
– Miin
- 1982
|
|
1
|
Optimization of upper semidierentiable functions
– Bihain
- 1984
|
|
1
|
A linearization algorithm for nonsmooth minimization
– Kiwiel
- 1985
|
|
1
|
A method of linearization for linearly constrained nonconvex nonsmooth minimization
– Kiwiel
- 1986
|
|
1
|
An extention of Davidon methods to nondierentiable problems
– Lemarechal
- 1975
|
|
1
|
An algorithm for constrained optimization with semismooth functions
– Miin
- 1977
|
|
1
|
Local strong homogeneity using a regularized estimator
– Nikolova
- 1997
|
