On exact linesearch quasi-Newton methods for minimizing a quadratic function

DOI10.1007/s10589-017-9940-7zbMath1411.90248arXiv1503.01892OpenAlexW3098015857MaRDI QIDQ683343

Anders Forsgren, Tove Odland

Publication date: 6 February 2018

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.01892

zbMATH Keywords

quasi-Newton methodexact line search methodmethod of conjugate gradientsunconstrained quadratic program

Mathematics Subject Classification ID

Quadratic programming (90C20) Methods of quasi-Newton type (90C53)

Related Items (1)

Exact linesearch limited-memory quasi-Newton methods for minimizing a quadratic function

Cites Work

• On the connection between the conjugate gradient method and quasi-Newton methods on quadratic problems
• Unified approach to quadratically convergent algorithms for function minimization
• A Relationship between the BFGS and Conjugate Gradient Algorithms and Its Implications for New Algorithms
• Variable Metric Method for Minimization
• BFGS with Update Skipping and Varying Memory
• A Rapidly Convergent Descent Method for Minimization
• Function minimization by conjugate gradients
• The Limited Memory Conjugate Gradient Method
• Methods of conjugate gradients for solving linear systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On exact linesearch quasi-Newton methods for minimizing a quadratic function