Proximal Point Methods and Nonconvex Optimization

Journal of Global Optimization

Volumn 13, Issue 4, 1998, Pages 389-406

  Kaplan, A ^a   Tichatschke, R ^a  

^a UNIVERSITY OF TRIER   (Germany)

Author keywords

Ill posed problems; Nonconvex optimization; Proximal point methods; Regularization

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FUNCTIONS; MAPPING; MATHEMATICAL OPERATORS; OPTIMIZATION;

ILL-POSED PROBLEM; NONCONVEX OPTIMIZATION; PROXIMAL POINT METHODS; REGULARIZATION;

PROBLEM SOLVING;

EID: 0000422429     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008321423879     Document Type: Article

References (29)

1. Alart, P. and Lemaire, B. (1991), Penalization in non-classical convex programming via variational convergence, Math. Programming 51: 307-331.
2. Antipin, A.S. (1976), On a method for convex programs using a symmetrical modification of the Lagrange function, Ekonomika i Mat. Metody 12: 1164-1173.
3. Auslender, A. (1987), Numerical methods for nondifferentiable convex optimization, Math. Programming Study 30: 102-126.
4. Auslender, A., Crouzeix, J.P. and Fedit, P. (1987), Penalty proximal methods in convex programming, J. Opt. Theory Appl. 55: 1-21.
5. Censor, Y. and Zenios, S.A. (1992), Proximal minimization algorithm with D-functions, J. Optim. Theory Appl. 73: 451-464.
6. Chen, G. and Teboulle, M. (1993), Convergence analysis of a proximal-like minimization algorithm using Bregman functions, SIAM J. Optim. 3: 538-543.
7. Chen, G. and Teboulle, M. (1994), A proximal-based decomposition method for convex minimization problems, Math. Programming 64: 81-101.
8. Clarke, F.H. (1983), Optimization and Nonsmooth Analysis, Wiley, New York.
9. Demyanov, V.F. and Rubinov, A.M. (1990), Fundations of Nonsmooth Analysis and Quasidifferential Calculus, Nauka, Moscow (in Russian).
10. Dennis, J.E. and Schnabel, R.B. (1989), A view of unconstrained optimization, in G.L. Nemhauser, A.H.G. Rinnooy-Kan and M.J. Todd (eds.), Optimization - Handbooks of Operations Research and Management Science, Vol. 1, pp. 1-72, North-Holland, Amsterdam.
11. Eckstein, J. and Bertsekas, D. (1992), On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators, Math. Programming 55: 293-318.
12. Ekeland, I. and Temam, R. (1976), Convex Analysis and Variational Problems, North-Holland, Amsterdam.
13. Fukushima, M. and Mine, H. (1981), A generalized proximal point algorithm for certain non-convex minimization problems, Int. J. Systems Sci. 12: 989-1000.
14. Ibaraki, S., Fukushima, M. and Ibaraki, T. (1992), Primal-dual proximal point algorithm for linearly constrained convex programming problems, Comput. Opt. Appl. 1: 207-226.
15. Iusem, A.N., Svaiter, B.F. and Teboulle, M. (1994) Entropy-like proximal methods in convex programming, Math. Oper. Res. 19: 790-814.
16. Kaplan, A. and Tichatschke, R. (1992) A regularized penalty method for solving convex semi-infinite programs, Optimization 26: 215-228.
17. Kaplan, A. and Tichatschke, R. (1994), Stable Methods for Ill-Posed Variational Problems - Prox-Regularization of Elliptical Variational Inequalities and Semi-Infinite Optimization Problems, Akademie Verlag, Berlin.
18. Kaplan, A. and Tichatschke, R. (1996), A note on the paper 'Multi-step-prox regularization methods for solving convex variational problems', Optimization 37: 149-152.
19. Kaplan, A. and Tichatschke, R. (1997), Prox-regularization and solution of ill-posed elliptic variational inequalities, Applications of Mathematics 42: 111-145.
20. Kiwiel, K. (1989), An ellipsoid trust region bundle method for nonsmooth convex minimization, SIAM J. Control Optim. 27: 737-757.
21. Kiwiel, K. (1996), Restricted step and Levenberg-Marquardt techniques in proximal bundle methods for non-convex nondifferentiable optimization, SIAM J. Optimization 6: 227-249.
22. Lemaire, B. (1988), Coupling optimization methods and variational convergence, ISNM 84: 163-179.
23. Lemaire, B. (1995), On the convergence of some iterative methods for convex minimization, in R. Durier and Ch. Michelot (eds.), Recent Developments in Optimization, pp. 252-268 [Lecture Notes in Econ. and Mathem. Systems, vol. 429], Springer Verlag, Berlin.
24. Martinet, B. (1970), Régularisation d'inéquations variationelles par approximations successives, RIRO 4: 154-159.
25. Pshenichnyi, B.N. (1983), Methods of Linearization, Nauka, Moscow (in Russian).
26. Rockafellar, R.T. (1976), Augmented Lagrange multiplier functions and applications of the proximal point algorithm in convex programming, Math. Oper. Res. 1: 97-116.
27. Rockafellar, R.T. (1976), Monotone operators and the proximal point algorithm, SIAM J. Control and Optimization 14: 877-898.
28. Schramm, H. and Zowe, J. (1988), A combination of the bundle approach and the trust region concept, in J. Guddat et al. (eds.), Advances in Mathematical Optimization, Vol. 45, pp. 196-209, Akademie-Verlag, Berlin.
29. Spingarn, J.E. (1981-1982), Submonotone mappings and the proximal point algorithms, Numer. Funct. Anal. and Optimiz. 4: 123-150.