Sciweavers

5331 search results - page 135 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
CDC
2009
IEEE
115views Control Systems» more  CDC 2009»
14 years 7 months ago
Reduction of decentralized control problems to tractable representations
For decentralized control problems with quadratically invariant information constraints, the optimal controller may be found efficiently. In this paper, we show that there are sys...
Laurent Lessard, Sanjay Lall
ICASSP
2008
IEEE
15 years 4 months ago
Learning the kernel via convex optimization
The performance of a kernel-based learning algorithm depends very much on the choice of the kernel. Recently, much attention has been paid to the problem of learning the kernel it...
Seung-Jean Kim, Argyrios Zymnis, Alessandro Magnan...
SIAMJO
2000
88views more  SIAMJO 2000»
14 years 9 months ago
A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems
Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generat...
Paul Armand, Jean Charles Gilbert, Sophie Jan-J&ea...
PSD
2004
Springer
132views Database» more  PSD 2004»
15 years 3 months ago
Computational Experiments with Minimum-Distance Controlled Perturbation Methods
Minimum-distance controlled perturbation is a recent family of methods for the protection of statistical tabular data. These methods are both efficient and versatile, since can dea...
Jordi Castro
CISS
2008
IEEE
15 years 4 months ago
Subgradient methods in network resource allocation: Rate analysis
— We consider dual subgradient methods for solving (nonsmooth) convex constrained optimization problems. Our focus is on generating approximate primal solutions with performance ...
Angelia Nedic, Asuman E. Ozdaglar