Iterative Methods for Finding a Trust-region Step
From MaRDI portal
Publication:3563924
DOI10.1137/070708494zbMath1189.49049OpenAlexW2153978753MaRDI QIDQ3563924
Philip E. Gill, Joshua D. Griffin, Jennifer B. Erway
Publication date: 1 June 2010
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/070708494
Lanczos tridiagonalization processlarge-scale unconstrained optimizationtrust-region methodsconjugate-gradient method
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
A Unified Efficient Implementation of Trust-region Type Algorithms for Unconstrained Optimization, Simultaneous iterative solutions for the trust-region and minimum eigenvalue subproblem, A linear-time algorithm for trust region problems, Two globally convergent nonmonotone trust-region methods for unconstrained optimization, Shifted L-BFGS systems, On efficiently combining limited-memory and trust-region techniques, Globally Solving the Trust Region Subproblem Using Simple First-Order Methods, A limited-memory Riemannian symmetric rank-one trust-region method with a restart strategy, Performance enhancement of Gauss-Newton trust-region solver for distributed Gauss-Newton optimization method, 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, Newton-type methods for non-convex optimization under inexact Hessian information, Optimal convective heat transfer in double pipe with parabolic fins, 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, Updating the regularization parameter in the adaptive cubic regularization algorithm, On solving trust-region and other regularised subproblems in optimization, Distributed Gauss-Newton optimization method for history matching problems with multiple best matches, Error estimates for iterative algorithms for minimizing regularized quadratic subproblems, Trust-region and other regularisations of linear least-squares problems, Distributed quasi-Newton derivative-free optimization method for optimization problems with multiple local optima, The Convergence of the Generalized Lanczos Trust-Region Method for the Trust-Region Subproblem, Algorithm 943
Uses Software
