An adaptive accelerated first-order method for convex optimization
From MaRDI portal
Recommendations
- Adaptive restart of the optimized gradient method for convex optimization
- Fast first-order methods for minimizing convex composite functions
- Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity
- A unified adaptive tensor approximation scheme to accelerate composite convex optimization
- Generalized Nesterov's accelerated proximal gradient algorithms with convergence rate of order \(o(1/k^2)\)
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A boundary point method to solve semidefinite programs
- A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs
- An Optimal Algorithm for Constrained Differentiable Convex Optimization
- An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods
- Benchmarking optimization software with performance profiles.
- Dual extrapolation and its applications to solving variational inequalities and related problems
- Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming
- First-order methods of smooth convex optimization with inexact oracle
- Interior-point gradient method for large-scale totally nonnegative least squares problems
- Introductory lectures on convex optimization. A basic course.
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- Smooth minimization of non-smooth functions
Cited in
(32)- An adaptive superfast inexact proximal augmented Lagrangian method for smooth nonconvex composite optimization problems
- Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function
- An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems
- Adaptive Catalyst for Smooth Convex Optimization
- First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants
- An inexact Spingarn's partial inverse method with applications to operator splitting and composite optimization
- An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization
- Iteration complexity of an inexact Douglas-Rachford method and of a Douglas-Rachford-Tseng's F-B four-operator splitting method for solving monotone inclusions
- A unified adaptive tensor approximation scheme to accelerate composite convex optimization
- A simple nearly optimal restart scheme for speeding up first-order methods
- Complexity-optimal and parameter-free first-order methods for finding stationary points of composite optimization problems
- Accelerated additive Schwarz methods for convex optimization with adaptive restart
- An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems
- Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions
- Accelerated primal-dual methods with adaptive parameters for composite convex optimization with linear constraints
- Adaptive restart for accelerated gradient schemes
- On inexact relative-error hybrid proximal extragradient, forward-backward and Tseng's modified forward-backward methods with inertial effects
- Adaptive FISTA for Nonconvex Optimization
- From differential equation solvers to accelerated first-order methods for convex optimization
- Fast first-order methods for composite convex optimization with backtracking
- A proximal augmented Lagrangian method for linearly constrained nonconvex composite optimization problems
- Robustness of Accelerated First-Order Algorithms for Strongly Convex Optimization Problems
- Fast first-order methods for minimizing convex composite functions
- Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity
- Projection-free accelerated method for convex optimization
- A piecewise conservative method for unconstrained convex optimization
- Adaptive Third-Order Methods for Composite Convex Optimization
- Adaptive restart of the optimized gradient method for convex optimization
- Accelerated inexact composite gradient methods for nonconvex spectral optimization problems
- On the convergence rate of the scaled proximal decomposition on the graph of a maximal monotone operator (SPDG) algorithm
- Algorithm 996
- Fast convex optimization via a third-order in time evolution equation
This page was built for publication: An adaptive accelerated first-order method for convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q276852)
