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