225 search results - page 23 / 45 » Approximating Parameterized Convex Optimization Problems |
CAD
2004
Springer
13 years 8 months ago
2004
Springer
Pottmann et al. propose an iterative optimization scheme for approximating a target curve with a B-spline curve based on square distance minimization, or SDM. The main advantage o...
SIAMSC
2008
13 years 8 months ago
2008
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
TSP
2012
12 years 4 months ago
2012
Abstract—We consider a robust downlink beamforming optimization problem for secondary multicast transmission in a multiple-input multiple-output (MIMO) spectrum sharing cognitive...
ICML
2010
IEEE
13 years 9 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...