Sciweavers

452 search results - page 12 / 91
» A convex optimization approach to the mode acceleration prob...
Sort
View
CCE
2004
13 years 7 months ago
Computational studies using a novel simplicial-approximation based algorithm for MINLP optimization
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special s...
Vishal Goyal, Marianthi G. Ierapetritou
COLT
2006
Springer
13 years 11 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
CVPR
2011
IEEE
13 years 3 months ago
Accelerated Low-Rank Visual Recovery by Random Projection
Exact recovery from contaminated visual data plays an important role in various tasks. By assuming the observed data matrix as the addition of a low-rank matrix and a sparse matri...
Yadong Mu, Jian Dong, Xiaotong Yuan, Shuicheng Yan
CVPR
2009
IEEE
15 years 2 months ago
Continuous Ratio Optimization via Convex Relaxation with Applications to Multiview 3D Reconstruction
We introduce a convex relaxation framework to optimally minimize continuous surface ratios. The key idea is to minimize the continuous surface ratio by solving a sequence of con...
Kalin Kolev (University of Bonn), Daniel Cremers (...
CORR
2004
Springer
103views Education» more  CORR 2004»
13 years 7 months ago
Online convex optimization in the bandit setting: gradient descent without a gradient
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
Abraham Flaxman, Adam Tauman Kalai, H. Brendan McM...