On exact linesearch quasi-Newton methods for minimizing a quadratic function
From MaRDI portal
Abstract: This paper concerns exact linesearch quasi-Newton methods for minimizing a quadratic function whose Hessian is positive definite. We show that by interpreting the method of conjugate gradients as a particular exact linesearch quasi-Newton method, necessary and sufficient conditions can be given for an exact linesearch quasi-Newton method to generate a search direction which is parallel to that of the method of conjugate gradients. We also analyze update matrices and give a complete description of the rank-one update matrices that give search direction parallel to those of the method of conjugate gradients. In particular, we characterize the family of such symmetric rank-one update matrices that preserve positive definiteness of the quasi-Newton matrix. This is in contrast to the classical symmetric-rank-one update where there is no freedom in choosing the matrix, and positive definiteness cannot be preserved. The analysis is extended to search directions that are parallel to those of the preconditioned method of conjugate gradients in a straightforward manner.
Recommendations
- Exact linesearch limited-memory quasi-Newton methods for minimizing a quadratic function
- Minimization of extended quadratic functions with inexact line searches
- A quadratic approximation method for minimizing a class of quasidifferentiable functions
- Quasi-Newton approaches to interior point methods for quadratic problems
- scientific article; zbMATH DE number 2166157
- scientific article; zbMATH DE number 3865005
- Quasi-Newton methods for solving nonlinear programming problems
- On the construction of minimization methods of quasi-Newton type
- An algorithm for global minimization of linearly constrained quadratic functions
- Convergence of quasi-Newton method with new inexact line search
Cites work
- A Rapidly Convergent Descent Method for Minimization
- A Relationship between the BFGS and Conjugate Gradient Algorithms and Its Implications for New Algorithms
- BFGS with Update Skipping and Varying Memory
- Function minimization by conjugate gradients
- scientific article; zbMATH DE number 3912096 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Methods of conjugate gradients for solving linear systems
- On the connection between the conjugate gradient method and quasi-Newton methods on quadratic problems
- The Limited Memory Conjugate Gradient Method
- Unified approach to quadratically convergent algorithms for function minimization
- Variable Metric Method for Minimization
Cited in
(9)- The linear algebra of block quasi-Newton algorithms
- An LP empirical quadrature procedure for parametrized functions
- Exact linesearch limited-memory quasi-Newton methods for minimizing a quadratic function
- Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods
- On the connection between the conjugate gradient method and quasi-Newton methods on quadratic problems
- Quasi-Newton minimization for the p(x)-Laplacian problem
- Inexact Newton Method for Minimization of Convex Piecewise Quadratic Functions
- On the Derivation of Quasi-Newton Formulas for Optimization in Function Spaces
- Finding search directions in quasi-Newton methods for minimizing a quadratic function subject to uncertainty
This page was built for publication: On exact linesearch quasi-Newton methods for minimizing a quadratic function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q683343)
