Conic Programming

Conic Programming is a type of mathematical optimization problem in which the objective is to minimize a linear function over the intersection of an affine subspace and a convex cone, distinguished from other optimization frameworks by its reliance on conic constraints that generalize linear, quadratic, and semidefinite programming.

430

Publications

33.3K

Citations

783

Authors

384

Institutions

Publications per year

2017–2026

139

Authors

783

  1. RA
    Rabih A. Jabr

    American University of Beirut, Lebanon

    14 publications · 2.1K citations

    14

    h-index

  2. AA
    Alper Atamtürk

    University of California, Berkeley, United States

    10 publications · 586 citations

    10

    h-index

  3. KT
    Kim-Chuan Toh

    National University of Singapore, Singapore

    11 publications · 670 citations

    10

    h-index

  4. JL
    Javad Lavaei

    University of California, Berkeley, United States

    9 publications · 442 citations

    9

    h-index

  5. BC
    Bikash C. Pal

    Imperial College London, United Kingdom

    8 publications · 1.1K citations

    8

    h-index

1–5 of 783

Venues

  1. SIAM Journal on Optimization

    35 publications · 3.1K citations

    26

    h-index

  2. IEEE Transactions on Power Systems

    23 publications · 4.2K citations

    21

    h-index

  3. Mathematical Programming

    26 publications · 2.2K citations

    20

    h-index

  4. Mathematics of Operations Research

    15 publications · 1.8K citations

    14

    h-index

  5. arXiv (Cornell University)

    Repository · 14 publications · 364 citations

    13

    h-index

1–5