article

An exact duality theory for semidefinite programming and its complexity implications

Author:

Motakuri V. RamanaAuthors Info & Claims

Mathematical Programming: Series A and B, Volume 77, Issue 2

Pages 129 - 162

Published: 01 May 1997 Publication History

Abstract

No abstract available.

Cited By

View all

Gribling SPolak SSlot L(2023)A note on the computational complexity of the moment-SOS hierarchy for polynomial optimizationProceedings of the 2023 International Symposium on Symbolic and Algebraic Computation10.1145/3597066.3597075(280-288)Online publication date: 24-Jul-2023
https://dl.acm.org/doi/10.1145/3597066.3597075
Gambella CMarecek JMevissen M(2019)Projections onto the Set of Feasible Inputs and the Set of Feasible Solutions2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)10.1109/ALLERTON.2019.8919776(937-943)Online publication date: 24-Sep-2019
https://dl.acm.org/doi/10.1109/ALLERTON.2019.8919776
Banjac GGoulart PStellato BBoyd S(2019)Infeasibility Detection in the Alternating Direction Method of Multipliers for Convex OptimizationJournal of Optimization Theory and Applications10.1007/s10957-019-01575-y183:2(490-519)Online publication date: 1-Nov-2019
https://dl.acm.org/doi/10.1007/s10957-019-01575-y
Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Mathematical Programming: Series A and B

Mathematical Programming: Series A and B Volume 77, Issue 2

May 1, 1997

217 pages

ISSN:0025-5610

Editors:
J. R. Birge
Univ. of Michigan, Ann Arbor
,
Michael Overton
New York Univ., New York
,
Henry Wolkowicz
Univ. of Waterloo, Waterloo, Ont., Canada

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 May 1997

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

22
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Gribling SPolak SSlot L(2023)A note on the computational complexity of the moment-SOS hierarchy for polynomial optimizationProceedings of the 2023 International Symposium on Symbolic and Algebraic Computation10.1145/3597066.3597075(280-288)Online publication date: 24-Jul-2023
https://dl.acm.org/doi/10.1145/3597066.3597075
Gambella CMarecek JMevissen M(2019)Projections onto the Set of Feasible Inputs and the Set of Feasible Solutions2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)10.1109/ALLERTON.2019.8919776(937-943)Online publication date: 24-Sep-2019
https://dl.acm.org/doi/10.1109/ALLERTON.2019.8919776
Banjac GGoulart PStellato BBoyd S(2019)Infeasibility Detection in the Alternating Direction Method of Multipliers for Convex OptimizationJournal of Optimization Theory and Applications10.1007/s10957-019-01575-y183:2(490-519)Online publication date: 1-Nov-2019
https://dl.acm.org/doi/10.1007/s10957-019-01575-y
Henrion DNaldi SSafey El Din MKauers MOvchinnikov ASchost É(2018)Exact Algorithms for Semidefinite Programs with Degenerate Feasible SetProceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation10.1145/3208976.3209022(191-198)Online publication date: 11-Jul-2018
https://dl.acm.org/doi/10.1145/3208976.3209022
Permenter FParrilo P(2018)Partial facial reductionMathematical Programming: Series A and B10.1007/s10107-017-1169-9171:1-2(1-54)Online publication date: 1-Sep-2018
https://dl.acm.org/doi/10.1007/s10107-017-1169-9
Liu MPataki G(2018)Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programmingMathematical Programming: Series A and B10.1007/s10107-017-1136-5167:2(435-480)Online publication date: 1-Feb-2018
https://dl.acm.org/doi/10.1007/s10107-017-1136-5
Drusvyatskiy DWolkowicz H(2017)The Many Faces of Degeneracy in Conic OptimizationFoundations and Trends in Optimization10.1561/24000000113:2(77-170)Online publication date: 20-Dec-2017
https://dl.acm.org/doi/10.1561/2400000011
Connelly RGortler S(2017)Universal Rigidity of Complete Bipartite GraphsDiscrete & Computational Geometry10.1007/s00454-016-9836-957:2(281-304)Online publication date: 1-Mar-2017
https://dl.acm.org/doi/10.1007/s00454-016-9836-9
Bogomolov SFrehse GGiacobbe MHenzinger T(2017)Counterexample-Guided Refinement of Template PolyhedraProceedings, Part I, of the 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems - Volume 1020510.1007/978-3-662-54577-5_34(589-606)Online publication date: 22-Apr-2017
https://dl.acm.org/doi/10.1007/978-3-662-54577-5_34
Allamigeon XGaubert SSkomra MAbramov SZima EGao X(2016)Solving Generic Nonarchimedean Semidefinite Programs Using Stochastic Game AlgorithmsProceedings of the 2016 ACM International Symposium on Symbolic and Algebraic Computation10.1145/2930889.2930935(31-38)Online publication date: 20-Jul-2016
https://dl.acm.org/doi/10.1145/2930889.2930935
Show More Cited By

Abstract

Cited By

Recommendations

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations