Inexact basic tensor methods for some classes of convex optimization problems
From MaRDI portal
Publication:5043845
DOI10.1080/10556788.2020.1854252zbMATH Open1502.90131OpenAlexW3112051302MaRDI QIDQ5043845FDOQ5043845
Authors: Yuri Nesterov 
Publication date: 6 October 2022
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2020.1854252
Recommendations
- On inexact solution of auxiliary problems in tensor methods for convex optimization
- Implementable tensor methods in unconstrained convex optimization
- Local convergence of tensor methods
- Reachability of optimal convergence rate estimates for high-order numerical convex optimization methods
- An optimal high-order tensor method for convex optimization
Cites Work
- Gradient methods for minimizing composite functions
- Title not available (Why is that?)
- Evaluating Derivatives
- Cubic regularization of Newton method and its global performance
- Accelerating the cubic regularization of Newton's method on convex problems
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
- Lectures on convex optimization
- Relatively smooth convex optimization by first-order methods, and applications
- A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
- Tensor methods for minimizing convex functions with Hölder continuous higher-order derivatives
- On High-order Model Regularization for Constrained Optimization
- Implementable tensor methods in unconstrained convex optimization
- Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy
- Tensor methods for finding approximate stationary points of convex functions
- On inexact solution of auxiliary problems in tensor methods for convex optimization
Cited In (12)
- On inexact solution of auxiliary problems in tensor methods for convex optimization
- Inexact tensor methods and their application to stochastic convex optimization
- Efficiency of higher-order algorithms for minimizing composite functions
- Convergence analysis of stochastic higher-order majorization–minimization algorithms
- Tensor Methods for Equality Constrained Optimization
- Generalized mirror prox algorithm for monotone variational inequalities: Universality and inexact oracle
- Implementable tensor methods in unconstrained convex optimization
- Title not available (Why is that?)
- Inexact accelerated high-order proximal-point methods
- Random Coordinate Descent Methods for Nonseparable Composite Optimization
- Inexact high-order proximal-point methods with auxiliary search procedure
- Tensor Methods for Unconstrained Optimization Using Second Derivatives
This page was built for publication: Inexact basic tensor methods for some classes of convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5043845)
