Hessian riemannian gradient flows tn convex programming

SIAM Journal on Control and Optimization

Volumn 43, Issue 2, 2005, Pages 477-501

  Alvarez, Felipe ^a   Bolte, Jérôme ^b   Brahic, Olivier ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b CNRS   (France)

Author keywords

Bregman distance; Convex and linear programming; Existence; Global convergence; Gradient flow; Hamilton equations; Hessian Riemannian metric; Lagrange; Legendre transform coordinates; Legendre type convex function; Lyapunov functional; Quasi convex minimization

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; FUNCTIONS; HAMILTONIANS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING;

BREGMAN DISTANCE; CONVEX AND LINEAR PROGRAMMING; EXISTENCE; GLOBAL CONVERGENCE; GRADIENT FLOW; HESSIAN RIEMANNIAN METRIC; LAGRANGE AND HAMILTON EQUATIONS; LEGENDRE-TYPE CONVEX FUNCTIONS; LYAPUNOV FUNCTIONAL; QUASI-CONVEX MINIMIZATION;

LINEAR PROGRAMMING;

EID: 16244413961     PISSN: 03630129     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0363012902419977     Document Type: Article

References (44)

1. E. AKIN, The geometry of population genetics, Lecture Notes in Biomath. 31, Springer-Verlag, Berlin, 1979.
2. H. ATTOUCH, Viscosity solutions of minimization problems, SIAM J. Optim., 6 (1996), pp. 769-806.
3. H. ATTOUCH AND M. TEBOULLE, A regularized Lotka-Volterra dynamical system as a continuous proximal-like method in optimization, J. Optim. Theory Appl., to appear.
4. A. AUSLENDER, R. COMINETTI, AND M. HADDOU, Asymptotic analysis for penalty and barrier methods in convex and linear programming, Math. Oper. Res., 22 (1997), pp. 43-62.
5. H. H. BAUSCHKE, J. M. BORWEIN, AND P. L. COMBETTES, Bregman monotone optimization algorithms, SIAM J. Control Optim., 42 (2003), pp. 596-636.
6. D. A. BAYER AND J. C. LAGARIAS, The nonlinear geometry of linear programming I. Affine and protective scaling trajectories. Trans. Amer. Math. Soc., 314 (1989), pp. 499-526.
7. D. A. BAYER AND J. C. LAGARIAS, The nonlinear geometry of linear programming II. Legendre transform coordinates and central trajectories, Trans. Amer. Math. Soc., 314 (1989), pp. 527-581.
8. J. BOLTE AND M. TEBOULLE, Barrier operators and associated gradient-like dynamical systems for constrained minimization problems, SIAM J. Control Optim., 42 (2003), pp. 1266-1292.
9. L. M. BREGMAN, The relaxation method for finding the common point of convex sets and its application to the solution of problems in convex programming, Zh. Vychisl. Mat. Mat. Piz., 7 (1967), pp. 620-631 (in Russian); English translation in Comput. Math. Math. Phys., 7 (1967), pp. 200-217.
10. L. M. BREGMAN, The relaxation method for finding the common point of convex sets and its application to the solution of problems in convex programming, Zh. Vychisl. Mat. Mat. Piz., 7 (1967), pp. 620-631 (in Russian); English translation in Comput. Math. Math. Phys., 7 (1967), pp. 200-217.
11. R. W. BROCKETT, Dynamical systems that sort lists and solve linear programming problems, in Proceedings of IEEE Conference Decision and Control, Austin, Texas, 1988, IEEE Press, Piscataway, NJ, pp. 779-803.
12. R. W. BROCKETT, Dynamical systems that sort lists, diagonalize matrices and solve linear programming problems, Linear Algebra Appl., 146 (1991), pp. 79-91.
13. R. E. BRUCK, Asymptotic convergence of non linear contraction semi-groups in Hilbert space, J. Funct. Anal., 18 (1974), pp. 15-26.
14. Y. CENSOR AND A. LENT, An iterative row action method for interval convex programming, J. Optim. Theory Appl., 34 (1981), pp. 321-353.
15. Y. CENSOR AND S. A. ZENIOS, Proximal minimization algorithm with D-functions, J. Optim. Theory Appl., 73 (1992), pp. 451-464.
16. G. CHEN AND M. TEBOULLE, Convergence analysis of a proximal-like minimization algorithm using Bregman functions, SIAM J. Optim., 3 (1993), pp. 538-543.
17. R. COMINETTI, Nonlinear average and convergence of penalty trajectories in convex programming, in Ill-Posed Variational Problems and Regularization Techniques (Trier, 1998), Lecture Notes in Econom. and Math. Systems 477, Springer, Berlin, 1999, pp. 65-78.
18. R. COMINETTI AND J. SAN MARTÍN, Asymptotic analysis of the exponential penalty trajectory in linear programming, Math. Programming, 67 (1994), pp. 169-187.
19. M. P. DO CARMO, Riemannian Geometry (Mathematics, Theory, and Applications), Birkhäuser Boston, Cambridge, MA, 1992.
20. J. J. DUISTERMAAT, On Hessian Riemannian structures, Asian J. Math., 5 (2001), pp. 79-91.
21. L. E. FAYBUSOVICH, Dynamical systems which solve optimization problems with linear constraints, IMA J. Math. Control Inform., 8 (1991), pp. 135-149.
22. L. E. FAYBUSOVICH, Hamiltonian structure of dynamical systems which solve linear programming problems, Phys. D, 53 (1991), pp. 217-232.
23. L. E. FAYBUSOVICH, Interior point methods and entropy, in Proceedings of the IEEE Conference on Decision and Control, Tucson, Arizona, IEEE Press, Piscataway, NJ, 1992, pp. 1626-1631.
24. A. V. FIACCO, Perturbed variations of penalty function methods. Example: Projective SUMT, Ann. Oper. Res., 27 (1990), pp. 371-380.
25. U. HELMKE AND J. B. MOORE, Optimization and Dynamical Systems, Springer-Verlag, London, 1994.
26. S. HERZEL, M. C. RECCHINI, AND F. ZIRILLI, A quadratically convergent method for linear programming, Linear Algebra Appl., 151 (1991), pp. 255-290.
27. J. B. HIRIART-URRUTY AND C. LEMARÉCHAL, Convex Analysis and Minimization Algorithms II, Springer-Verlag, Berlin, 1996.
28. J. HOFBAUER AND K. SIGMUND, Evolutionary Games and Population Dynamics, Cambridge University Press, Cambridge, UK, 1998.
29. A. N. IUSEM AND R. D. C. MONTEIRO, On dual convergence of the generalized proximal point method with Bregman distances, Math. Oper. Res., 25 (2000), pp. 606-624.
30. A. N. IUSEM, B. F. SVAITER, AND J. X. DA CRUZ NETO, Central paths, generalized proximal point methods, and Cauchy trajectories in Riemannian manifolds, SIAM J. Control Optim., 37 (1999), pp. 566-588.
31. N. KARMARKAR, A new polynomial time algorithm for linear programming, Combinatorica, 4 (1984), pp. 373-395.
32. N. KARMARKAR, Riemannian geometry underlying interior point methods for linear programming, in Mathematical Developments Arising from Linear Programming, Contemp. Math. 114, J. C. Lagarias and M. J. Todd, eds., AMS, Providence, RI, 1990, pp. 51-76.
33. N. KENMOCHI AND I. PAWLOW, A class of doubly nonlinear elliptic-parabolic equations with time dependent constraints, Nonlinear Anal., 10 (1986), pp. 1181-1202.
34. K. C. KIWIEL, Free-steering relaxation methods for problems with strictly convex costs, Math. Oper. Res., 22 (1997), pp. 326-349.
35. K. C. KIWIEL, Proximal minimization methods with generalized Bregman functions, SIAM J. Control Optim., 35 (1997), pp. 1142-1168.
36. S. LANG, Differential and Riemannian Manifolds, Springer-Verlag, New York, 1995.
37. G. P. MCCORMICK, The continuous Projective SUMT method for convex programming, Math. Oper. Res., 14 (1989), pp. 203-223.
38. Y. NESTEROV AND M. J. TODD, On the Riemannian geometry defined by self-concordant barriers and interior-point methods, Found. Comput. Math., 2 (2002), pp. 333-361.
39. J. PALIS AND W. DE MELO, Geometric Theory of Dynamical Systems, Springer, New York, 1982.
40. R. T. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
41. R. T. ROCKAFELLAR AND J-B. R. WETS, Variational Analysis, Grundlehren Math. Wiss. 317, Springer-Verlag, Berlin, 1998.
42. S. T. SMITH, Optimization techniques on Riemannian manifolds, in Hamiltonian and Gradient Flows, Algorithms and Control, Fields Inst. Commun. 3, AMS, Providence, RI, 1994, pp. 113-136.
43. M. TEBOULLE, Entropic proximal mappings with applications to nonlinear programming, Math. Oper. Res., 17 (1992), pp. 670-690.
44. C. UDRIŞTE, Convex Functions and Optimization Methods on Riemannian Manifolds, Math. Appl., 297, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1994.