Implicitly restarted projection algorithm for solving optimization problems
An algorithm for solving the problem of minimizing a quadratic function subject to ellipsoidal constraints is introduced. This algorithm is based on the implicitly restarted Lanczos method to construct a basis for the Krylov subspace in conjunction with a model trust region strategy to choose the step. The trial step is computed on the small dimensional subspace that lies inside the trust region. One of the main advantages of this algorithm is the way that the Krylov subspace is terminated. The author introduces a termination condition that allows the gradient to be decreased on that subspace. A convergence theory for this algorithm is presented. It is shown that this algorithm is globally convergent and it should cope quite well with large scale minimization problems. This theory is sufficiently general that it holds for any algorithm that projects the problem on a lower-dimensional subspace.
- Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
- Newton-Krylov type algorithm for solving nonlinear least squares problems
- Krylov subspace methods for trust-region subproblem and beyond
- scientific article; zbMATH DE number 3922383
- scientific article; zbMATH DE number 2051074
- A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
- A Global Convergence Theory for the Celis–Dennis–Tapia Trust-Region Algorithm for Constrained Optimization
- A second-order method for unconstrained optimization
- A Theoretical Comparison of the Arnoldi and GMRES Algorithms
- Computing a Trust Region Step
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- scientific article; zbMATH DE number 3671573 (Why is no real title available?)
- Hybrid Krylov Methods for Nonlinear Systems of Equations
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
- Newton’s Method with a Model Trust Region Modification
- Preconditioners for Indefinite Systems Arising in Optimization
- Preconditioning of Truncated-Newton Methods
- Safeguarded use of the implicit restarted lanczos technique for solving non‐linear structural eigensystems
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric Systems
- Truncated-Newton algorithms for large-scale unconstrained optimization
This page was built for publication: Implicitly restarted projection algorithm for solving optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4508639)