Inexact High-Order Proximal-Point Methods with Auxiliary Search Procedure
From MaRDI portal
Publication:5013580
DOI10.1137/20M134705XzbMath1481.90255OpenAlexW3212136124MaRDI QIDQ5013580
Publication date: 1 December 2021
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/20m134705x
Related Items
Tensor methods for finding approximate stationary points of convex functions, Variants of the A-HPE and large-step A-HPE algorithms for strongly convex problems with applications to accelerated high-order tensor methods, Hyperfast second-order local solvers for efficient statistically preconditioned distributed optimization, Principled analyses and design of first-order methods with inexact proximal operators
Cites Work
- Unnamed Item
- Smooth minimization of non-smooth functions
- 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
- Oracle complexity of second-order methods for smooth convex optimization
- Cubic regularization of Newton method and its global performance
- Superfast second-order methods for unconstrained convex optimization
- Inexact accelerated high-order proximal-point methods
- New Proximal Point Algorithms for Convex Minimization
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- 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
