Pages that link to "Item:Q1396999"
From MaRDI portal
The following pages link to Identifying non-active restrictions in convex quadratic programming (Q1396999):
Displaying 8 items.
- Redundancies in positive-semidefinite quadratic programming (Q597191) (← links)
- Active constraints, indefinite quadratic test problems, and complexity (Q911993) (← links)
- A note on weakly active constraints in connection with nonconvex quadratic programming (Q1197678) (← links)
- Constraint deletion strategy in the inertia-controlling quadratic programming method (Q1604060) (← links)
- (Q4665560) (← links)
- (Q5402631) (← 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)