A practical method for solving large-scale TRS

DOI10.1007/s11590-010-0201-2zbMath1220.90077OpenAlexW1985851329MaRDI QIDQ537634

Yong-Cai Geng, Sumit K. Garg

Publication date: 20 May 2011

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-010-0201-2

zbMATH Keywords

eigenvalueslarge scale optimizationtrust region subproblemL-BFGS methodnearly exact methodnegative curvature direction

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20)

Related Items

On Efficiently Computing the Eigenvalues of Limited-Memory Quasi-Newton Matrices, Algorithm 943

Uses Software

• HSL
• L-BFGS
• LIBOPT
• ALGENCAN
• GQTPAR
• HSL-VF05

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the limited memory BFGS method for large scale optimization
• Approximate solution of the trust region problem by minimization over two-dimensional subspaces
• A semidefinite framework for trust region subproblems with applications to large scale minimization
• Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
• A New Matrix-Free Algorithm for the Large-Scale Trust-Region Subproblem
• Minimizing a Quadratic Over a Sphere
• Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
• Computing a Trust Region Step
• Implementing a proximal algorithm for some nonlinear multicommodity flow problems
• Solving the quadratic trust-region subproblem in a low-memory BFGS framework
• The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
• A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
• Two-Point Step Size Gradient Methods
• Updating Quasi-Newton Matrices with Limited Storage
• Computing Optimal Locally Constrained Steps
• Newton’s Method with a Model Trust Region Modification
• Conjugate Gradient Methods with Inexact Searches
• Numerical Optimization
• Computing an Eigenvector with Inverse Iteration
• Trust Region Methods
• Graph Partitioning and Continuous Quadratic Programming
• Solving the Trust-Region Subproblem using the Lanczos Method
• A New Algorithm for Unconstrained Optimization
• Benchmarking optimization software with performance profiles.