A practical method for solving large-scale TRS
From MaRDI portal
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*
Cites work
- scientific article; zbMATH DE number 1186893 (Why is no real title available?)
- scientific article; zbMATH DE number 3725604 (Why is no real title available?)
- scientific article; zbMATH DE number 47223 (Why is no real title available?)
- scientific article; zbMATH DE number 1047685 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
- A New Algorithm for Unconstrained Optimization
- A new matrix-free algorithm for the large-scale trust-region subproblem
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- Approximate solution of the trust region problem by minimization over two-dimensional subspaces
- Benchmarking optimization software with performance profiles.
- Computing Optimal Locally Constrained Steps
- Computing a Trust Region Step
- Computing an Eigenvector with Inverse Iteration
- Conjugate Gradient Methods with Inexact Searches
- Graph Partitioning and Continuous Quadratic Programming
- Handbook of applied optimization
- Implementing a proximal algorithm for some nonlinear multicommodity flow problems
- Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
- Minimizing a quadratic over a sphere
- Newton’s Method with a Model Trust Region Modification
- Numerical Optimization
- On the limited memory BFGS method for large scale optimization
- Solving the Trust-Region Subproblem using the Lanczos Method
- Solving the quadratic trust-region subproblem in a low-memory BFGS framework
- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- Trust Region Methods
- Two-Point Step Size Gradient Methods
- Updating Quasi-Newton Matrices with Limited Storage
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
- A new matrix-free algorithm for the large-scale trust-region subproblem
- Algorithm 943: MSS: MATLAB software for L-BFGS trust-region subproblems for large-scale optimization
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)
