Several kinds of acceleration techniques for unconstrained optimization first-order algorithms

DOI10.12286/JSSX.J2023-1114MaRDI QIDQ6665360FDOQ6665360

Authors: Yongxin Chen, Deren Han 

Publication date: 17 January 2025

Published in: Mathematica Numerica Sinica (Search for Journal in Brave)

Recommendations

• First-order methods for convex optimization
• Optimized first-order methods for smooth convex minimization
• Acceleration of conjugate gradient algorithms for unconstrained optimization
• Objective acceleration for unconstrained optimization
• First-order methods in optimization

zbMATH Keywords

unconstrained optimizationfirst-order algorithmsacceleration techniques

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Stochastic programming (90C15)

Cites Work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Adaptive subgradient methods for online learning and stochastic optimization
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Smooth minimization of non-smooth functions
• Adaptive restart for accelerated gradient schemes
• Title not available (Why is that?)
• Gradient methods for minimizing composite functions
• A Stochastic Approximation Method
• Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
• Two-Point Step Size Gradient Methods
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• Iterative Procedures for Nonlinear Integral Equations
• An analysis for the DIIS acceleration method used in quantum chemistry calculations
• An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods
• Accelerated and inexact forward-backward algorithms
• Step-sizes for the gradient method
• A Nonmonotone Line Search Technique for Newton’s Method
• An inexact accelerated proximal gradient method for large scale linearly constrained convex SDP
• The cyclic Barzilai-–Borwein method for unconstrained optimization
• Accelerated gradient methods for nonconvex nonlinear and stochastic programming
• Efficiency of coordinate descent methods on huge-scale optimization problems
• Accelerated, parallel, and proximal coordinate descent
• An optimal method for stochastic composite optimization
• A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
• Analysis of monotone gradient methods
• A new stepsize for the steepest descent method
• Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods. I, II
• On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method
• Title not available (Why is that?)
• \(R\)-linear convergence of the Barzilai and Borwein gradient method
• Krylov subspace acceleration for nonlinear multigrid schemes
• Performance of first-order methods for smooth convex minimization: a novel approach
• Optimized first-order methods for smooth convex minimization
• On the Barzilai and Borwein choice of steplength for the gradient method
• Some methods of speeding up the convergence of iteration methods
• Alternate step gradient method*
• Monotone projected gradient methods for large-scale box-constrained quadratic programming
• Backtracking strategies for accelerated descent methods with smooth composite objectives
• Gradient methods for large scale convex quadratic functions
• New Proximal Point Algorithms for Convex Minimization
• On the convergence analysis of the optimized gradient method
• Lectures on convex optimization
• Broyden updating, the good and the bad!
• Convergence of a relaxed inertial proximal algorithm for maximally monotone operators
• Nonmonotone line searches for optimization algorithms
• On Bernoulli's numerical solution of algebraic equations.
• On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions
• Stochastic heavy ball
• The developments of proximal point algorithms
• Newton acceleration on manifolds identified by proximal gradient methods
• Globally Convergent Type-I Anderson Acceleration for Nonsmooth Fixed-Point Iterations

Cited In (1)

• Acceleration algorithms for iterative methods

This page was built for publication: Several kinds of acceleration techniques for unconstrained optimization first-order algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6665360)