45 search results - page 4 / 9 » Solving polynomial least squares problems via semidefinite p... |
KDD
2007
ACM
14 years 8 months ago
2007
ACM
The kernel function plays a central role in kernel methods. In this paper, we consider the automated learning of the kernel matrix over a convex combination of pre-specified kerne...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
We present an autocalibration algorithm for upgrading a projective reconstruction to a metric reconstruction by estimating the absolute dual quadric. The algorithm enforces the ra...
JGO
2008
13 years 7 months ago
2008
This paper discusses the global minimization of rational functions with or without constraints. We studied the sum of squares (SOS) relaxations and their properties to solve this ...
AUTOMATICA
2008
13 years 8 months 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...