Sciweavers

817 search results - page 48 / 164
» Exact solutions to linear programming problems
Sort
View
CDC
2008
IEEE
145views Control Systems» more  CDC 2008»
14 years 3 months ago
Parameter estimation with expected and residual-at-risk criteria
In this paper we study a class of uncertain linear estimation problems in which the data are affected by random uncertainty. In this setting, we consider two estimation criteria,...
Giuseppe Carlo Calafiore, Ufuk Topcu, Laurent El G...
NIPS
2007
13 years 10 months ago
A Constraint Generation Approach to Learning Stable Linear Dynamical Systems
Stability is a desirable characteristic for linear dynamical systems, but it is often ignored by algorithms that learn these systems from data. We propose a novel method for learn...
Sajid M. Siddiqi, Byron Boots, Geoffrey J. Gordon
CDC
2008
IEEE
167views Control Systems» more  CDC 2008»
13 years 10 months ago
Convex formulations of aggregate network air traffic flow optimization problems
The problem of regulating air traffic in the en route airspace of the National Airspace System is studied using an Eulerian network model to describe air traffic flow. The evolutio...
Daniel B. Work, Alexandre M. Bayen
JGO
2010
100views more  JGO 2010»
13 years 3 months ago
On convex relaxations of quadrilinear terms
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
Sonia Cafieri, Jon Lee, Leo Liberti
MP
2011
12 years 11 months ago
An interior-point piecewise linear penalty method for nonlinear programming
We present an interior-point penalty method for nonlinear programming (NLP), where the merit function consists of a piecewise linear penalty function (PLPF) and an 2-penalty functi...
Lifeng Chen, Donald Goldfarb