Regularized Lotka-Volterra Dynamical System as Continuous Proximal-Like Method in Optimization

  • H. Attouch
  • M. Teboulle
Article

Abstract

We introduce and study a new type of dynamical system which combines the continuous gradient method with a nonlinear Lotka-Volterra (LV) type of differential system within a logarithmic-quadratic proximal scheme. We prove a global existence and viability result for the resulting trajectory which holds for a general smooth function. The asymptotic behavior of the produced trajectory is analyzed and global convergence of the trajectory to a minimizer of the convex minimization problem over the nonnegative orthant is established. The implicit discretization which is at the origin of the proposed continuous dynamical system is an interior proximal scheme for minimizing a closed proper convex function, and convergence results and properties of the resulting discrete scheme are also established. We show finally that the trajectories of the family of regularized Lotka-Volterra systems, parametrized by the positive parameter associated with the quadratic proximal term, are uniformly convergent to the solution of the classical LV-dynamical system, as the parameter associated with the proximal term approaches zero.

Dynamical systems continuous gradient method Lotka-Volterra differential equations relative entropy asymptotic analysis viability Lyapunov functions implicit discrete scheme interior proximal algorithms regularized logarithmic barrier global convergence convex minimization 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Hofbauer, J., and Sigmund, K., The Theory of Evolution and Dynamical Systems, Cambridge University Press, Cambridge, England, 1998.Google Scholar
  2. 2.
    Alvarez, F., and Perez, J. M., A Dynamical System Associated with Newton's Method for Parametric Approximations of Convex Minimization Problems, Applied Mathematics and Optimization, Vol. 38, pp. 193–217, 1998.Google Scholar
  3. 3.
    Alvarez, F., On the Minimizing Property of Second-Order Dissipative Systems in Hilbert Spaces, SIAM Journal on Control and Optimization, Vol. 38, pp. 1102–1119, 2000.Google Scholar
  4. 4.
    Antipin, A. S., Minimization of Convex Functions on Convex Sets by Means of Differential Equations, Differential Equations, Vol. 30, pp. 1364–1374, 1994.Google Scholar
  5. 5.
    Attouch, H., and Cominetti, R., A Dynamical Approach to Convex Minimization Coupling Approximation with the Steepest Descent Method, Journal of Differential Equations, Vol. 128, pp. 519–540, 1996.Google Scholar
  6. 6.
    Attouch, H., Goudou, X., and Redont, P., The Heavy Ball with Friction Method: The Continuous Dynamical System, Communications in Contemporary Mathematics, Vol. 2, pp. 1–34, 2000.Google Scholar
  7. 7.
    Lemaire, B., An Asymptotical Variational Principle Associated with the Steepest Descent Method for a Convex Function, Journal of Convex Analysis, Vol. 3, pp. 63–70, 1996.Google Scholar
  8. 8.
    Martinet, B., Perturbation des Méthodes d'Optimisation: Applications , RAIRO Analyse Numérique, Vol. 12, pp. 153–171, 1978.Google Scholar
  9. 9.
    Rockafellar, R. T., Monotone Operators and the Proximal Point Algorithm, SIAM Journal on Control and Optimization, Vol. 14, pp. 877–898, 1976.Google Scholar
  10. 10.
    Auslender, A., and Haddou, M., An Interior Proximal Method for Convex Linearly Constrained Problems and Its Extension to Variational Inequalities, Mathematical Programming, Vol. 71, pp. 77–100, 1995.Google Scholar
  11. 11.
    Eggermont, P. P. B., Multiplicatively Iterative Algorithms for Convex Programming, Linear Algebra and Its Applications, Vol. 130, pp. 25–42, 1990.Google Scholar
  12. 12.
    Iusem, A. N., Svaiter, B., and Teboulle, M., Entropy-Like Proximal Methods in Convex Programming, Mathematics of Operations Research, Vol. 19, pp. 790–814, 1994.Google Scholar
  13. 13.
    Teboulle, M., Entropic Proximal Mappings with Application to Nonlinear Programming, Mathematics of Operations Research, Vol. 17, pp. 670–690, 1992.Google Scholar
  14. 14.
    Teboulle, M., Convergence of Proximal-Like Algorithms, SIAM Journal on Optimization, Vol. 7, pp. 1069–1083, 1997.Google Scholar
  15. 15.
    Bertsekas, D., Constrained Optimization and Lagrange Multiplier Methods, Academic Press, New York, NY, 1982.Google Scholar
  16. 16.
    Polyak, R. A., Modified Barrier Functions Theory and Methods,Mathematical Programming, Vol. 54, pp. 177–222, 1992.Google Scholar
  17. 17.
    Polyak, R. A., and Teboulle, M., Nonlinear Rescaling and Proximal-Like Methods in Convex Optimization, Mathematical Programming, Vol. 76, pp. 265–284, 1997.Google Scholar
  18. 18.
    Tseng, P., and Bertsekas, D., On the Convergence of the Exponential Multiplier Method for Convex Programming, Mathematical Programming, Vol. 60, pp. 1–19, 1993.Google Scholar
  19. 19.
    Kiwiel, K. C., Proximal Minimization Methods with Generalized Bregman Functions, SIAM Journal on Control and Optimization, Vol. 35, pp. 1142–1168, 1997.Google Scholar
  20. 20.
    Auslender, A., Teboulle, M., and Ben-tiba, S., Interior Proximal and Multiplier Methods Based on Second-Order Homogeneous Kernels, Mathematics of Operations Research, Vol. 24, pp. 645–668, 1999.Google Scholar
  21. 21.
    Rockafellar, R. T., Convex Analysis, Princeton University Press, Princeton, New Jersey, 1970.Google Scholar
  22. 22.
    Bayer, D. A., and Lagarias, J. C., The Nonlinear Geometry of Linear Programming: Part I, Affine and Projective Scaling Trajectories, Part II, Legendre Transform Coordinates and Central Trajectories, Transactions of the American Mathematical Society, Vol. 314, pp. 499–526, 1989 and Vol. 314, pp. 527-581, 1989.Google Scholar
  23. 23.
    Helmke, U., and Moore, J. B., Optimization and Dynamical Systems, Springer Verlag, London, England, 1994.Google Scholar
  24. 24.
    Bruck, R. D., Asymptotic Convergence of Nonlinear Contraction Semigroups in Hilbert Space, Journal of Functional Analysis, Vol. 18, pp. 15–26, 1975.Google Scholar
  25. 25.
    Opial, Z., Weak Convergence of the Sequence of Successive Approximations for Nonexpansive Mappings, Bulletin of the American Mathematical Society, Vol. 73, pp. 591–597 1967.Google Scholar
  26. 26.
    Liese, F., and Vajda, I., Convex Statistical Distances, Teubner, Leipzig, Germany, 1987.Google Scholar
  27. 27.
    Crouzeix, J. P., Characterizations of Generalized Convexity and Generalized Monotonicity: A Survey, Nonconvex Optimization and Applications, Vol. 27, pp. 237–256, 1998.Google Scholar
  28. 28.
    Taylor, A., Introduction to Functional Analysis, John Wiley and Sons, New York, NY, 1958.Google Scholar

Copyright information

© Plenum Publishing Corporation 2004

Authors and Affiliations

  • H. Attouch
    • 1
  • M. Teboulle
    • 2
  1. 1.Départment de MathématiquesUniversitéMontpellier IIFrance
  2. 2.School of Mathematical SciencesTel-Aviv UniversityIsrael

Personalised recommendations