A practical method for solving large-scale TRS
From MaRDI portal
Publication:537634
DOI10.1007/S11590-010-0201-2zbMATH Open1220.90077OpenAlexW1985851329MaRDI QIDQ537634FDOQ537634
Authors: 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
Recommendations
- Solving the quadratic trust-region subproblem in a low-memory BFGS framework
- Computational and sensitivity aspects of eigenvalue-based methods for the large-scale trust-region subproblem
- A new matrix-free algorithm for the large-scale trust-region subproblem
- Solving the trust-region subproblem by a generalized eigenvalue problem
- The trust region subproblem and semidefinite programming*
eigenvalueslarge scale optimizationtrust region subproblemL-BFGS methodnearly exact methodnegative curvature direction
Cites Work
- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
- Computing a Trust Region Step
- Solving the Trust-Region Subproblem using the Lanczos Method
- Numerical Optimization
- Benchmarking optimization software with performance profiles.
- On the limited memory BFGS method for large scale optimization
- Updating Quasi-Newton Matrices with Limited Storage
- Two-Point Step Size Gradient Methods
- Trust Region Methods
- Handbook of applied optimization
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- Title not available (Why is that?)
- A New Algorithm for Unconstrained Optimization
- Title not available (Why is that?)
- Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
- Title not available (Why is that?)
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- A new matrix-free algorithm for the large-scale trust-region subproblem
- Computing Optimal Locally Constrained Steps
- Title not available (Why is that?)
- Newton’s Method with a Model Trust Region Modification
- Minimizing a quadratic over a sphere
- Conjugate Gradient Methods with Inexact Searches
- Approximate solution of the trust region problem by minimization over two-dimensional subspaces
- A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
- Computing an Eigenvector with Inverse Iteration
- Graph Partitioning and Continuous Quadratic Programming
- Title not available (Why is that?)
- Solving the quadratic trust-region subproblem in a low-memory BFGS framework
- Implementing a proximal algorithm for some nonlinear multicommodity flow problems
Cited In (8)
- Computational and sensitivity aspects of eigenvalue-based methods for the large-scale trust-region subproblem
- Solving the quadratic trust-region subproblem in a low-memory BFGS framework
- A modified nearly exact method for solving low-rank trust region subproblem
- Accelerating the LSTRS algorithm
- On efficiently computing the eigenvalues of limited-memory quasi-Newton matrices
- On solving L-SR1 trust-region subproblems
- Algorithm 943: MSS: MATLAB software for L-BFGS trust-region subproblems for large-scale optimization
- A new matrix-free algorithm for the large-scale trust-region subproblem
Uses Software
This page was built for publication: A practical method for solving large-scale TRS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q537634)
