Central paths, generalized proximal point methods, and Cauchy trajectories in Riemannian manifolds

SIAM Journal on Control and Optimization

Volumn 37, Issue 2, 1998, Pages 566-588

  Iusem, Alfredo N ^a   Svaiter, B F ^a   Da Cruz Neto, João Xavier ^b  

^a IMPA   (Brazil)

^b FEDERAL UNIVERSITY OF PIAUÍ   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; PROBLEM SOLVING;

COMPLEMENTARITY PROBLEMS; CONVEX PROGRAMMING; INTERIOR POINT METHODS; VARIATIONAL INEQUALITIES;

OPTIMIZATION;

EID: 0032201978     PISSN: 03630129     EISSN: None     Source Type: Journal    
DOI: 10.1137/s0363012995290744     Document Type: Article

References (39)

1. I. ADLER, M. RESENDE, G. VEIGA, AND N. KARMARKAR, An implementation of Karmarkar's method for linear programming, Math. Programming, 44 (1989), pp. 297-335.
2. I. ADLER AND R.D.C. MONTEIRO, Limiting behavior of the affine scaling continuons trajectories for linear programming, Math. Programming, 5 (1991), pp. 29-51.
3. D.A. BAYER AND J.C. LAGARIAS, The nonlinear geometry of linear programming, Trans. Amer. Math. Soc., 314 (1989), pp. 499-581.
4. L.M. BREGMAN, The relaxation method of finding the common points of convex sets and its application to the solution of problems in convex programming, USSR Comput. Math. Math. Phys., 7 (1967), pp. 200-217.
5. H. BRÉZIS, Opérateurs Monotones Maximaux et Semigroups de Contractions dans les Espaces de Hilbert, Université de Paris-CNRS, Paris, 1971.
6. R.S. BURACHIK, Generalized Proximal Point Methods for the Variational Inequality Problem, Ph.D. thesis, Instituto de Matemática Pura e Aplicada, Rio de Janeiro, Brazil, 1995.
7. R.S. BURACHIK AND A.N. IUSEM, A generalized proximal point algorithm for the variational inequality problem in a Hilbert space, SIAM J. Optim., 8 (1998), pp. 197-216.
8. Y. CENSOR AND S. ZENIOS, The proximal minimization algorithm with D-functions, J. Optim. Theory Appl., 73 (1992), pp. 451-464.
9. Y. CENSOR, A.N. IUSEM, AND S.A. ZENIOS, An interior point method with Bregman functions for the variational inequality problem with paramonotone operators. Math. Programming, 81 (1998), pp. 373-400.
10. G. CHEN AND M. TEBOULLE, Convergence analysis of a proximal-like optimization algorithm using Bregman functions, SIAM J. Optim., 3 (1993), pp. 538-543.
11. I. CSISZÁR, Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems, Ann. Statist., 19 (1991), pp. 2032-2066.
12. J. ECKSTEIN, Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming, Math. Oper. Res., 18 (1993), pp. 202-226.
13. P.P.B. EGGERMONT, Multiplicative iterative algorithms for convex programming, Linear Algebra Appl., 130 (1990), pp. 25-42.
14. J. ERIKSSON, An Iterative Primal-Dual Algorithm for Linear Programming, Technical report 85-10, Department of Mathematics, Linköping University, Linköping, Sweden, 1985.
15. L. FAYBUSOVICH, Hamiltonian structure of dynamical systems which solve linear programming problems, Phys. D, 53 (1991), pp. 217-232.
16. C.G. GONZAGA, Path following methods for linear programming, SIAM Rev., 34 (1992), pp. 167-224.
17. O. GÜLER, Existence of interior points and interior paths in nonlinear monotone complementarity problems, Math. Oper. Res., 18 (1993), pp. 128-147.
18. U. HELMKE AND J.B. MOORE, Optimization and Dynamical Systems, Springer-Verlag, London, 1994.
19. A.N. IUSEM, On some properties of generalized proximal point methods for quadratic and linear programming, J. Optim. Theory Appl., 85 (1995), pp. 593-612.
20. A.N. IUSEM, On some properties of paramonotone operators, J. Convex Anal., 5 (1998). pp. 269-278.
21. A.N. IUSEM, On some properties of generalized proximal point methods for variational inequalities, J. Optim. Theory Appl., 96 (1998), pp. 337-362.
22. A.N. IUSEM AND B.V. SVAITER, A new smoothing-regularization approach for a maximum likelihood estimation problem, Appl. Math. Optim., 29 (1994), pp. 225-241.
23. A.N. IUSEM AND M. TEBOULLE, Convergence rate analysis of nonquadratic proximal and augmented Lagrangian methods for convex and linear programming, Math. Oper. Res., 20 (1995), pp. 655-677.
24. N. KARMARKAR, Riemannian geometry underlying interior-point methods for linear programming, in Mathematical Developments Arising from Linear Programming, Contemporary Mathematics 114, J.C. Lagarias and M.J. Todd, eds., American Mathematical Society, Providence, RI, 1990, pp. 51-75.
25. D. KINDERLEHRER AND G. STAMPACCHIA, An Introduction to Variational Inequalities and Their Applications, Academic Press, New York, 1980.
26. K. KIWIEL, Free steering relaxation methods for problems with, strictly convex costs and linear constraints, Math. Oper. Res., 22 (1997), pp. 326-349.
27. K.C. KIWIEL, Proximal minimization methods with generalized Bregman functions, SIAM J. Control Optim., 35 (1997), pp. 1142-1168.
28. M. KOJIMA, S. MIZUNO, AND T. NOMA, Limiting behavior of trajectories by a continuation method for monotone complementarity problems, Math. Oper. Res., 15 (1990), pp. 662-675.
29. B. LEMAIRE, The proximal algorithm, in New Methods in Optimization and Their Industrial Uses, Intern. Ser. Numer. Math. 87, J.P. Penot, ed., Birkhauser-Verlag, Basel, Switzerland, 1989, pp. 73-87.
30. F. LIESE AND I. VAJDA, Convex Statistical Distances, Teubner, Leipzig, 1987.
31. P. MARCOTTE, A new algorithm for solving variational inequalities with applications to the traffic assignment problem, Math. Programming, 33 (1985), pp. 339-351.
32. L. MCLINDEN, An analogue of Moreau's proximation theorem, with applications to nonlinear complementarity problem, Pacific J. Math., 88 (1990), pp. 101-161.
33. N. MEGIDDO, Pathways to the optimal set in linear programming, in Progress in Mathematical Programming: Interior Point and Related Methods, N. Megiddo, ed., Springer-Verlag, New York, 1989, pp. 131-158.
34. N. MEGIDDO AND M. SHUB, Boundary behavior of interior point algorithms in linear programming, Math. Oper. Res., 14 (1989), pp. 97-146.
35. R.D.C. MONTEIRO AND T. TSUCHIYA, Limiting behavior of the derivatives of certain trajectories associated with a monotone horizontal linear complementarity problem, Math. Oper. Res., 21 (1996), pp. 793-814.
36. Y. NESTEROV AND A. NEMIROVSKII, Interior Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, PA, 1994.
37. S. NGUYEN AND C. DUPUIS, An efficient method for computing traffic equilibria in networks with asymmetric transportation costs, Transportation Sci., 18 (1984), pp. 185-202.
38. R.T. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
39. R.T. ROCKAFELLAR, Monotone operators and the proximal point algorithm, SIAM J. Control Optim., 14 (1976), pp. 877-898.