Pages that link to "Item:Q1290596"
From MaRDI portal
The following pages link to Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (Q1290596):
Displaying 7 items.
- New stopping criteria for detecting infeasibility in conic optimization (Q1024728) (← links)
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding (Q1362529) (← links)
- A semidefinite relaxation algorithm for checking completely positive separable matrices (Q2313773) (← links)
- The complexity of self-regular proximity based infeasible IPMs (Q2506182) (← links)
- On practical stopping rules for the simplex method (Q3777794) (← links)
- Stopping tests that compute optimal solutions for interior-point linear programming algorithms (Q3975042) (← links)
- Preprocessing and Regularization for Degenerate Semidefinite Programs (Q5746441) (← links)