Inexact accelerated high-order proximal-point methods
From MaRDI portal
Publication:2689812
DOI10.1007/s10107-021-01727-xOpenAlexW3092479710MaRDI QIDQ2689812
Publication date: 14 March 2023
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-021-01727-x
Related Items
Variants of the A-HPE and large-step A-HPE algorithms for strongly convex problems with applications to accelerated high-order tensor methods, Regularized Newton Method with Global \({\boldsymbol{\mathcal{O}(1/{k}^2)}}\) Convergence, Super-Universal Regularized Newton Method, A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems, Principled analyses and design of first-order methods with inexact proximal operators, Inexact High-Order Proximal-Point Methods with Auxiliary Search Procedure
Cites Work
- Unnamed Item
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
- Lectures on convex optimization
- Accelerating the cubic regularization of Newton's method on convex problems
- Implementable tensor methods in unconstrained convex optimization
- Superfast second-order methods for unconstrained convex optimization
- On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- Monotone Operators and the Proximal Point Algorithm
- Perturbation des méthodes d'optimisation. Applications
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Accelerated Methods for NonConvex Optimization
- Relatively Smooth Convex Optimization by First-Order Methods, and Applications
- Entropy-Like Proximal Methods in Convex Programming
- Inexact basic tensor methods for some classes of convex optimization problems
- Proximité et dualité dans un espace hilbertien
- A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
