Pages that link to "Item:Q5882391"
From MaRDI portal
The following pages link to On the identification of the optimal partition for semidefinite optimization (Q5882391):
Displaying 12 items.
- Identifying the optimal partition in convex quadratic programming (Q924889) (← links)
- Finding an interior point in the optimal face of linear programs (Q1319020) (← links)
- Basis- and partition identification for quadratic programming and linear complementarity problems (Q1961979) (← links)
- On the sensitivity of the optimal partition for parametric second-order conic optimization (Q2230950) (← links)
- A rounding procedure for semidefinite optimization (Q2294267) (← links)
- Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity (Q5198048) (← links)
- Partition-Optimization with Schur Convex Sum Objective Functions (Q5317566) (← links)
- Error Bounds and Singularity Degree in Semidefinite Programming (Q5857289) (← links)
- On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate (Q5864697) (← links)
- On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization (Q5870362) (← links)
- On the complexity of analyticity in semi-definite optimization (Q6118356) (← links)
- Generating linear, semidefinite, and second-order cone optimization problems for numerical experiments (Q6641002) (← links)
