Pages that link to "Item:Q1373732"

The following pages link to An exact duality theory for semidefinite programming and its complexity implications (Q1373732):

Displaying 50 items.

• Randomized interior point methods for sampling and optimization (Q259600) (← links)
• Facial reduction algorithms for conic optimization problems (Q368590) (← links)
• Universal rigidity of complete bipartite graphs (Q517442) (← links)
• Tractability conditions for numeric CSPs (Q683751) (← links)
• An infeasible interior point method for the monotone SDLCP based on a transformation of the central path (Q721594) (← links)
• Characterizing the universal rigidity of generic frameworks (Q741616) (← links)
• The minimal cone for conic linear programming (Q766252) (← links)
• Semidefinite programming and sums of Hermitian squares of noncommutative polynomials (Q847674) (← links)
• The complexity of optimizing over a simplex, hypercube or sphere: a short survey (Q940826) (← links)
• Semidefinite programming and arithmetic circuit evaluation (Q943844) (← links)
• Initialization in semidefinite programming via a self-dual skew-symmetric embedding (Q1362529) (← links)
• Cuts, matrix completions and graph rigidity (Q1365058) (← links)
• Semidefinite programming and matrix scaling over the semidefinite cone. (Q1414710) (← links)
• Semidefinite programming (Q1600854) (← links)
• Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming (Q1702782) (← links)
• Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone (Q1785193) (← links)
• Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms (Q1877018) (← links)
• Strong duality and minimal representations for cone optimization (Q1928754) (← links)
• The tracial moment problem and trace-optimization of polynomials (Q1942272) (← links)
• Numerical algebraic geometry and semidefinite programming (Q1979983) (← links)
• Tropical spectrahedra (Q1985292) (← links)
• Conic programming: infeasibility certificates and projective geometry (Q1996078) (← links)
• Complexity aspects of local minima and related notions (Q2074805) (← links)
• Strong duality for standard convex programs (Q2074838) (← links)
• Immobile indices and CQ-free optimality criteria for linear copositive programming problems (Q2174923) (← links)
• Reduction of SISO H-infinity output feedback control problem (Q2228115) (← links)
• Exact algorithms for semidefinite programs with degenerate feasible set (Q2229751) (← links)
• Infeasibility detection in the alternating direction method of multipliers for convex optimization (Q2275323) (← links)
• On polyhedral and second-order cone decompositions of semidefinite optimization problems (Q2294533) (← links)
• Iterative universal rigidity (Q2351022) (← links)
• Three-monotone interpolation (Q2354672) (← links)
• Solving generic nonarchimedean semidefinite programs using stochastic game algorithms (Q2409007) (← links)
• A finite steps algorithm for solving convex feasibility problems (Q2460116) (← links)
• A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions (Q2465563) (← links)
• An exact explicit dual for the linear copositive programming problem (Q2679002) (← links)
• A simplified treatment of Ramana's exact dual for semidefinite programming (Q2688906) (← links)
• Introduction to Semidefinite, Conic and Polynomial Optimization (Q2802517) (← links)
• On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming (Q2821802) (← links)
• Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint (Q2848995) (← links)
• Deciding Polyhedrality of Spectrahedra (Q2949514) (← links)
• Bad Semidefinite Programs: They All Look the Same (Q2967605) (← links)
• Counterexample-Guided Refinement of Template Polyhedra (Q3303915) (← links)
• Some Recent Developments in Spectrahedral Computation (Q4556598) (← links)
• Spectrahedral Shadows (Q4603029) (← links)
• A guide to conic optimisation and its applications (Q4634309) (← links)
• SOS Is Not Obviously Automatizable, Even Approximately (Q4638114) (← links)
• Constraint Satisfaction Problems over Numeric Domains (Q4993596) (← links)
• On equivalent representations and properties of faces of the cone of copositive matrices (Q5044098) (← links)
• Refining the partition for multifold conic optimization problems (Q5151515) (← links)
• Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity (Q5198048) (← links)