An accelerated double step size model in unconstrained optimization
From MaRDI portal
Recommendations
- A transformation of accelerated double step size method for unconstrained optimization
- Accelerated double direction method for solving unconstrained optimization problems
- Accelerated multiple step-size methods for solving unconstrained optimization problems
- Acceleration of conjugate gradient algorithms for unconstrained optimization
- A note on hybridization process applied on transformed double step size model
Cites work
- scientific article; zbMATH DE number 3718477 (Why is no real title available?)
- scientific article; zbMATH DE number 3529352 (Why is no real title available?)
- scientific article; zbMATH DE number 3320765 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- A multi-step curve search algorithm in nonlinear optimization: nondifferentiable convex case
- Accelerated gradient descent methods with line search
- An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion
- An unconstrained optimization test functions collection
- Convergence Conditions for Ascent Methods
- Convergence of line search methods for unconstrained optimization
- Efficent line search algorithm for unconstrained optimization
- Function minimization by conjugate gradients
- Minimization of functions having Lipschitz continuous first partial derivatives
- On an optimization algorithm for \(LC^1\) unconstrained optimization
- On the Barzilai and Borwein choice of steplength for the gradient method
- Optimization theory and methods. Nonlinear programming
- Preconditioned Barzilai-Borwein method for the numerical solution of partial differential equations
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
- \(R\)-linear convergence of the Barzilai and Borwein gradient method
Cited in
(16)- Initial improvement of the hybrid accelerated gradient descent process
- Accelerated double direction method for solving unconstrained optimization problems
- On the Hybridization of the Double Step Length Method for Solving System of Nonlinear Equations
- Accelerated multiple step-size methods for solving unconstrained optimization problems
- An improved derivative-free method via double direction approach for solving systems of nonlinear equations
- Solving systems of nonlinear equations using improved double direction method
- Modified matrix-free methods for solving system of nonlinear equations
- Hybrid modification of accelerated double direction method
- Modification of the double direction approach for solving systems of nonlinear equations with application to Chandrasekhar's integral equation
- A two-phase rank-based algorithm for low-rank matrix completion
- Hybridization rule applied on accelerated double step size optimization scheme
- Hybridization of accelerated gradient descent method
- A note on hybridization process applied on transformed double step size model
- A transformation of accelerated double step size method for unconstrained optimization
- scientific article; zbMATH DE number 786546 (Why is no real title available?)
- A survey of gradient methods for solving nonlinear optimization
This page was built for publication: An accelerated double step size model in unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q902839)
