Tensor methods for finding approximate stationary points of convex functions
From MaRDI portal
Recommendations
- Tensor methods for minimizing convex functions with Hölder continuous higher-order derivatives
- On inexact solution of auxiliary problems in tensor methods for convex optimization
- Lower bounds for finding stationary points II: first-order methods
- Lower bounds for finding stationary points I
- Implementable tensor methods in unconstrained convex optimization
Cites work
- Accelerated regularized Newton methods for minimizing composite convex functions
- Accelerating the cubic regularization of Newton's method on convex problems
- An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods
- Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities
- Contracting proximal methods for smooth convex optimization
- Cubic regularization of Newton method and its global performance
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- Implementable tensor methods in unconstrained convex optimization
- Inexact high-order proximal-point methods with auxiliary search procedure
- Lower bounds for finding stationary points II: first-order methods
- Minimizing uniformly convex functions by cubic regularization of Newton method
- On High-order Model Regularization for Constrained Optimization
- On inexact solution of auxiliary problems in tensor methods for convex optimization
- Regularized Newton methods for minimizing functions with Hölder continuous hessians
- Relatively smooth convex optimization by first-order methods, and applications
- Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization
- Smoothness parameter of power of Euclidean norm
- Tensor Methods for Large, Sparse Unconstrained Optimization
- Tensor methods for minimizing convex functions with Hölder continuous higher-order derivatives
- Tensor Methods for Unconstrained Optimization Using Second Derivatives
- Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
Cited in
(13)- Local convergence of tensor methods
- Lower bounds for finding stationary points I
- scientific article; zbMATH DE number 125242 (Why is no real title available?)
- Tensor methods for minimizing convex functions with Hölder continuous higher-order derivatives
- Inexact basic tensor methods for some classes of convex optimization problems
- On inexact solution of auxiliary problems in tensor methods for convex optimization
- Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization
- Adaptive Third-Order Methods for Composite Convex Optimization
- Tensor Methods for Finding Approximate Stationary Points of Convex Functions
- Higher-order Newton methods with polynomial work per iteration
- Near-optimal tensor methods for minimizing the gradient norm of convex functions and accelerated primal–dual tensor methods
- Safe zeroth-order optimization using quadratic local approximations
- On the complexity of a quadratic regularization algorithm for minimizing nonsmooth and nonconvex functions
This page was built for publication: Tensor methods for finding approximate stationary points of convex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5038435)
