Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming
Príomhchruthaitheoir: | Cartis, C |
---|---|
Formáid: | Journal article |
Foilsithe / Cruthaithe: |
2009
|
Míreanna comhchosúla
Míreanna comhchosúla
-
Some Disadvantages of a Mehrotra-Type Primal-Dual Corrector Interior Point Algorithm for Linear Programming
de réir: Cartis, C
Foilsithe / Cruthaithe: (2004) -
On the convergence of a primal-dual second-order corrector interior point algorithm for linear programming
de réir: Cartis, C
Foilsithe / Cruthaithe: (2005) -
Some New Results Concerning the Primal-Dual Path-Following Interior Point Algorithm for Linear Programming
de réir: Cartis, C
Foilsithe / Cruthaithe: (2005) -
Primal dual algoritma dalam program linear simplex versus interior point
de réir: , AGUSTAF, Rusdy, et al.
Foilsithe / Cruthaithe: (2002) -
On complexity of a new Mehrotra-type interior point algorithm for P∗(κ) $P_{*}(\kappa )$ linear complementarity problems
de réir: Yiyuan Zhou, et al.
Foilsithe / Cruthaithe: (2019-01-01)