Pages that link to "Item:Q5704145"
From MaRDI portal
The following pages link to An Interior-Point Perspective on Sensitivity Analysis in Semidefinite Programming (Q5704145):
Displaying 13 items.
- Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming (Q535069) (← links)
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension (Q1029621) (← links)
- An \(\epsilon\)-sensitivity analysis for semidefinite programming (Q2387227) (← links)
- Equivalence of two nondegeneracy conditions for semidefinite programs (Q2483041) (← links)
- Phase recovery, MaxCut and complex semidefinite programming (Q2515033) (← links)
- An interior-point approach to sensitivity analysis in degenerate linear programs (Q2784431) (← links)
- A note on semidefinite relaxation for 0-1 quadratic knapsack problems (Q2867417) (← links)
- A STUDY ON SENSITIVITY ANALYSIS FOR CONVEX QUADRATIC PROGRAMS (Q3421859) (← links)
- Extreme points of well-posed polytopes (Q3446581) (← links)
- Matrix Sensitivity Analysis from an Interior Solution of a Linear Program (Q4950949) (← links)
- On sensitivity of central solutions in semidefinite programming (Q5935707) (← links)
- Sensitivity analysis in linear programming and semidefinite programming using interior-point methods (Q5935708) (← links)
- A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms (Q6041108) (← links)