Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,285 papers from all fields of science
Search
Sign In
Create Free Account
Active set method
Known as:
Working basis
, Active constraint
, Active set
Expand
In mathematical optimization, a problem is defined using an objective function to minimize or maximize, and a set of constraints that define the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
10 relations
Artelys Knitro
Feasible region
Frank–Wolfe algorithm
Kernel perceptron
Expand
Broader (1)
Mathematical optimization
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
An Online Active Set Strategy for Fast Parametric Quadratic Programming in MPC Applications
Hans Joachim Ferreau
,
H. Bock
,
M. Diehl
2006
Corpus ID: 63573529
1999
1999
Interior point SQP strategies for large-scale, structured process optimization problems
J. S. Albuquerque
,
V. Gopal
,
George H. Staus
,
L. Biegler
,
B. Ydstie
1999
Corpus ID: 17795602
1999
1999
Intra-operative Application of a Robotic Knee Surgery System
S. Harris
,
M. Jakopec
,
J. Cobb
,
B. Davies
International Conference on Medical Image…
1999
Corpus ID: 29571730
A robotic system is described with associated components for registration and fixation capable of performing total knee…
Expand
1990
1990
Chemical process optimization using Newton-like methods
A. Lucia
,
J. Xu
1990
Corpus ID: 9766348
Highly Cited
1987
Highly Cited
1987
Bifurcation problems in nonlinear parametric programming
A. Poore
,
C. Tiahrt
Mathematical programming
1987
Corpus ID: 206818956
The nonlinear parametric programming problem is reformulated as a closed system of nonlinear equations so that numerical…
Expand
Highly Cited
1987
Highly Cited
1987
A Probabilistic Framework for Resource-Constrained Multi-Agent Planning
N. Muscettola
,
Stephen F. Smith
International Joint Conference on Artificial…
1987
Corpus ID: 14088411
In this paper, we consider the problem of temporally coordinating the resource demands of a set of independent agents. We assume…
Expand
Highly Cited
1987
Highly Cited
1987
A reduced hessian strategy for sensitivity analysis of optimal flowsheets
Natarajan Ganesh
,
L. Biegler
1987
Corpus ID: 5611730
An efficient and rigorous strategy is presented for evaluating the first-order sensitivity of the optimal solution to changes in…
Expand
1975
1975
An alternate implementation of Goldfarb's minimization algorithm
A. Buckley
Mathematical programming
1975
Corpus ID: 40265702
Goldfarb's algorithm, which is one of the most successful methods for minimizing a function of several variables subject to…
Expand
1973
1973
Projection methods for non-linear programming
R. Sargent
,
B. Murtagh
Mathematical programming
1973
Corpus ID: 206799521
Several algorithms are presented for solving the non-linear programming problem, based on “variable-metric” projections of the…
Expand
1964
1964
GENERALIZED UPPER BOUNDED TECHNIQUES FOR LINEAR PROGRAMMING - I
G. Dantzig
,
R. V. Slyke
1964
Corpus ID: 118309405
Abstract : A variant of the simplex method is given for solving linear programs with M + L equations, L of which have the…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE