Hybridization of accelerated gradient descent method
From MaRDI portal
Publication:1989937
DOI10.1007/s11075-017-0460-4zbMath1464.65057OpenAlexW2781207057MaRDI QIDQ1989937
Dejan Ilić, Nataša Z. Kontrec, Milena J. Petrović, Vladimir Rakočevič, Stefan R. Panić
Publication date: 29 October 2018
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-017-0460-4
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)
Related Items
Hybridization rule applied on accelerated double step size optimization scheme, Signal recovery with convex constrained nonlinear monotone equations through conjugate gradient hybrid approach, Two families of hybrid conjugate gradient methods with restart procedures and their applications, The data filtering based multiple‐stage Levenberg–Marquardt algorithm for Hammerstein nonlinear systems, A two-phase rank-based algorithm for low-rank matrix completion, A note on hybridization process applied on transformed double step size model, Hybrid modification of accelerated double direction method, A survey of gradient methods for solving nonlinear optimization, A hybrid method for solving systems of nonsmooth equations with box constraints, Theory of functional connections applied to quadratic and nonlinear programming under equality constraints, Modified matrix-free methods for solving system of nonlinear equations, Accelerated multiple step-size methods for solving unconstrained optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An accelerated double step size model in unconstrained optimization
- Linear and nonlinear programming.
- A transformation of accelerated double step size method for unconstrained optimization
- Accelerated double direction method for solving unconstrained optimization problems
- Convergence of line search methods for unconstrained optimization
- Efficent line search algorithm for unconstrained optimization
- A Picard-Mann hybrid iterative process
- 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
- Fixed Points by a New Iteration Method
- Function minimization by conjugate gradients
- Convergence Conditions for Ascent Methods
- On Steepest Descent
- Mean Value Methods in Iteration
- Convex analysis and monotone operator theory in Hilbert spaces
- Accelerated gradient descent methods with line search
