270 search results - page 25 / 54 » Constraint relaxation in approximate linear programs |
101
click to vote
4OR
2006
15 years 15 days ago
2006
This paper is based on the study of the set of nondecomposable integer solutions in a Gomory corner polyhedron, which was recently used in a reformulation method for integer linear...
95
Voted
CDC
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract— In this paper we demonstrate how one can reformulate the MPC problem for LPV systems to a series of mpLPs by a closed-loop minimax MPC algorithm based on dynamic progra...
105
click to vote
ICIP
2005
IEEE
16 years 2 months ago
2005
IEEE
For video communications over wireless ad hoc networks, multiple paths with limited bandwidth are common. It therefore presents new challenges to the video encoding. In this paper...
107
click to vote
AAIM
2009
Springer
15 years 7 months ago
2009
Springer
Polyhedra are widely used in model checking and abstract interpretation. Polyhedral analysis is effective when the relationships between variables are linear, but suffers from im...
103
click to vote
AUTOMATICA
2008
15 years 17 days ago
2008
A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...