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
2010
Highly Cited
2010
It is difficult to find the optimal sparse solution of a manifold learning based dimensionality reduction algorithm. The lasso or… 
Highly Cited
2010
Highly Cited
2010
Sparse modeling is a powerful framework for data analysis and processing. Traditionally, encoding in this framework is performed… 
Highly Cited
2004
Highly Cited
2004
Common to all orthogonal frequency division multiplexing (OFDM) systems is a large peak-to-average-power ratio (PAR), which can… 
Highly Cited
2002
Highly Cited
2002
In aircraft control, control allocation can be used to distribute the total control effort among the actuators when the number of… 
Highly Cited
1999
Highly Cited
1999
This paper presents a detailed workload characterization study of a World-Wide Web proxy. Measurements from a proxy within an… 
Highly Cited
1998
Highly Cited
1998
This dissertation investigates the phenomenon of dissimilation from a theoretical perspective, with special attention to… 
Highly Cited
1995
Highly Cited
1995
Consider a parametric nonlinear optimization problem subject to equality and inequality constraints. Conditions under which a… 
Highly Cited
1987
Highly Cited
1987
A problem that arises in positioning an articulated figure is the solution of 3D joint positions (kinematics) when goal positions… 
Highly Cited
1983
Highly Cited
1976
Highly Cited
1976
Shapley introduced an index theory for bimatrix games that oriented the paths generated by the Lemke-Howson algorithm and thus…