Pages that link to "Item:Q5459822"
From MaRDI portal
The following pages link to Primal–dual exterior point method for convex optimization (Q5459822):
Displayed 4 items.
- An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
- Lagrangian transformation and interior ellipsoid methods in convex optimization (Q2342139) (← links)
- A penalty-interior-point algorithm for nonlinear constrained optimization (Q2392661) (← links)
- An entire space polynomial-time algorithm for linear programming (Q2442633) (← links)