Pages that link to "Item:Q1156085"
From MaRDI portal
The following pages link to Regularizing the abstract convex program (Q1156085):
Displaying 16 items.
- Exact Duality in Semidefinite Programming Based on Elementary Reformulations (Q5501234) (← links)
- Preprocessing and Regularization for Degenerate Semidefinite Programs (Q5746441) (← links)
- Error Bounds and Singularity Degree in Semidefinite Programming (Q5857289) (← links)
- Amenable Cones Are Particularly Nice (Q5869817) (← 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)
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs (Q6044986) (← links)
- A facial reduction approach for the single source localization problem (Q6064050) (← links)
- A note on the SDP relaxation of the minimum cut problem (Q6064052) (← links)
- Revisiting degeneracy, strict feasibility, stability, in linear programming (Q6113350) (← links)
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) (← links)
- Self-Dual Polyhedral Cones and Their Slack Matrices (Q6116664) (← links)
- Hyperbolicity cones are amenable (Q6120856) (← links)
- How Do Exponential Size Solutions Arise in Semidefinite Programming? (Q6195320) (← links)
- Lagrangian duality in convex conic programming with simple proofs (Q6200791) (← links)