An accelerated double step size model in unconstrained optimization
From MaRDI portal
Publication:902839
DOI10.1016/j.amc.2014.10.104zbMath1328.90115MaRDI QIDQ902839
Publication date: 4 January 2016
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2014.10.104
90C26: Nonconvex programming, global optimization
65K10: Numerical optimization and variational techniques
90C53: Methods of quasi-Newton type
Related Items
INITIAL IMPROVEMENT OF THE HYBRID ACCELERATED GRADIENT DESCENT PROCESS, Unnamed Item, Modified matrix-free methods for solving system of nonlinear equations, Hybridization rule applied on accelerated double step size optimization scheme, Modification of the double direction approach for solving systems of nonlinear equations with application to Chandrasekhar’s Integral equation, Accelerated multiple step-size methods for solving unconstrained optimization problems, A two-phase rank-based algorithm for low-rank matrix completion, On the Hybridization of the Double Step Length Method for Solving System of Nonlinear Equations, A transformation of accelerated double step size method for unconstrained optimization, Hybrid modification of accelerated double direction method, Hybridization of accelerated gradient descent method, A note on hybridization process applied on transformed double step size model, A survey of gradient methods for solving nonlinear optimization, Unnamed Item
Cites Work
- Convergence of line search methods for unconstrained optimization
- Efficent line search algorithm for unconstrained optimization
- Optimization theory and methods. Nonlinear programming
- An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion
- Minimization of functions having Lipschitz continuous first partial derivatives
- Preconditioned Barzilai-Borwein method for the numerical solution of partial differential equations
- R-linear convergence of the Barzilai and Borwein gradient method
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
- On the Barzilai and Borwein choice of steplength for the gradient method
- Function minimization by conjugate gradients
- Convergence Conditions for Ascent Methods
- Accelerated gradient descent methods with line search
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item