Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,716,034 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.
2013
2013
Asymptotic Analysis of LASSOs Solution Path with Implications for Approximate Message Passing
A. Mousavi
,
A. Maleki
,
Richard Baraniuk
arXiv.org
2013
Corpus ID: 15010836
This paper concerns the performance of the LASSO (also knows as basis pursuit denoising) for recovering sparse signals from…
Expand
2013
2013
A Primal Dual Active Set Algorithm for a Class of Nonconvex Sparsity Optimization
Yuling Jiao
,
Bangti Jin
,
Xiliang Lu
,
Weina Ren
2013
Corpus ID: 8298841
In this paper, we consider the problem of recovering a sparse vector from noisy measurement data. Traditionally, it is formulated…
Expand
2011
2011
Plantwide Control for Economic Optimum Operation of a Recycle Process with Side Reaction
Rahul Jagtap
,
N. Kaistha
,
S. Skogestad
2011
Corpus ID: 53142004
Plantwide control system design for the economically optimum operation of a recycle process with side reaction, consisting of a…
Expand
2008
2008
Efficient Algorithms for p-Self-Protection Problem in Static Wireless Sensor Networks
Yang Wang
,
Xiangyang Li
,
Qian Zhang
IEEE Transactions on Parallel and Distributed…
2008
Corpus ID: 11485850
Wireless sensor networks have been widely used in many surveillance applications. Due to the importance of sensor nodes in such…
Expand
2007
2007
Cell Selection in 4 G Cellular Networks December 23 , 2007 1 Problem definition
2007
Corpus ID: 18527232
Consider a bipartite graph G = (I, J,E) where I = {1, 2, . . . , m} is the set of base stations and J = {1, 2, . . . , n} is the…
Expand
2003
2003
Are communication services the killer applications for Interactive TV ? or “ I left my wife because I am in love with the TV set ”
C. Quico
2003
Corpus ID: 15318716
Using the Portuguese interactive television service from TV Cabo as a working basis, this paper discusses the potential of…
Expand
2000
2000
Optimization of knots for the multi curve B-spline approximation
T. Prahasto
,
S. Bedi
Proceedings Geometric Modeling and Processing…
2000
Corpus ID: 19002073
This article presents a method for multi curve approximation with B-splines. The approximation is formulated as a constrained…
Expand
1993
1993
The Versatility of Handling Disjunctions as Constraints
J. Jourdan
,
T. Sola
Symposium on Programming Language Implementation…
1993
Corpus ID: 35140618
The first contribution of this paper is to clarify and to extend the way of handling disjunction as active constraints in CLP(FD…
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
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