A modified nearly exact method for solving low-rank trust region subproblem
From MaRDI portal
Publication:868456
DOI10.1007/s10107-006-0025-0zbMath1138.90012OpenAlexW2135778653MaRDI QIDQ868456
Renato D. C. Monteiro, Zhaosong Lu
Publication date: 5 March 2007
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0025-0
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smoothing by spline functions. II
- Modified barrier functions (theory and methods)
- Two new unconstrained optimization algorithms which use function and gradient values
- Computational experience with penalty-barrier methods for nonlinear programming
- Computing a Trust Region Step
- 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
- Computing Optimal Locally Constrained Steps
- Newton’s Method with a Model Trust Region Modification
- An Estimate for the Condition Number of a Matrix
- Numerical Optimization
- Trust Region Methods
- The trust region subproblem and semidefinite programming*
- Solving the Trust-Region Subproblem using the Lanczos Method
- A Class of Indefinite Dogleg Path Methods for Unconstrained Minimization
- CUTEr and SifDec
