Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization.

DOI10.1023/B:JOTA.0000037603.51578.45zbMath1076.90053MaRDI QIDQ703163

Marc Teboulle, Hedy Attouch

Publication date: 11 January 2005

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

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

Mathematics Subject Classification ID

90C30: Nonlinear programming

90C51: Interior-point methods

34A60: Ordinary differential inclusions

34D20: Stability of solutions to ordinary differential equations

34C11: Growth and boundedness of solutions to ordinary differential equations

Related Items

Singular Riemannian barrier methods and gradient-projection dynamical systems for constrained optimization, An extension of proximal methods for quasiconvex minimization on the nonnegative orthant, Proximal point method for minimizing quasiconvex locally Lipschitz functions on Hadamard manifolds, Local search proximal algorithms as decision dynamics with costs to move, A numerical study of basins of attraction of zero-finding neural nets designed using control theory, On the convergence of the proximal algorithm for nonsmooth functions involving analytic features, The gradient and heavy ball with friction dynamical systems: The quasiconvex case, A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant, Asymptotic convergence of an inertial proximal method for unconstrained quasiconvex minimization, A proximal point algorithm with a ϕ-divergence for quasiconvex programming, Full convergence of the proximal point method for quasiconvex functions on Hadamard manifolds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the convergence of the exponential multiplier method for convex programming
• Multiplicative iterative algorithms for convex programming
• Modified barrier functions (theory and methods)
• Asymptotic convergence of nonlinear contraction semigroups in Hilbert space
• A dynamical system associated with Newton's method for parametric approximations of convex minimization problems
• Nonlinear rescaling and proximal-like methods in convex optimization
• Optimization and dynamical systems
• A dynamical approach to convex minimization coupling approximation with the steepest descent method
• An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
• The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
• Entropic Proximal Mappings with Applications to Nonlinear Programming
• Monotone Operators and the Proximal Point Algorithm
• Convergence of Proximal-Like Algorithms
• Proximal Minimization Methods with Generalized Bregman Functions
• Evolutionary Games and Population Dynamics
• On the Minimizing Property of a Second Order Dissipative System in Hilbert Spaces
• THE HEAVY BALL WITH FRICTION METHOD, I. THE CONTINUOUS DYNAMICAL SYSTEM: GLOBAL EXPLORATION OF THE LOCAL MINIMA OF A REAL-VALUED FUNCTION BY ASYMPTOTIC ANALYSIS OF A DISSIPATIVE DYNAMICAL SYSTEM
• Entropy-Like Proximal Methods in Convex Programming
• Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
• Weak convergence of the sequence of successive approximations for nonexpansive mappings
• Convex Analysis