An active set strategy based on the multiplier function or the gradient.
type: Item
instance of: scholarly article
title: An active set strategy based on the multiplier function or the gradient.
zbMATH Open document ID: 1224.90176
author: Li Sun
author: Liang Fang
author: Guoping He
published in: Applications of Mathematics
publication date: 2011-02-11T00:00:00Z
full work available at URL: https://eudml.org/doc/37849
full work available at URL: http://hdl.handle.net/10338.dmlcz/140401
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C06
zbMATH DE Number: 5850386
zbMATH Keywords: active set
zbMATH Keywords: bound constraint
zbMATH Keywords: large scale problem
describes a project that uses: LBFGS-B
describes a project that uses: L-BFGS
MaRDI profile type: Publication
OpenAlex ID: W2006176588
cites work: Convergence properties of trust region methods for linear and convex constraints
cites work: A Feasible Active Set QP-Free Method for Nonlinear Programming
cites work: A proportioning based algorithm with rate of convergence for bound constrained quadratic programming
cites work: On the Accurate Identification of Active Constraints
cites work: An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
cites work: Generating box-constrained optimization problems
cites work: Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
cites work: A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
cites work: On the limited memory BFGS method for large scale optimization
cites work: On the Solution of Large Quadratic Programming Problems with Bound Constraints
cites work: A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
cites work: An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems
cites work: More test examples for nonlinear programming codes
cites work: An active set quasi-Newton method with projected search for bound constrained minimization
cites work: An accurate active set Newton algorithm for large scale bound constrained optimization.
cites work: Sequential systems of linear equations method for general constrained optimization without strict complementarity
cites work: A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization
cites work: Q3424475
DOI: 10.1007/S10492-010-0022-8
Recommended article: Gradient-based method with active set strategy for $\ell _1$ optimization
Recommended article: An active-set strategy in an interior point method for linear programming
Recommended article: Active-set strategy in Powell's method for optimization without derivatives
Recommended article: A multiplier rule in set-valued optimisation
Recommended article: Active set strategies in an ellipsoid algorithm for nonlinear programming
Recommended article: Q4868924
Recommended article: A stochastic multiple gradient descent algorithm
Recommended article: The Primal-Dual Active Set Strategy as a Semismooth Newton Method
Recommended article: Active set and interior methods for nonlinear optimization
Recommended article: Algorithms with active gradients combining for search of conditional minimax
description: scientific article; zbMATH DE number 5850386