Pages that link to "Item:Q368590"

The following pages link to Facial reduction algorithms for conic optimization problems (Q368590):

Displaying 36 items.

• CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization (Q298162) (← links)
• A note on alternating projections for ill-posed semidefinite feasibility problems (Q517318) (← links)
• Weak infeasibility in second order cone programming (Q518144) (← links)
• A facial reduction algorithm for finding sparse SOS representations (Q613325) (← links)
• Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming (Q1702782) (← links)
• A relaxed-certificate facial reduction algorithm based on subspace intersection (Q1709938) (← links)
• Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone (Q1785193) (← links)
• Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization (Q1935573) (← links)
• Numerical algebraic geometry and semidefinite programming (Q1979983) (← links)
• Conic programming: infeasibility certificates and projective geometry (Q1996078) (← links)
• Perturbation analysis of singular semidefinite programs and its applications to control problems (Q2026715) (← links)
• Polyhedral approximations of the semidefinite cone and their application (Q2028478) (← links)
• Characterization of the dual problem of linear matrix inequality for H-infinity output feedback control problem via facial reduction (Q2218172) (← links)
• Amenable cones: error bounds without constraint qualifications (Q2227528) (← links)
• Douglas-Rachford splitting and ADMM for pathological convex optimization (Q2282817) (← links)
• Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs (Q2293657) (← links)
• A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs (Q2316619) (← links)
• A bound on the Carathéodory number (Q2401297) (← links)
• A simplified treatment of Ramana's exact dual for semidefinite programming (Q2688906) (← links)
• Bad Semidefinite Programs: They All Look the Same (Q2967605) (← links)
• Facial Reduction and Partial Polyhedrality (Q4586172) (← links)
• Solving SDP completely with an interior point oracle (Q4999336) (← 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)
• Limitations on the Expressive Power of Convex Cones without Long Chains of Faces (Q5222131) (← links)
• Facially Dual Complete (Nice) Cones and Lexicographic Tangents (Q5234283) (← links)
• Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs (Q5243181) (← links)
• Coordinate Shadows of Semidefinite and Euclidean Distance Matrices (Q5258947) (← links)
• Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach (Q5275296) (← links)
• Exact Duality in Semidefinite Programming Based on Elementary Reformulations (Q5501234) (← links)
• Application of facial reduction to <i>H</i> _∞ state feedback control problem (Q5742517) (← links)
• Error Bounds and Singularity Degree in Semidefinite Programming (Q5857289) (← links)
• Validating numerical semidefinite programming solvers for polynomial invariants (Q5916266) (← links)
• A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms (Q6041108) (← links)
• Error bounds, facial residual functions and applications to the exponential cone (Q6044980) (← links)
• How Do Exponential Size Solutions Arise in Semidefinite Programming? (Q6195320) (← links)