Continuous Newton-like Methods Featuring Inertia and Variable Mass

DOI10.1137/23m1549675arXiv2301.08726OpenAlexW4317838089MaRDI QIDQ6188502

Camille Castera, Hedy Attouch, Jalal Fadili, Peter Ochs

Publication date: 7 February 2024

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2301.08726

zbMATH Keywords

optimizationconvex optimizationdynamical systemsdifferential equationsNewton's methods

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Newton-type methods (49M15) Dynamical systems in optimization and economics (37N40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast convex optimization via inertial dynamics with Hessian driven damping
• Global convergence of a closed-loop regularized Newton method for solving monotone inclusions in Hilbert spaces
• On the limited memory BFGS method for large scale optimization
• Improved error bounds for the Liouville Green (or WKB) approximation
• A dynamical system associated with Newton's method for parametric approximations of convex minimization problems
• A second-order gradient-like dissipative dynamical system with Hessian-driven damping. Application to optimization and mechanics.
• Asymptotic stabilization of inertial gradient dynamics with time-dependent viscosity
• Continuous Newton-like inertial dynamics for monotone inclusions
• Understanding the acceleration phenomenon via high-resolution differential equations
• A control-theoretic perspective on optimal high-order optimization
• Fast convex optimization via inertial dynamics combining viscous and Hessian-driven damping with time rescaling
• Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria
• Tikhonov regularization of a second order dynamical system with Hessian driven damping
• An extension of the second order dynamical system that models Nesterov's convex gradient method
• Non-smooth non-convex Bregman minimization: unification and new algorithms
• A dynamic approach to a proximal-Newton method for monotone inclusions in Hilbert spaces, with complexity O(1/n^2)
• A Continuous Dynamical Newton-Like Approach to Solving Monotone Inclusions
• Analysis of recursive stochastic algorithms
• From the Ravine Method to the Nesterov Method and Vice Versa: A Dynamical System Perspective
• Newton-like Inertial Dynamics and Proximal Algorithms Governed by Maximally Monotone Operators
• An Inertial Newton Algorithm for Deep Learning
• Stochastic Approximations and Differential Inclusions
• Some methods of speeding up the convergence of iteration methods
• A Family of Variable-Metric Methods Derived by Variational Means
• A new approach to variable metric algorithms
• The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
• Conditioning of Quasi-Newton Methods for Function Minimization
• Convex analysis and monotone operator theory in Hilbert spaces
• Fast optimization via inertial dynamics with closed-loop damping

This page was built for publication: Continuous Newton-like Methods Featuring Inertia and Variable Mass