An active set limited memory BFGS algorithm for large-scale bound constrained optimization
From MaRDI portal
Publication:929334
DOI10.1007/s00186-007-0199-0zbMath1145.90084OpenAlexW2074901996MaRDI QIDQ929334
Publication date: 17 June 2008
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-007-0199-0
Related Items
Trust region algorithm with two subproblems for bound constrained problems ⋮ Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm ⋮ An inexact quasi-Newton algorithm for large-scale \(\ell_1\) optimization with box constraints ⋮ Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization ⋮ An active-set projected trust region algorithm for box constrained optimization problems ⋮ An active set limited memory BFGS algorithm for bound constrained optimization ⋮ Limited memory BFGS method with backtracking for symmetric nonlinear equations ⋮ Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization ⋮ An active set quasi-Newton method with projected search for bound constrained minimization ⋮ An active-set projected trust-region algorithm with limited memory BFGS technique for box-constrained nonsmooth equations
Uses Software
Cites Work
- Some numerical experiments with variable-storage quasi-Newton algorithms
- On the limited memory BFGS method for large scale optimization
- Representations of quasi-Newton matrices and their use in limited memory methods
- Validation of an augmented Lagrangian algorithm with a Gauss-Newton Hessian approximation using a set of hard-spheres problems
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- Convergence of Trust Region Algorithms for Optimization with Bounds when Strict Complementarity Does Not Hold
- Numerical methods for large-scale nonlinear optimization
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- On the Identification of Active 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
- Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
