A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization
From MaRDI portal
Publication:870176
DOI10.1016/j.amc.2006.06.119zbMath1114.65069OpenAlexW2095500937MaRDI QIDQ870176
Publication date: 12 March 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.06.119
numerical examplesNonlinear optimizationstationary pointlimited memory methodgradient projection methodbound constrained problemBroyden-Fletcher-Goldfarb-Shanno (BFGS) method
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)
Related Items
Trust region algorithm with two subproblems for bound constrained problems, Projected affine-scaling interior-point Newton's method with line search filter for box constrained optimization, Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm, An active set strategy based on the multiplier function or the gradient., An active set limited memory BFGS algorithm for bound constrained optimization, Limited memory BFGS method with backtracking for symmetric nonlinear equations, An accurate active set Newton algorithm for large scale bound constrained optimization., An active set quasi-Newton method with projected search for bound constrained minimization, A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Representations of quasi-Newton matrices and their use in limited memory methods
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- An approach to nonlinear programming
- Convergence of Trust Region Algorithms for Optimization with Bounds when Strict Complementarity Does Not Hold
- Numerical methods for large-scale nonlinear optimization
- Projected gradient methods for linearly constrained problems
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- On the Identification of Active Constraints
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- Algorithm 778: L-BFGS-B
- Exposing Constraints
- CUTE
- A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- Newton's Method for Large Bound-Constrained Optimization Problems
- Projected Newton Methods for Optimization Problems with Simple Constraints
- A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
- A Limited Memory Algorithm for Bound Constrained Optimization
- An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
- Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
