Skip to search formSkip to main contentSkip to account menu

Active set method

Known as: Working basis, Active constraint, Active set 
In mathematical optimization, a problem is defined using an objective function to minimize or maximize, and a set of constraints that define the… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
We develop an affine-scaling algorithm for box-constrained optimization which has the property that each iterate is a scaled… 
1999
1999
A robotic system is described with associated components for registration and fixation capable of performing total knee… 
Highly Cited
1987
Highly Cited
1987
The nonlinear parametric programming problem is reformulated as a closed system of nonlinear equations so that numerical… 
Highly Cited
1987
Highly Cited
1987
In this paper, we consider the problem of temporally coordinating the resource demands of a set of independent agents. We assume… 
Highly Cited
1987
Highly Cited
1987
An efficient and rigorous strategy is presented for evaluating the first-order sensitivity of the optimal solution to changes in… 
1973
1973
Several algorithms are presented for solving the non-linear programming problem, based on “variable-metric” projections of the… 
1964
1964
Abstract : A variant of the simplex method is given for solving linear programs with M + L equations, L of which have the…