An active set strategy based on the multiplier function or the gradient.

DOI10.1007/s10492-010-0022-8zbMath1224.90176OpenAlexW2006176588MaRDI QIDQ622855

Guo-Ping He, Liang Fang, Li Sun

Publication date: 11 February 2011

Published in: Applications of Mathematics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/37849

zbMATH Keywords

active setlarge scale problembound constraint

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Related Items

An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition ⋮ Image restoration by a mixed high-order total variation and \(l_1\) regularization model ⋮ An efficient adaptive three-term extension of the Hestenes–Stiefel conjugate gradient method ⋮ 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

• L-BFGS
• LBFGS-B

Cites Work

• Unnamed Item
• An accurate active set Newton algorithm for large scale bound constrained optimization.
• Sequential systems of linear equations method for general constrained optimization without strict complementarity
• A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization
• On the limited memory BFGS method for large scale optimization
• Convergence properties of trust region methods for linear and convex constraints
• An active set quasi-Newton method with projected search for bound constrained minimization
• More test examples for nonlinear programming codes
• An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems
• A proportioning based algorithm with rate of convergence for bound constrained quadratic programming
• Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
• A Feasible Active Set QP-Free Method for Nonlinear Programming
• Generating box-constrained optimization problems
• On the Solution of Large Quadratic Programming Problems with Bound Constraints
• On the Accurate Identification of Active Constraints
• 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
• A Truncated Newton Algorithm for Large Scale Box Constrained Optimization