An active set limited memory BFGS algorithm for bound constrained optimization
From MaRDI portal
Publication:638888
DOI10.1016/j.apm.2011.01.036zbMath1221.90082OpenAlexW2048609669MaRDI QIDQ638888
Publication date: 16 September 2011
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2011.01.036
Related Items
A limited memory quasi-Newton trust-region method for box constrained optimization, Trust region algorithm with two subproblems for bound constrained problems, Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm, 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, A tensor trust-region model for nonlinear system, An active-set projected trust-region algorithm with limited memory BFGS technique for box-constrained nonsmooth equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence analysis of a modified BFGS method on convex minimizations
- A conjugate gradient method with descent direction for unconstrained optimization
- A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization
- The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization
- A conjugate gradient method for unconstrained optimization problems
- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- A modified PRP conjugate gradient method
- New quasi-Newton equation and related methods for unconstrained optimization
- Representations of quasi-Newton matrices and their use in limited memory methods
- The superlinear convergence of a modified BFGS-type method for unconstrained optimization
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- New quasi-Newton methods for unconstrained optimization problems
- New line search methods for unconstrained optimization
- On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems
- Convergence of Trust Region Algorithms for Optimization with Bounds when Strict Complementarity Does Not Hold
- A New Active Set Algorithm for Box Constrained 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
- Variable Metric Method for Minimization
- Algorithm 778: L-BFGS-B
- 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
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- 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
- Algorithm 813
- Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
- A New Algorithm for Unconstrained Optimization
- A modified BFGS method and its global convergence in nonconvex minimization
