Barrier operators and associated gradient-like dynamical systems for constrained minimization problems

SIAM Journal on Control and Optimization

Volumn 42, Issue 4, 2003, Pages 1266-1292

  Bolte, Jéôme ^a   Teboulle, Marc ^b  

^a CNRS   (France)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Asymptotic analysis; Continuous gradient like systems; Dynamical systems; Elliptic barrier operators; Explicit and implicit discrete schemes; Interior proximal algorithms; Lotka Volterra differential equations; Lyapunov functionals; Viability

Indexed keywords

ASYMPTOTIC ANALYSIS; CONTINUOUS GRADIENT-LIKE SYSTEMS; DYNAMICAL SYSTEMS; ELLIPTIC BARRIER OPERATORS; EXPLICIT AND IMPLICIT DISCRETE SCHEMES; GLOBAL CONVERGENCE; INTERIOR PROXIMAL ALGORITHMS; LOTKA-VOLTERRA DIFFERENTIAL EQUATIONS; LYAPUNOV FUNCTIONAL; VIABILITY;

ALGORITHMS; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; DIFFERENTIAL EQUATIONS; FUNCTIONS; GRADIENT METHODS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; OPTIMIZATION;

DYNAMIC PROGRAMMING;

EID: 4043180500     PISSN: 03630129     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0363012902410861     Document Type: Article

References (37)

1. F. ALVAREZ, On the minimizing property of a second order dissipative system in Hubert spaces, SIAM J. Control Optim., 38 (2000), pp. 1102-1119.
2. F. ALVAREZ AND H. ATTOUCH, An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping, Set-Valued Anal., 9 (2001), pp. 3-11.
3. F. ALVAREZ AND J. M. PÉREZ, A dynamical system associated with Newton's method for parametric approximations of convex minimization problems, Appl. Math. Optim., 38 (1998), pp. 193-217.
4. A. S. ANTIPIN, Minimization of convex functions on convex sets by means of differential equations, Differential Equations, 30 (1994), pp. 1365-1375.
5. H. ATTOUCH, Viscosity solutions of minimization problems, SIAM J. Optim., 6 (1996), pp. 769-806.
6. 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.
7. J. P. AUBIN AND A. CELLINA, Differential Inclusions, Springer-Verlag, New York, 1984.
8. A. AUSLENDER, M. TEBOULLE, AND S. BEN-TIBA, Interior proximal and multiplier method based on second order homogeneous kernels, Math. Oper. Res., 24 (1999), pp. 645-668.
9. 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.
10. J. B. BAILLON AND G. HADDAD, Quelques propriétés des opérateurs angle-bornés et ncycliquement monotones, Israel J. Math., 26 (1977), pp. 137-150.
11. 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.
12. 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.
13. J. BOLTE, Continuous gradient projection method in Hubert spaces, J. Optim. Theory Appl., to appear.
14. H. BRÉZIS, Opérateurs Maximaux Monotones et Semi-Groupes de Contractions dars les Espaces Hilbert, North-Holland Math. Stud. 5, North-Holland, Amsterdam, 1973.
15. R. E. BRUCK, Asymptotic convergence of nonlinear contraction semi-groups in Hubert space, J. Funct. Anal., 18 (1974), pp. 15-26.
16. Y. CENSOR AND A. LENT, An iterative row-action method for interval convex programming, J. Optim. Theory Appl., 34 (1981), pp. 321-353.
17. Y. CENSOR AND S. ZENIOS, The proximal minimization algorithm with D-functions, J. Optim. Theory Appl., 73 (1992), pp. 451-464.
18. G. CHEN AND M. TEBOULLE, Convergence analysis of a proximal-like minimization algorithm using Bregman junctions, SIAM J. Optim., 3 (1993), pp. 538-543.
19. J. C DUNN, Global and asymptotic convergence rate estimates for a class of projected gradient processes, SIAM J. Control Optim., 19 (1981), pp. 368-400.
20. J. ECKSTEIN, Nonlinear proximal point algorithms using Bregman functions, with application to convex programming, Math. Oper. Res., 18 (1993), pp. 202-226.
21. Y. M. ERMOLIEV, On the method of generalized stochastic gradients and quasi-Fejer sequences, Cybernetics, 5 (1969), pp. 208-220.
22. U. HELMKE AND J. B. MOORE, Optimization and Dynamical Systems, Springer-Verlag, London, 1994.
23. J. HOFBAUER AND K. SIGMUND, The Theory of Evolution and Dynamical Systems, Cambridge University Press, Cambridge, UK, 1988.
24. A. N. IUSEM, B. F. SVAITER, AND J. X. DA CRUZ NETO, Central paths, generalized proximal point methods, and Cauchy trajectories in Riernannian manifolds, SIAM J. Control Optim., 37 (1999), pp. 566-588.
25. N. K. 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. Todd, eds., AMS, Providence, RI, 1990, pp. 51-75.
26. N. KENMOCHI AND I. PAWLOW, A class of doubly nonlinear elliptic-parabolic equations with time dependent constraints, Nonlinear Anal., 10 (1986), pp. 1181-1202.
27. K. C. KIWIEL, Proximal mimization methods with generalized Bregman functions, SIAM J. Control Optim., 35 (1997), pp. 1142-1168.
28. K. C. KIWIEL, Free-steering relaxation methods for problems with trictly convex costs and linear constraints, Math. Oper. Res., 22 (1997), pp. 326-349.
29. B. LEMAIRE, An asymptotical variational principle associated with the steepest descent method for a convex function, J. Convex Anal., 3 (1996), pp. 63-70.
30. B. LEMAIRE, The proximal point algorithm, in General Inequalities, Internat. Ser. Numer. Math, 80, J. P. Penot, ed., Birkhäser, Basel, 1987, pp. 43-87.
31. E. S. LEVITIN AND B. T. POLYAK, Constrained minimization methods, USSR Comp. Math. Phys., 6 (1965), pp. 787-823.
32. S. LOJASIEWICZ, Une propriéétopologique des sous-ensembles analytiques réls, in Les éuations aux déiv́e partielles, Editions du centre National de la Recherche Scientifique, Paris, 1962, pp. 87-89.
33. B. MARTINET, Perturbation des méthodes d'optimisation: Applications, RAIRO Anal. Numér., 12 (1978), pp. 153-171.
34. Y. NESTEROV AND A. NEMIROVSKII, Interior-Point Polynomial Algorithms in Convex Programming, SIAM Stud. Appl. Math. 13, Philadelphia, PA, 1994.
35. Z. OPIAL, Weak convergence of the sequence of successive approximations for nonexpansive mappings, Bull. Amer. Math. Soc., 73 (1967), pp. 591-597.
36. R. T. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
37. M. TEBOULLE, Entropic proximal mappings with applications to nonlinear programming, Math. Oper. Res., 17 (1992), pp. 670-690.