On dual convergence of the generalized proximal point method with Bregman distances

Mathematics of Operations Research

Volumn 25, Issue 4, 2000, Pages 606-624

  Iusem, Alfredo ^a   Monteiro, Renato D C ^b  

^a IMPA   (Brazil)

^b Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; LAGRANGE MULTIPLIERS; MATRIX ALGEBRA; SET THEORY; VECTORS;

BREGMAN DISTANCES; CONVEX OPTIMIZATION; DUAL CONVERGENCE; PROXIMAL POINT METHOD;

LINEAR PROGRAMMING;

EID: 0034313932     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.25.4.606.12110     Document Type: Article

References (28)

1. Adler, I., M. Resende, G. Veiga, N. Karmarkar. 1989. An implementation of Karmarkar's method for linear programming. Math. Programming 44 297-335.
2. _, R. D. C. Monteiro. 1991. Limiting behavior of the affine scaling continuous trajectories for linear programming problems. Math. Programming 50 29-51.
3. Auslender, A., R. Cominetti, M. Haddou. 1997. Asymptotic analysis for penalty and barrier methods in convex and linear programming. Math. Oper. Res. 22 43-62.
4. Ben Tal, A., M. Zibulevsky. 1997. Penalty-barrier methods for convex programming problems. SIAM J. Optim. 7 347-366.
5. Burachik, R. S. 1995. Generalized proximal point methods for the variational inequality problem. Ph.D. thesis, Instituto de Matemática Pura e Aplicada, Rio de Janeiro, Brasil.
6. Chen, G., M. Teboulle. 1993. Convergence analysis of a proximal-like optimization algorithm using Bregman functions. SIAM J. Optim. 3 538-543.
7. Hiriart-Urruty, J.-B., C. Lemaréchal. 1993. Convex Analysis and Minimization Algorithms I. Comprehensive Study in Mathematics, Vol. 305. Springer-Verlag, New York.
8. Iusem, A. 1995. On some properties of generalized proximal point methods for quadratic and linear programming. J. Optim. Theory Appl. 85 593-612.
9. _. 1998a. Augmented Lagrangian methods and proximal point methods for convex optimization. Investigación Operativa. Forthcoming.
10. _. 1998b. On some properties of generalized proximal point methods for variational inequalities. J. Optim. Theory Appl. 96 337-362.
11. _, B. Svaiter, J. Cruz. 1999. Generalized proximal point methods and Cauchy trajectories in Riemannian manifolds. SIAM J. Control Optim. 37 566-588.
12. _, _, M. Teboulle. 1994. Entropy-like proximal methods in convex programming. Math. Oper. Res. 19 790-814.
13. Jensen, D. L., R. A. Polyak. 1994. The convergence of a modified barrier method for convex programming. IBM J. Res. Dev. 38 307-321.
14. Kiwiel, K. C. 1997. Proximal minimization methods with generalized Bregman functions. SIAM J. Control Optim. 35 1142-1168.
15. Kojima, M., S. Mizuno, T. Noma. 1990. Limiting behavior of trajectories by a continuation method for monotone complementarity problems. Math. Oper. Res. 15 662-675.
16. McLinden, L. 1980a. An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem. Pacific J. Math. 88 101-161.
17. _. 1980b. The complementarity problem for maximal monotone multifunctions. R. Cottle, F. Giannessi, J.-L. Lions, eds. Variational Inequalities and Complementarity Problems. Wiley, New York, 251-270.
18. Megiddo, N. 1989. Pathways to the optimal set in linear programming. N. Megiddo, ed. Progress in Mathematical Programming: Interior Point and Related Methods. Springer Verlag, New York, 131-158.
19. Monteiro, R. D. C. 1991. Convergence and boundary behavior of the projective scaling trajectories for linear programming. Math. Oper. Res. 16 842-858.
20. _. 1992. On the continuous trajectories for a potential reduction algorithm for linear programming. Math. Oper. Res. 17 225-253.
21. _, F. Zhou. 1998. On the existence and convergence of the central path for convex programming and some duality results. Comput. Optim. Appl. 10 51-77.
22. Polyak, R., M. Teboulle. 1997. Nonlinear rescaling and proximal-like methods in convex optimization. Math. Programming 76 265-284.
23. Powell, M. J. D. 1995. Some convergence properties of the modified log barrier method for linear programming. SIAM J. Optim. 5 695-739.
24. Rockafellar, R. T. 1970. Convex Analysis. Princeton University Press, Princeton, NJ.
25. _. 1976. Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14 877-898.
26. Todd, M. J. 1990. A Dantzig-Wolfe-like variant of Karmarkar's interior-point linear programming algorithm. Oper. Res. 38 1006-1018.
27. Tseng, P., D. Bertsekas. 1993. On the convergence of the exponential multiplier method for convex programming. Math. Programming 60 1-19.
28. Tucker, A. W. 1956. Dual systems of homogeneous linear relations. Ann. Math. Stud. 38 3-18.