93 search results - page 4 / 19 » On representations of the feasible set in convex optimizatio... |
ATAL
2005
Springer
14 years 1 months ago
2005
Springer
There are many situations where an agent can perform one of several sets of actions in responses to changes in its environment, and the agent chooses to perform the set of actions...
SIAMJO
2010
13 years 6 months ago
2010
A linear matrix inequality (LMI) is a condition stating that a symmetric matrix whose entries are affine linear combinations of variables is positive semidefinite. Motivated by th...
CDC
2009
IEEE
13 years 12 months ago
2009
IEEE
In this paper, we show the optimality of a certain class of disturbance-affine control policies in the context of one-dimensional, constrained, multi-stage robust optimization. Ou...
CCE
2004
13 years 7 months ago
2004
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special s...
COLT
2006
Springer
13 years 11 months ago
2006
Springer
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...