Concepedia

Convex Relaxations

Convex Relaxations is a mathematical optimization technique that reformulates a non-convex optimization problem into a convex problem by enlarging the feasible set to include non-integer or non-extreme points, thereby providing a tractable lower bound for global optimization while preserving the structure necessary for efficient solution methods.

2.4K

Publications

173.3K

Citations

4.1K

Authors

1.2K

Institutions

Publications per year

2017–2026

611

Parents

Publications

2.4K

A Singular Value Thresholding Algorithm for Matrix Completion

Jian‐Feng Cai, Emmanuel J. Candès, Zuowei Shen · SIAM Journal on Optimization · 2010 · 5.9K citations

, , +16

Sparse Subspace Clustering: Algorithm, Theory, and Applications

Ehsan Elhamifar, René Vidal · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2013 · 3.1K citations

, , +17

The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming

L.M. Bregman · USSR Computational Mathematics and Mathematical Physics · 1967 · 2.7K citations

, , +12

Weighted Nuclear Norm Minimization with Application to Image Denoising

Shuhang Gu, Lei Zhang, Wangmeng Zuo et al. · 2014 · 2.3K citations

, , +15

The Power of Convex Relaxation: Near-Optimal Matrix Completion

Emmanuel J. Candès, Terence Tao · IEEE Transactions on Information Theory · 2010 · 2.1K citations

, , +15

1–5 of 2.4K

Authors

4.1K

  1. SH
    Steven H. Low

    California Institute of Technology, United States

    21 publications · 3.7K citations

    19

    h-index

  2. DC
    Daniel Cremers

    Technical University of Munich, Germany

    20 publications · 1.5K citations

    18

    h-index

  3. JB
    Jean B. Lasserre

    Laboratoire d'Analyse et d'Architecture des Systèmes, France

    20 publications · 2K citations

    17

    h-index

  4. MK
    Masakazu Kojima

    Tokyo Institute of Technology, Japan

    18 publications · 1.3K citations

    15

    h-index

  5. JL
    Javad Lavaei

    University of California, Berkeley, United States

    17 publications · 1K citations

    14

    h-index

1–5 of 4.1K

Institutions

1.2K

  1. Massachusetts Institute of Technology

    Cambridge, United States

    41 h-index

    141 publications

    9.9K citations

  2. Princeton University

    Princeton, United States

    37 h-index

    90 publications

    10.3K citations

  3. Stanford University

    Stanford, United States

    34 h-index

    105 publications

    12.1K citations

  4. California Institute of Technology

    Pasadena, United States

    33 h-index

    91 publications

    12.5K citations

  5. Centre National de la Recherche Scientifique

    Paris, France

    30 h-index

    102 publications

    6.1K citations

  6. Carnegie Mellon University

    Pittsburgh, United States

    30 h-index

    84 publications

    4.5K citations

  7. University of California, Berkeley

    Berkeley, United States

    28 h-index

    116 publications

    9K citations

  8. University of Minnesota

    Minneapolis, United States

    27 h-index

    73 publications

    5.4K citations

1–8 of 1.2K

Venues

  1. Mathematical Programming

    149 publications · 14.1K citations

    58

    h-index

  2. SIAM Journal on Optimization

    89 publications · 14.5K citations

    47

    h-index

  3. IEEE Transactions on Power Systems

    65 publications · 8K citations

    45

    h-index

  4. Journal of Optimization Theory and Applications

    93 publications · 3.8K citations

    34

    h-index

  5. IEEE Transactions on Signal Processing

    56 publications · 5.3K citations

    34

    h-index

1–5