Pages that link to "Item:Q597191"
From MaRDI portal
The following pages link to Redundancies in positive-semidefinite quadratic programming (Q597191):
Displaying 4 items.
- Role of redundant constraints for improving dual bounds in polynomial optimization problems (Q1288665) (← links)
- Identifying non-active restrictions in convex quadratic programming (Q1396999) (← links)
- Identifying superfluous constraints within an interior-point algorithm for convex quadratic programming (Q5423153) (← links)
- Characterization of optimal points in binary convex quadratic programming (Q5758206) (← links)