Pages that link to "Item:Q421610"
From MaRDI portal
The following pages link to A polynomial arc-search interior-point algorithm for convex quadratic programming (Q421610):
Displayed 6 items.
- A wide neighborhood infeasible-interior-point method with arc-search for linear programming (Q295450) (← links)
- A polynomial arc-search interior-point algorithm for linear programming (Q378268) (← links)
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy (Q1681807) (← links)
- An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
- An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path (Q2361136) (← links)
- An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems (Q2399607) (← links)