Pages that link to "Item:Q1785193"
From MaRDI portal
The following pages link to Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone (Q1785193):
Displaying 37 items.
- frlib (Q46529) (← links)
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization (Q298162) (← links)
- Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank (Q304255) (← links)
- Stability and performance verification of optimization-based controllers (Q518285) (← links)
- An improved semidefinite programming hierarchy for testing entanglement (Q529619) (← links)
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming (Q1702782) (← links)
- On sums of squares of \(K\)-nomials (Q1979337) (← links)
- Numerical algebraic geometry and semidefinite programming (Q1979983) (← links)
- Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
- Polyhedral approximations of the semidefinite cone and their application (Q2028478) (← links)
- Sparse PSD approximation of the PSD cone (Q2118107) (← links)
- Dimension reduction for semidefinite programs via Jordan algebras (Q2188241) (← 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)
- On polyhedral and second-order cone decompositions of semidefinite optimization problems (Q2294533) (← links)
- Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices (Q2301196) (← links)
- A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs (Q2316619) (← links)
- A simplified treatment of Ramana's exact dual for semidefinite programming (Q2688906) (← links)
- Exact Semidefinite Programming Bounds for Packing Problems (Q4989941) (← links)
- Solving SDP completely with an interior point oracle (Q4999336) (← links)
- Hyperbolic Relaxation of $k$-Locally Positive Semidefinite Matrices (Q5072587) (← links)
- (Q5148989) (← links)
- Facial reduction for exact polynomial sum of squares decomposition (Q5207444) (← 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)
- DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization (Q5382573) (← 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)
- Evaluating approximations of the semidefinite cone with trace normalized distance (Q6043109) (← links)
- A new perspective on low-rank optimization (Q6052053) (← links)
- On eigenvalues of symmetric matrices with PSD principal submatrices (Q6108376) (← links)
- Subset Selection and the Cone of Factor-Width-<i>k</i> Matrices (Q6195312) (← links)
