98 search results - page 4 / 20 » Bounding Recursive Procedural Models Using Convex Optimizati... |
CDC
2008
IEEE
14 years 1 months ago
2008
IEEE
— In this paper we develop a new dual decomposition method for optimizing a sum of convex objective functions corresponding to multiple agents but with coupled constraints. In ou...
JMLR
2010
13 years 5 months ago
2010
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
CAV
2000
Springer
13 years 11 months ago
2000
Springer
In this paper we show how to do symbolic model checking using Boolean Expression Diagrams (BEDs), a non-canonical representation for Boolean formulas, instead of Binary Decision Di...
SIMPRA
2008
13 years 7 months ago
2008
The Wiener model is a versatile nonlinear block oriented model structure for miscellaneous applications. In this paper a method for identifying the parameters of such a model usin...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
Online Convex Programming (OCP) is a recently developed model of sequential decision-making in the presence of time-varying uncertainty. In this framework, a decisionmaker selects ...