Pages that link to "Item:Q1321668"
From MaRDI portal
The following pages link to A primal-dual affine-scaling potential-reduction algorithm for linear programming (Q1321668):
Displaying 13 items.
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function (Q1177228) (← links)
- On lower bound updates in primal potential reduction methods for linear programming (Q1181907) (← links)
- Global convergence in infeasible-interior-point algorithms (Q1334952) (← links)
- Constant potential primal-dual algorithms: A framework (Q1340053) (← links)
- Potential-reduction methods in mathematical programming (Q1361104) (← links)
- Affine reductions for LPs and SDPs (Q1717229) (← links)
- A new class of polynomial primal-dual methods for linear and semidefinite optimization (Q1848379) (← links)
- Superlinear primal-dual affine scaling algorithms for LCP (Q1908018) (← links)
- An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming (Q1919092) (← links)
- Generalized affine scaling algorithms for linear programming problems (Q2337378) (← links)
- Primal-dual potential reduction algorithm for symmetric programming problems with nonlinear objective functions (Q2412702) (← links)
- (Q4545873) (← links)
- Embedding surfaces in 4-manifolds (Q6620575) (← links)
