An active set quasi-Newton method with projected search for bound constrained minimization
From MaRDI portal
Publication:980100
DOI10.1016/j.camwa.2009.03.085zbMath1189.90160OpenAlexW2057852613MaRDI QIDQ980100
Liang Fang, Li Sun, Guo-Ping He, Yong-Li Wang
Publication date: 28 June 2010
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2009.03.085
Related Items
An active set strategy based on the multiplier function or the gradient. ⋮ Image restoration by a mixed high-order total variation and \(l_1\) regularization model ⋮ On Smoothingl1Exact Penalty Function for Constrained Optimization Problems ⋮ An accurate active set Newton algorithm for large scale bound constrained optimization. ⋮ Active set type algorithms for nonnegative matrix factorization in hyperspectral unmixing ⋮ A new smoothing method for solving nonlinear complementarity problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization
- On the limited memory BFGS method for large scale optimization
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization
- Representations of quasi-Newton matrices and their use in limited memory methods
- A proportioning based algorithm with rate of convergence for bound constrained quadratic programming
- A truncated Newton method for the solution of large-scale inequality constrained minimization problems
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- Newton Methods For Large-Scale Linear Inequality-Constrained Minimization
- A New Active Set Algorithm for Box Constrained Optimization
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- On the Accurate Identification of Active Constraints
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- Newton's Method for Large Bound-Constrained Optimization Problems
- A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
- A Limited Memory Algorithm for Bound Constrained Optimization
- Convergence of a generalized SMO algorithm for SVM classifier design
