A dynamical system associated with Newton's method for parametric approximations of convex minimization problems

DOI10.1007/s002459900088zbMath0905.34057OpenAlexW4238957126MaRDI QIDQ1265410

J. M. Pérez C., F. Alvarez D.

Publication date: 2 February 1999

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002459900088

zbMATH Keywords

existenceevolution equationsasymptotic analysisconvex minimizationoptimal trajectoryapproximate methodscontinuous methods

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Initial value problems, existence, uniqueness, continuous dependence and continuation of solutions to ordinary differential equations (34A12) Nonlinear differential equations in abstract spaces (34G20) Asymptotic properties of solutions to ordinary differential equations (34D05)

Related Items

A new inertial-type hybrid projection-proximal algorithm for monotone inclusions ⋮ Approaching nonsmooth nonconvex optimization problems through first order dynamical systems with hidden acceleration and Hessian driven damping terms ⋮ Steepest descent with curvature dynamical system ⋮ Global convergence of a closed-loop regularized Newton method for solving monotone inclusions in Hilbert spaces ⋮ A speed restart scheme for a dynamics with Hessian-driven damping ⋮ A second-order gradient-like dissipative dynamical system with Hessian-driven damping. Application to optimization and mechanics. ⋮ Continuous Newton-like Methods Featuring Inertia and Variable Mass ⋮ Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization. ⋮ A second-order dynamical system with Hessian-driven damping and penalty term associated to variational inequalities ⋮ An Inertial Newton Algorithm for Deep Learning ⋮ Fixed point iterations coupled with relaxation factors and inertial effects ⋮ Curiosities and counterexamples in smooth convex optimization ⋮ A control-theoretic perspective on optimal high-order optimization