On the complexity of semidefinite programs
From MaRDI portal
Publication:1361073
DOI10.1023/A:1008203903341zbMath0881.90127OpenAlexW1590002045MaRDI QIDQ1361073
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
Related Items
Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms, SOS Is Not Obviously Automatizable, Even Approximately, Semidefinite programming and sums of Hermitian squares of noncommutative polynomials, Auxetic deformations and elliptic curves, Quantum compression relative to a set of measurements, Solving rank-constrained semidefinite programs in exact arithmetic, Minimizing the sum of linear fractional functions over the cone of positive semidefinite matrices: approximation and applications, Optimal Learning in Linear Regression with Combinatorial Feature Selection, How Do Exponential Size Solutions Arise in Semidefinite Programming?, On the complexity of testing attainment of the optimal value in nonlinear optimization, Semidefinite programming and matrix scaling over the semidefinite cone., Exact algorithms for semidefinite programs with degenerate feasible set, A framework for solving mixed-integer semidefinite programs, Semidefinite programming and arithmetic circuit evaluation, Scientific contributions of Leo Khachiyan (a short overview), Interior Point Methods for Nonlinear Optimization, A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors, Distributed learning algorithms and lossless convex relaxation for economic dispatch with transmission losses and capacity limits, Exact Algorithms for Linear Matrix Inequalities, Complexity aspects of local minima and related notions, Solving SDP completely with an interior point oracle, Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint, On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate, Semidefinite programming, Three-monotone interpolation
