A piecewise conservative method for unconstrained convex optimization

DOI10.1007/s10589-021-00332-0zbMath1484.90080arXiv2009.11233OpenAlexW3215400287MaRDI QIDQ2070340

Piero Colli Franzone, A. Scagliotti

Publication date: 24 January 2022

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

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

zbMATH Keywords

convex optimizationrestart strategiesaccelerated first-order optimizationconservative dynamical model

Mathematics Subject Classification ID

Convex programming (90C25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Fast convex optimization via inertial dynamics with Hessian driven damping
• Gradient methods for minimizing composite functions
• On the convergence analysis of the optimized gradient method
• Lectures on convex optimization
• Adaptive restart of the optimized gradient method for convex optimization
• Understanding the acceleration phenomenon via high-resolution differential equations
• Restarting the accelerated coordinate descent method with a rough strong convexity estimate
• Adaptive restart for accelerated gradient schemes
• Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity
• A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights
• Introduction to Nonlinear Optimization
• Adaptive restart of accelerated gradient methods under local quadratic growth condition
• Mathematical Theories of Machine Learning - Theory and Applications
• Geometric Numerical Integration
• Some methods of speeding up the convergence of iteration methods

This page was built for publication: A piecewise conservative method for unconstrained convex optimization