On the complexity of semidefinite programs
From MaRDI portal
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
(41)- A complete semidefinite algorithm for detecting copositive matrices and tensors
- Cone-LP's and semidefinite programs: geometry and a simplex-type method
- On time complexity of semidefinite programs arising in polynomial optimization
- On the central path of semidefinite optimization: degree and worst-case convergence rate
- Semidefinite programs for completely bounded norms
- Bad semidefinite programs: they all look the same
- scientific article; zbMATH DE number 5999718 (Why is no real title available?)
- Simpler semidefinite programs for completely bounded norms
- On the Power of the Semi-Separated Pair Decomposition
- Optimal learning in linear regression with combinatorial feature selection
- Solving SDP completely with an interior point oracle
- Semidefinite programming and arithmetic circuit evaluation
- Scientific contributions of Leo Khachiyan (a short overview)
- On the complexity of testing attainment of the optimal value in nonlinear optimization
- Semidefinite programming
- On polyhedral approximations of the positive semidefinite cone
- Quantum compression relative to a set of measurements
- Complexity aspects of local minima and related notions
- scientific article; zbMATH DE number 2159161 (Why is no real title available?)
- Polynomial time solvability of non-symmetric semidefinite programming
- A framework for solving mixed-integer semidefinite programs
- On the complexity of postoptimality analysis of \(0/1\) programs
- Distributed learning algorithms and lossless convex relaxation for economic dispatch with transmission losses and capacity limits
- The truncated moment problem on curves y = q ( x ) and yx ℓ = 1
- The complexity of semilinear problems in succinct representation
- On semidefinite programming characterizations of the numerical radius and its dual norm
- Three-monotone interpolation
- Auxetic deformations and elliptic curves
- Minimizing the sum of linear fractional functions over the cone of positive semidefinite matrices: approximation and applications
- Exact algorithms for linear matrix inequalities
- Complexity of the positive semidefinite matrix completion problem with a rank constraint
- How Do Exponential Size Solutions Arise in Semidefinite Programming?
- Semidefinite programming and matrix scaling over the semidefinite cone.
- Interior Point Methods for Nonlinear Optimization
- scientific article; zbMATH DE number 4001882 (Why is no real title available?)
- SOS is not obviously automatizable, even approximately
- Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms
- Semidefinite programming and sums of Hermitian squares of noncommutative polynomials
- An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
- Solving rank-constrained semidefinite programs in exact arithmetic
- On Some $\mathcal{NP}$ -complete SEFE Problems
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)
