Pages that link to "Item:Q1702782"
From MaRDI portal
The following pages link to Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming (Q1702782):
Displaying 25 items.
- Weak infeasibility in second order cone programming (Q518144) (← links)
- An infeasibility certificate for nonlinear programming based on Pareto criticality condition (Q1790183) (← links)
- Characterizations of interiors of feasible and infeasible data instances and feasibility for conic linear programming (Q1958647) (← 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)
- An interior point-proximal method of multipliers for linear positive semi-definite programming (Q2073047) (← links)
- Amenable cones: error bounds without constraint qualifications (Q2227528) (← 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)
- On primal and dual infeasibility certificates in a homogeneous model for convex optimization (Q2706334) (← links)
- Facial Reduction and Partial Polyhedrality (Q4586172) (← links)
- Solving SDP completely with an interior point oracle (Q4999336) (← links)
- (Q5026434) (← 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)
- Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach (Q5275296) (← links)
- Amenable Cones Are Particularly Nice (Q5869817) (← 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)
- On the longest chain of faces of the completely positive and copositive cones (Q6592915) (← links)
- Closing duality gaps of SDPs completely through perturbation when singularity degree is one (Q6644993) (← links)
