On the complexity of semidefinite programs
From MaRDI portal
Publication:1361073
DOI10.1023/A:1008203903341zbMATH Open0881.90127OpenAlexW1590002045MaRDI QIDQ1361073FDOQ1361073
Lorant Porkolab, Leonid G. Khachiyan
Publication date: 23 July 1997
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008203903341
Recommendations
- On Computational Complexity of Semilinear Varieties
- Semidefinite programming and its applications to NP problems
- On time complexity of semidefinite programs arising in polynomial optimization
- scientific article; zbMATH DE number 4001882
- scientific article; zbMATH DE number 1944141
- On a structured semidefinite program
- The complexity of semilinear problems in succinct representation
- Semidefinite programming in combinatorial optimization
- On semidefinite programming relaxations for the satisfiability problem
- Semidefinite programming
Cited In (35)
- A framework for solving mixed-integer semidefinite programs
- The truncated moment problem on curves y = q ( x ) and yx ℓ = 1
- On Some $\mathcal{NP}$ -complete SEFE Problems
- Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint
- Exact algorithms for semidefinite programs with degenerate feasible set
- Semidefinite programming
- On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate
- Title not available (Why is that?)
- Semidefinite programming and matrix scaling over the semidefinite cone.
- Solving rank-constrained semidefinite programs in exact arithmetic
- On semidefinite programming characterizations of the numerical radius and its dual norm
- The complexity of semilinear problems in succinct representation
- SOS Is Not Obviously Automatizable, Even Approximately
- Auxetic deformations and elliptic curves
- Title not available (Why is that?)
- Quantum compression relative to a set of measurements
- Optimal Learning in Linear Regression with Combinatorial Feature Selection
- Interior Point Methods for Nonlinear Optimization
- Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms
- Minimizing the sum of linear fractional functions over the cone of positive semidefinite matrices: approximation and applications
- How Do Exponential Size Solutions Arise in Semidefinite Programming?
- On the complexity of postoptimality analysis of \(0/1\) programs
- An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
- Title not available (Why is that?)
- Exact algorithms for linear matrix inequalities
- A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors
- On the Power of the Semi-Separated Pair Decomposition
- Complexity aspects of local minima and related notions
- Distributed learning algorithms and lossless convex relaxation for economic dispatch with transmission losses and capacity limits
- Semidefinite programming and sums of Hermitian squares of noncommutative polynomials
- Solving SDP completely with an interior point oracle
- On the complexity of testing attainment of the optimal value in nonlinear optimization
- Semidefinite programming and arithmetic circuit evaluation
- Scientific contributions of Leo Khachiyan (a short overview)
- Three-monotone interpolation
This page was built for publication: On the complexity of semidefinite programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361073)
