Pages that link to "Item:Q1361073"

What links here

⧼whatlinkshere-whatlinkshere-target⧽

Page:

⧼whatlinkshere-whatlinkshere-ns⧽

Namespace:

Invert selection

⧼whatlinkshere-whatlinkshere-filter⧽

Hide transclusions

Hide links

Hide redirects

The following pages link to On the complexity of semidefinite programs (Q1361073):

Displaying 38 items.

Polynomial time solvability of non-symmetric semidefinite programming (Q613324) (← links)
Semidefinite programming and sums of Hermitian squares of noncommutative polynomials (Q847674) (← links)
The complexity of semilinear problems in succinct representation (Q862341) (← links)
Semidefinite programming and arithmetic circuit evaluation (Q943844) (← links)
Scientific contributions of Leo Khachiyan (a short overview) (Q944704) (← links)
On the complexity of postoptimality analysis of $0/1$ programs (Q1283802) (← links)
An exact duality theory for semidefinite programming and its complexity implications (Q1373732) (← links)
Semidefinite programming and matrix scaling over the semidefinite cone. (Q1414710) (← links)
Semidefinite programming (Q1600854) (← links)
Auxetic deformations and elliptic curves (Q1647847) (← links)
Quantum compression relative to a set of measurements (Q1649993) (← links)
Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms (Q1877018) (← links)
Complexity aspects of local minima and related notions (Q2074805) (← links)
On the complexity of testing attainment of the optimal value in nonlinear optimization (Q2205977) (← links)
Exact algorithms for semidefinite programs with degenerate feasible set (Q2229751) (← links)
Distributed learning algorithms and lossless convex relaxation for economic dispatch with transmission losses and capacity limits (Q2298971) (← links)
Three-monotone interpolation (Q2354672) (← links)
Solving rank-constrained semidefinite programs in exact arithmetic (Q2409017) (← links)
Minimizing the sum of linear fractional functions over the cone of positive semidefinite matrices: approximation and applications (Q2417051) (← links)
Exact algorithms for linear matrix inequalities (Q2834563) (← links)
Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint (Q2848995) (← links)
Optimal Learning in Linear Regression with Combinatorial Feature Selection (Q2960366) (← links)
Semidefinite programs for completely bounded norms (Q3002811) (← links)
(Q3113771) (← links)
On the Power of the Semi-Separated Pair Decomposition (Q3183436) (← links)
Interior Point Methods for Nonlinear Optimization (Q3569506) (← links)
(Q3754444) (← links)
A framework for solving mixed-integer semidefinite programs (Q4637832) (← links)
SOS Is Not Obviously Automatizable, Even Approximately (Q4638114) (← links)
(Q4667097) (← links)
A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors (Q4687245) (← links)
Solving SDP completely with an interior point oracle (Q4999336) (← links)
On Polyhedral Approximations of the Positive Semidefinite Cone (Q5026447) (← links)
On Some $\mathcal{NP}$ -complete SEFE Problems (Q5746258) (← links)
On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate (Q5864697) (← links)
How Do Exponential Size Solutions Arise in Semidefinite Programming? (Q6195320) (← links)
On semidefinite programming characterizations of the numerical radius and its dual norm (Q6592215) (← links)
The truncated moment problem on curves y = q ( x ) and yx ℓ = 1 (Q6608146) (← links)