Proximal minimization methods with generalized bregman functions

SIAM Journal on Control and Optimization

Volumn 35, Issue 4, 1997, Pages 1142-1168

  Kiwiel, Krzysztof C ^a  

^a SYSTEMS RESEARCH INSTITUTE   (Poland)

Author keywords

B functions; Bregman functions; Convex programming; Nondifferentiable optimization; Proximal methods

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FUNCTIONS; NONLINEAR PROGRAMMING; OPTIMIZATION;

BREGMAN PROXIMAL MINIMIZATION; CONVEX PROGRAMMING; NONDIFFERENTIABLE OPTIMIZATION; PROXIMAL POINT ALGORITHMS;

CONVERGENCE OF NUMERICAL METHODS;

EID: 0031190440     PISSN: 03630129     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0363012995281742     Document Type: Article

References (48)

1. A. AUSLENDER, Numerical methods for nondifferentiable convex optimization, Math. Programming Stud., 30 (1986), pp. 102-126.
2. H. H. BAUSCHKE AND J. M. BORWEIN, Legendre functions and the method of random Bregman projections, J. Convex Anal., 4 (1997), to appear.
3. D. P. BERTSEKAS, Constrained Optimization and Lagrange Multiplier Methods, Academic Press, New York, 1982.
4. D. P. BERTSEKAS AND P. TSENG, Partial proximal minimization algorithms for convex programming, SIAM J. Optim., 4 (1994), pp. 551-572.
5. [Bre67] L. M. BREGMAN, The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming, Zh. Vychisl. Mat. i Mat. Fiz., 7 (1967), pp. 620-631 (in Russian). English transl. in U.S.S.R. Comput. Math. and Math. Phys., 7 (1967), pp. 200-217.
6. [Bre67] L. M. BREGMAN, The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming, Zh. Vychisl. Mat. i Mat. Fiz., 7 (1967), pp. 620-631 (in Russian). English transl. in U.S.S.R. Comput. Math. and Math. Phys., 7 (1967), pp. 200-217.
7. M. G. BREITFELD AND D. F. SHANNO, Computational Experience with Modified Log-Barrier Methods for Nonlinear Programming, Research Report RRR 17-93, RUTCOR, Rutgers Univ., New Brunswick, NJ, 1993. Revised March 1994.
8. [BrS94] M. G. BREITFELD AND D. F. SHANNO, A Globally Convergent Penalty-Barrier Algorithm for Nonlinear Programming and Its Computational Performance, Research Report RRR 12-94, RUTCOR, Rutgers Univ., New Brunswick, NJ, 1994.
9. [BTYZ92] A. BEN-TAL, I. YUZEFOVICH, AND M. ZIBULEVSKY, Penalty/Barrier Multiplier Methods for Minimax and Constrained Smooth Convex Programs, Research Report 9/92, Optimization Laboratory, Technion, Haifa, Israel, 1992.
10. J. V. BURKE AND M. C. FERRIS, Weak sharp minima in mathematical programming, SIAM J. Control Optim., 31 (1993), pp. 1340-1359.
11. Y. CENSOR, A. R. DE PIERRO, AND A. N. IUSEM, Optimization of Burg's entropy over linear constraints, Appl. Numer. Math., 7 (1991), pp. 151-165.
12. Y. CENSOR AND A. LENT, An iterative row action method for interval convex programming, J. Optim. Theory Appl., 34 (1981), pp. 321-353.
13. Y. CENSOR AND S. A. ZENIOS, Proximal minimization algorithm with D-functions, J. Optim. Theory Appl., 73 (1992), pp. 451-464.
14. A. R. CONN, N. I. M. GOULD, AND PH. L. TOINT, A Globally Convergent Lagrangian Barrier Algorithm for Optimization with General Inequality Constraints and Simple Bounds, Report 92/07, Département de Mathématique, Facultés Universitaires de Namur, Namur, 1992.
15. A. R. CONN, N. I. M. GOULD, AND PH. L. TOINT, Large-scale nonlinear constrained optimization: A current survey, in Algorithms for Continuous Optimization: The State of the Art, E. Spedicato, ed., Kluwer, Dordrecht, the Netherlands, 1994, pp. 287-327.
16. I. CHABINI, Nouvelles Méthodes Séquentielles et Parallèles pour l'Optimisation de Réseaux à Coôts Linéaires et Convexes, Ph.D. thesis, Département d'informatique et de recherche opérationelle, Université de Montréal, Montréal, Québec, Canada, 1994.
17. G. CHEN AND M. TEBOULLE, Convergence analysis of a proximal-like minimization algorithm using Bregman functions, SIAM J. Optim., 3 (1993), pp 538-543.
18. R. CORREA AND C. LEMARÉCHAL, Convergence of some algorithms for convex minimization, Math. Programming, 62 (1993), pp. 261-275
19. J. ECKSTEIN AND D. P. BERTSEKAS, On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators Math Programming, 55 (1992), pp. 293-318.
20. J. ECKSTEIN, Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming, Math. Oper. Res., 18 (1993), pp. 202-226.
21. P. P. B. EGGERMONT, Multiplicative iterative algorithms for convex programming, Linear Algebra Appl., 130 (1990), pp. 25-42.
22. M. C. FERRIS, Finite termination of the proximal point algorithm, Math Programming, 50 (1991), pp. 359-366.
23. A. V. FIACCO AND G. P. MCCORMICK, Nonlinear Programming: Sequential Unconstrained Minimization Techniques, Wiley, New York, 1968.
24. S. D. FLÅM, Equilibrium Programming Using Proximal-like Algorithms, Working Paper, Dept. of Economics, Univ. of Bergen, Bergen, Norway 1994
25. P. E. GILL, W. MURRAY, M. A. SAUNDERS, AND M. H. WRIGHT, Shifted Barrier Methods for Linear Programming, Report SOL 88-9, Department of Operations Research, Stanford Univ., Stanford, CA, 1988.
26. E. G. GOLSHTEIN AND N. V. TRETYAKOV, Modified Lagrange Functions; Theory and Optimization Methods, Nauka, Moscow, 1989 (in Russian).
27. O. GÜLER, On the convergence of the proximal point algorithm for convex minimization, SIAM J. Control Optim., 29 (1991), pp. 403-419.
28. A. N. IUSEM, B. SVAITER, AND M. TEBOULLE, Entropy-like proximal methods in convex programming, Math. Oper. Res., 19 (1994), pp. 790-814.
29. A. N. IUSEM, On some properties of generalized proximal point methods for quadratic and linear programming, J. Optim. Theory Appl., (1995), to appear.
30. A. N. IUSEM AND M. TEBOULLE, On the convergence rate of entropic proximal optimization algorithms, Math. Apl. Comput., 12 (1993), pp 153-168.
31. D. L. JENSEN AND R. A. POLYAK, The convergence of a modified barrier method for convex programming, IBM J. Res. Develop., 38 (1994), pp. 307-321.
32. K. C. KIWIEL, On the twice differentiate cubic augmented Lagrangian, J. Optim. Theory Appl., 88 (1996), to appear.
33. K. C. KIWIEL, Free-steering relaxation methods for problems with strictly convex costs and linear constraints, Math. Oper. Res., (1996), to appear.
34. B. LEMAIRE, The proximal algorithm, in New Methods in Optimization and Their Industrial Uses, Internat. Ser. Numer. Math. 87, J. P. Penot, ed., Birkhäuser, Basel, 1989, pp. 73-87.
35. B. MARTINET, Régularisation d'inéquations variationelles par approximations successives, RAIRO Rech. Opér., 4(R3) (1970), pp. 154-158.
36. S. S. NIELSEN AND S. A. ZENIOS, Massively parallel algorithms for singly constrained convex programs, ORSA J. Comput., 4 (1992), pp. 166-181.
37. S. S. NIELSEN AND S. A. ZENIOS, A massively parallel algorithm for nonlinear stochastic network problems, Oper. Res., 41 (1993), pp. 319-337.
38. S. S. NIELSEN AND S. A. ZENIOS, Proximal minimizations with D-functions and the massively parallel solution of linear network programs, Comput. Optim. Appl., 1 (1993), pp. 375-398.
39. S. G. NASH, R. POLYAK, AND A. SOFER, A numerical comparison of barrier and modified barrier methods for large-scale bound-constrained optimization, in Large Scale Optimization: State of the Art, W. W. Hager, D. W. Hearn, and P. M. Pardalos, eds., Kluwer, Dordrecht, the Netherlands, 1994, pp. 319-338.
40. B. T. POLYAK, Introduction to Optimization, Nauka, Moscow, 1983. English transl., Optimization Software Inc., New York, 1987.
41. R. POLYAK, Modified barrier functions (theory and methods), Math. Programming, 54 (1992), pp. 177-222.
42. R. POLYAK AND M. TEBOULLE, Nonlinear rescaling and proximal-like methods in convex optimization, Math. Programming, 76 (1997), pp. 265-284.
43. R. T. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
44. R. T. ROCKAFELLAR, Augmented Lagrangians and applications of the proximal point algorithm in convex programming, Math. Oper. Res., 1 (1976), pp. 97-116.
45. R. T. ROCKAFELLAR, Monotone operators and the proximal point algorithm, SIAM J. Control Optim., 14 (1976), pp. 877-898.
46. M. TEBOULLE, Entropic proximal mappings with applications to nonlinear programming, Math. Oper. Res., 17 (1992), pp. 670-690.
47. P. TSENG AND D. P. BERTSEKAS, On the convergence of the exponential multiplier method for convex programming, Math. Programming, 60 (1993), pp. 1-19.
48. P. TSENG, Dual ascent methods for problems with strictly convex costs and linear constraints: A unified approach, SIAM J. Control Optim., 28 (1990), pp. 214-242.