560 search results - page 105 / 112 » Level-set methods for convex optimization |
142
click to vote
SODA
1993
ACM
15 years 4 months ago
1993
ACM
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
128
click to vote
AUTOMATICA
2008
15 years 3 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...
120
click to vote
WCNC
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract—In this paper, we consider a robust design of MIMOrelay precoder and receive filter for the destination nodes in a non-regenerative multiple-input multiple-output (MIMO...
105
Voted
CORR
2010
Springer
15 years 24 days ago
2010
Springer
Abstract. In this paper, we show how to efficiently and effectively extract a rich class of low-rank textures in a 3D scene from 2D images despite significant distortion and warpin...
123
click to vote
FOCM
2011
14 years 10 months ago
2011
The matrix rank minimization problem has applications in many fields such as system identification, optimal control, low-dimensional embedding etc. As this problem is NP-hard in ...