Conjugate gradient methods using quasi-Newton updates with inexact line searches

DOI10.1016/0022-247X(90)90109-SzbMath0711.65046OpenAlexW2067520085MaRDI QIDQ922642

Osman Ulular, Hanif D. Sherali

Publication date: 1990

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(90)90109-s

zbMATH Keywords

conjugate gradient methodnonlinear programminginexact line searchquasi-Newton updatestest problemquasi-Newton condition

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Iterative numerical methods for linear systems (65F10)

Related Items (13)

Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update ⋮ Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions ⋮ Lagrangian and branch-and-cut approaches for upgrading spanning tree problems ⋮ A relax-and-cut framework for large-scale maximum weight connected subgraph problems ⋮ A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems ⋮ An adaptive modified three-term conjugate gradient method with global convergence ⋮ The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches ⋮ An enhanced response surface methodology (RSM) algorithm using gradient deflection and second-order search strategies. ⋮ Algorithmic expedients for the prize collecting Steiner tree problem ⋮ Network flow-based approaches for integrated aircraft fleeting and routing ⋮ On using exterior penalty approaches for solving linear programming problems ⋮ Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization ⋮ Optimal solution of the discrete cost multicommodity network design problem

Cites Work

• A new three-term conjugate gradient method
• A conjugate direction algorithm without line searches
• An approach to nonlinear programming
• Alternative proofs of the convergence properties of the conjugate- gradient method
• Convergence Properties of Algorithms for Nonlinear Optimization
• Conjugate Gradient Methods less Dependent on Conjugacy
• Technical Note—A Modified Conjugate Gradient Algorithm
• A Relationship between the BFGS and Conjugate Gradient Algorithms and Its Implications for New Algorithms
• Optimal conditioning of self-scaling variable Metric algorithms
• Restart procedures for the conjugate gradient method
• Conjugate Gradient Methods with Inexact Searches
• A Rapidly Convergent Descent Method for Minimization
• Function minimization by conjugate gradients
• Recent advances in unconstrained optimization
• Methods of conjugate gradients for solving linear systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Conjugate gradient methods using quasi-Newton updates with inexact line searches