Pages that link to "Item:Q2479155"
From MaRDI portal
The following pages link to A polynomial path following algorithm for convex programming (Q2479155):
Displaying 5 items.
- Finding a strict feasible dual solution of a convex optimization problem (Q258326) (← links)
- On the complexity of a combined homotopy interior method for convex programming (Q859861) (← links)
- Novel interior point algorithms for solving nonlinear convex optimization problems (Q1748456) (← links)
- An interior point parameterized central path following algorithm for linearly constrained convex programming (Q2113635) (← links)
- A polynomial time infeasible interior-point arc-search algorithm for convex optimization (Q6173777) (← links)