High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods
type: Item
instance of: scholarly article
title: High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods
author: Masoud Ahookhosh
author: Yuri Nesterov
published in: Mathematical Programming. Series A. Series B
publication date: 2024-11-07T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 49J52
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 7940323
zbMATH Keywords: convex composite optimization
zbMATH Keywords: high-order proximal-point operator
zbMATH Keywords: bi-level optimization framework
zbMATH Keywords: lower complexity bounds
zbMATH Keywords: optimal methods
zbMATH Keywords: superfast methods
MaRDI profile type: Publication
cites work: Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity
cites work: A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima
cites work: Finding zeros of Hölder metrically subregular mappings via globally convergent Levenberg–Marquardt methods
cites work: Oracle complexity of second-order methods for smooth convex optimization
cites work: A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
cites work: Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
cites work: First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
cites work: Regularized Newton Methods for Minimizing Functions with Hölder Continuous Hessians
cites work: New Proximal Point Algorithms for Convex Minimization
cites work: Entropy-Like Proximal Methods in Convex Programming
cites work: Relatively Smooth Convex Optimization by First-Order Methods, and Applications
cites work: Q5618030
cites work: Q5633161
cites work: Q3967358
cites work: Smooth minimization of non-smooth functions
cites work: Accelerating the cubic regularization of Newton's method on convex problems
cites work: Gradient methods for minimizing composite functions
cites work: Universal gradient methods for convex optimization problems
cites work: Lectures on convex optimization
cites work: Inexact accelerated high-order proximal-point methods
cites work: Superfast second-order methods for unconstrained convex optimization
cites work: Q4324980
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: Entropic Proximal Mappings with Applications to Nonlinear Programming
DOI: 10.1007/S10107-023-02041-4
description: scientific article; zbMATH DE number 7940323