Exact linesearch limited-memory quasi-Newton methods for minimizing a quadratic function
From MaRDI portal
Abstract: The main focus in this paper is exact linesearch methods for minimizing a quadratic function whose Hessian is positive definite. We give a class of limited-memory quasi-Newton Hessian approximations which generate search directions parallel to those of the method of preconditioned conjugate gradients, and hence give finite termination on quadratic optimization problems in exact arithmetic. With the framework of reduced-Hessians this class provides a dynamical framework for the construction of limited-memory quasi-Newton methods. We give an indication of the performance of the methods within this framework by showing numerical simulations on sequences of related systems of linear equations, which originate from the CUTEst test collection. In addition, we give a compact representation of the Hessian approximations in the full Broyden class for the general unconstrained optimization problem. This representation consists of explicit matrices and gradients only as vector components.
Recommendations
- On exact linesearch quasi-Newton methods for minimizing a quadratic function
- Limited-Memory Reduced-Hessian Methods for Large-Scale Unconstrained Optimization
- BFGS with Update Skipping and Varying Memory
- Generalizations of the limited-memory BFGS method based on the quasi-product form of update
- Numerical Experience with Limited-Memory Quasi-Newton and Truncated Newton Methods
Cites work
- A Rapidly Convergent Descent Method for Minimization
- Benchmarking optimization software with performance profiles.
- Compact representation of the full Broyden class of quasi‐Newton updates
- Conjugate gradient algorithms in nonconvex optimization
- Conjugate Gradient Methods with Inexact Searches
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 778130 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Limited-Memory Reduced-Hessian Methods for Large-Scale Unconstrained Optimization
- Methods of conjugate gradients for solving linear systems
- On efficiently computing the eigenvalues of limited-memory quasi-Newton matrices
- On exact linesearch quasi-Newton methods for minimizing a quadratic function
- On solving large-scale limited-memory quasi-Newton equations
- Quasi-newton algorithms generate identical points
- Reduced-Hessian quasi-Newton methods for unconstrained optimization
- Representations of quasi-Newton matrices and their use in limited memory methods
- Unified approach to quadratically convergent algorithms for function minimization
- Updating Quasi-Newton Matrices with Limited Storage
- Variable Metric Method for Minimization
Cited in
(4)- Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods
- BFGS with Update Skipping and Varying Memory
- On exact linesearch quasi-Newton methods for minimizing a quadratic function
- Finding search directions in quasi-Newton methods for minimizing a quadratic function subject to uncertainty
This page was built for publication: Exact linesearch limited-memory 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 Q2044499)
