Accelerated methods for weakly-quasi-convex optimization problems

DOI10.1007/s10287-023-00468-warXiv1710.00797MaRDI QIDQ6134309

Sergey Guminov, Ilya A. Kuruzov, A. V. Gasnikov

Publication date: 22 August 2023

Published in: Computational Management Science (Search for Journal in Brave)

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

zbMATH Keywords

non-convex minimizationfirst-order methodsaccelerated methods

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

Sequential Subspace Optimization for Quasar-Convex Optimization Problems with Inexact Gradient

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational Optimal Transport: With Applications to Data Science
• Cubic regularization of Newton method and its global performance
• CVXPY: A Python-Embedded Modeling Language for Convex Optimization
• Degenerate Nonlinear Programming with a Quadratic Growth Condition
• Gradient Descent Learns Linear Dynamical Systems
• Second-order Sufficiency and Quadratic Growth for Nonisolated Minima
• Sequential Subspace Optimization for Quasar-Convex Optimization Problems with Inexact Gradient
• Primal–dual accelerated gradient methods with small-dimensional relaxation oracle
• Optimizing Static Linear Feedback: Gradient Method

This page was built for publication: Accelerated methods for weakly-quasi-convex optimization problems