393 search results - page 41 / 79 » Convex Programming Methods for Global Optimization |
SIAMJO
2010
13 years 2 months ago
2010
We consider a recently proposed optimization formulation of multi-task learning based on trace norm regularized least squares. While this problem may be formulated as a semidefini...
AAAI
2012
11 years 10 months ago
2012
Selecting the optimal kernel is an important and difficult challenge in applying kernel methods to pattern recognition. To address this challenge, multiple kernel learning (MKL) ...
LCTRTS
2001
Springer
14 years 1 days ago
2001
Springer
Phase-decoupled methods for code generation are the state of the art in compilers for standard processors but generally produce code of poor quality for irregular target architect...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
Given observed data and a collection of parameterized candidate models, a 1- confidence region in parameter space provides useful insight as to those models which are a good fit t...
CPAIOR
2010
Springer
13 years 11 months 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...