Inexact high-order proximal-point methods with auxiliary search procedure
From MaRDI portal
Recommendations
- Inexact accelerated high-order proximal-point methods
- On inexact solution of auxiliary problems in tensor methods for convex optimization
- Inexact basic tensor methods for some classes of convex optimization problems
- Inexact proximal point methods in metric spaces
- Inexact and accelerated proximal point algorithms
Cites work
- A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
- Accelerated methods for nonconvex optimization
- Accelerating the cubic regularization of Newton's method on convex problems
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Cubic regularization of Newton method and its global performance
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- Entropy-Like Proximal Methods in Convex Programming
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- Implementable tensor methods in unconstrained convex optimization
- Inexact accelerated high-order proximal-point methods
- Inexact basic tensor methods for some classes of convex optimization problems
- Lectures on convex optimization
- New Proximal Point Algorithms for Convex Minimization
- Oracle complexity of second-order methods for smooth convex optimization
- Perturbation des méthodes d'optimisation. Applications
- Proximité et dualité dans un espace hilbertien
- Relatively smooth convex optimization by first-order methods, and applications
- Smooth minimization of non-smooth functions
- Superfast second-order methods for unconstrained convex optimization
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
Cited in
(18)- Inexact accelerated high-order proximal-point methods
- 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
- Inexact tensor methods and their application to stochastic convex optimization
- High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods
- Near-optimal tensor methods for minimizing the gradient norm of convex functions and accelerated primal–dual tensor methods
- Perseus: a simple and optimal high-order method for variational inequalities
- Second-order methods for quartically-regularised cubic polynomials, with applications to high-order tensor methods
- Accelerated adaptive cubic regularized quasi-Newton methods
- Quartic regularity
- Nesterov's acceleration at the limit: first-order schemes
- A Homogeneous Tensor Framework for High-Order Trust-Region and Spherical Polynomial Optimization
- Lower complexity bounds for minimizing regularized functions
- Cubic-quartic regularization models for solving polynomial subproblems in third-order tensor methods
- Minimizing quasi-self-concordant functions by gradient regularization of Newton method
- Efficient implementation of third-order tensor methods with adaptive regularization for unconstrained optimization
This page was built for publication: Inexact high-order proximal-point methods with auxiliary search procedure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5013580)
