Accelerated double direction method for solving unconstrained optimization problems

DOI10.1155/2014/965104zbMath1407.90262OpenAlexW2045806169WikidataQ59071214 ScholiaQ59071214MaRDI QIDQ1719483

Predrag S. Stanimirović, Milena J. Petrović

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/965104

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Methods of quasi-Newton type (90C53)

Related Items (16)

Hybridization rule applied on accelerated double step size optimization scheme ⋮ Unnamed Item ⋮ A transformation of accelerated double step size method for unconstrained optimization ⋮ Signal recovery with convex constrained nonlinear monotone equations through conjugate gradient hybrid approach ⋮ On the Hybridization of the Double Step Length Method for Solving System of Nonlinear Equations ⋮ A note on hybridization process applied on transformed double step size model ⋮ Unnamed Item ⋮ Modification of the double direction approach for solving systems of nonlinear equations with application to Chandrasekhar’s Integral equation ⋮ Hybrid modification of accelerated double direction method ⋮ A survey of gradient methods for solving nonlinear optimization ⋮ Hybridization of accelerated gradient descent method ⋮ INITIAL IMPROVEMENT OF THE HYBRID ACCELERATED GRADIENT DESCENT PROCESS ⋮ On solving double direction methods for convex constrained monotone nonlinear equations with image restoration ⋮ Efficient matrix-free direction method with line search for solving large-scale system of nonlinear equations ⋮ 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
• Linear and nonlinear programming.
• 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
• A multi-step curve search algorithm in nonlinear optimization
• Two-Point Step Size Gradient Methods
• An accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for unconstrained optimization
• Function minimization by conjugate gradients
• Convergence Conditions for Ascent Methods
• Accelerated gradient descent methods with line search

This page was built for publication: Accelerated double direction method for solving unconstrained optimization problems