Affine-invariant contracting-point methods for convex optimization

DOI10.1007/s10107-021-01761-9OpenAlexW3087586233MaRDI QIDQ2687041

Nikita Doikov, Yu. E. Nesterov

Publication date: 1 March 2023

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

convex optimizationNewton methodFrank-Wolfe algorithmtrust region methodstensor methodsglobal complexity bounds

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06)

Related Items

Super-Universal Regularized Newton Method, An inexact primal-dual smoothing framework for large-scale non-bilinear saddle point problems

Cites Work

• Gradient methods for minimizing composite functions
• On lower complexity bounds for large-scale smooth convex optimization
• Lectures on convex optimization
• Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
• Complexity bounds for primal-dual methods minimizing the model of objective function
• Oracle complexity of second-order methods for smooth convex optimization
• Trust Region Methods
• Relatively Smooth Convex Optimization by First-Order Methods, and Applications
• A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications