A TRUST REGION SUBSPACE METHOD FOR LARGE-SCALE UNCONSTRAINED OPTIMIZATION

DOI10.1142/S0217595912500212zbMath1250.90084MaRDI QIDQ2920366

Lujin Gong

Publication date: 16 October 2012

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595912500212

zbMATH Keywords

unconstrained optimization; trust region; large scale; subspace method

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C30: Nonlinear programming

Related Items

A subspace version of the Powell-Yuan trust-region algorithm for equality constrained optimization

Cites Work

• Unnamed Item
• Stochastic versus possibilistic programming
• On the limited memory BFGS method for large scale optimization
• Two new unconstrained optimization algorithms which use function and gradient values
• Representations of quasi-Newton matrices and their use in limited memory methods
• On the truncated conjugate gradient method
• A subspace implementation of quasi-Newton trust region methods for unconstrained optimization
• Reduced-Hessian Quasi-Newton Methods for Unconstrained Optimization
• The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
• On the global convergence of trust region algorithms for unconstrained minimization
• A Quasi-Newton Method with Memory for Unconstrained Function Minimization
• Trust Region Methods
• Benchmarking optimization software with performance profiles.