1477 search results - page 164 / 296 » Random Convex Programs |
CPAIOR
2010
Springer
14 years 10 days ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
ATAL
2008
Springer
13 years 11 months ago
2008
Springer
This demonstration shows an agent-based model for the electricity power market, in which the optimal power flow is determined in a bottom-up fashion. Here, each agent controls a s...
NIPS
2004
13 years 10 months ago
2004
We propose a new method for clustering based on finding maximum margin hyperplanes through data. By reformulating the problem in terms of the implied equivalence relation matrix, ...
ICML
2010
IEEE
13 years 10 months ago
2010
IEEE
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
ICML
2010
IEEE
13 years 10 months ago
2010
IEEE
A sparse representation of Support Vector Machines (SVMs) with respect to input features is desirable for many applications. In this paper, by introducing a 0-1 control variable t...