Keywords (1)

Academic
Publications
Convex Optimization

Convex Optimization,10.1109/TAC.2006.884922,Stephen P. Boyd,Lieven Vandenberghe

Convex Optimization   (Citations: 6681)
BibTex | RIS | RefWorks Download
Published in 2004.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...LS has been widely used in surface reconstruction [19], shape from shading [20], high dynamic range compression [21], image matting and fusion [16], and various model fitting scenarios [22], [23]...
    • ...We also investigate whether AE’s robustness can be achieved by bounding the LS solution [43] or using L1 instead of L2 norm [23]...

    Stella Yuet al. Angular Embedding: A Robust Quadratic Criterion

    • ...The problem <0001" ref-type="disp-formula">(1) can be solved by a general method, for example, 2 5 6 28...

    R. Kučeraet al. An interior-point algorithm for the minimization arising from 3D conta...

    • ...The maximization of AU(F) is a concave optimization problem that can be efficiently solved when a problem is not too large (Boyd & Vandenberghe, 2004)...

    Takashi Takenouchiet al. An Extension of the Receiver Operating Characteristic Curve and AUC-Op...

    • ...The choice of regularization by l1-norm ensures that the problem both remains convex (Bertsekas, 2009; Boyd & Vandenberghe, 2004; Dattorro, 2008) and favors sparse solutions (Chen et al, 1998; Tibshirani, 1996)...

    Tao Huet al. A Network of Spiking Neurons for Computing Sparse Representations in a...

  • Sort by: