A Subspace Minimization Method for the Trust-Region Step
From MaRDI portal
Publication:3586143
DOI10.1137/08072440XzbMath1195.49042MaRDI QIDQ3586143
Jennifer B. Erway, Philip E. Gill
Publication date: 6 September 2010
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
preconditioningKrylov methodslarge-scale unconstrained optimizationtrust-region methodsconjugate-gradient methods
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Numerical methods based on nonlinear programming (49M37) Iterative numerical methods for linear systems (65F10)
Related Items
A linear-time algorithm for trust region problems, Two globally convergent nonmonotone trust-region methods for unconstrained optimization, A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization, A limited-memory Riemannian symmetric rank-one trust-region method with a restart strategy, A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants, Limited-memory BFGS systems with diagonal updates, Trust-region algorithms for training responses: machine learning methods using indefinite Hessian approximations, Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem, A new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimization, A Block Lanczos Method for the Extended Trust-Region Subproblem, trlib: a vector-free implementation of the GLTR method for iterative solution of the trust region problem, A matrix-free line-search algorithm for nonconvex optimization, On solving L-SR1 trust-region subproblems, A Riemannian subspace limited-memory SR1 trust region method, A trust-region method for unconstrained multiobjective problems with applications in satisficing processes, Updating the regularization parameter in the adaptive cubic regularization algorithm, On solving trust-region and other regularised subproblems in optimization, QPLIB: a library of quadratic programming instances, Error estimates for iterative algorithms for minimizing regularized quadratic subproblems, Gradient Descent Finds the Cubic-Regularized Nonconvex Newton Step, The Convergence of the Generalized Lanczos Trust-Region Method for the Trust-Region Subproblem, Algorithm 943
Uses Software
