A new perspective on the complexity of interior point methods for linear programming
In a dynamical systems paradigm, many optimization algorithms are equivalent to applying forward Euler method to the system of ordinary differential equations defined by the vector field of the search directions. Thus the stiffness of such vector fields will play an essential role in the complexity...
Հիմնական հեղինակներ: | Cartis, C, Hauser, R |
---|---|
Ձևաչափ: | Report |
Հրապարակվել է: |
Unspecified
2007
|
Նմանատիպ նյութեր
-
A new perspective on the complexity of interior point methods for linear programming
: Cartis, C, և այլն
Հրապարակվել է: (2007) -
Some New Results Concerning the Primal-Dual Path-Following Interior Point Algorithm for Linear Programming
: Cartis, C
Հրապարակվել է: (2005) -
On the convergence of a primal-dual second-order corrector interior point algorithm for linear programming
: Cartis, C
Հրապարակվել է: (2005) -
Some Disadvantages of a Mehrotra-Type Primal-Dual Corrector Interior Point Algorithm for Linear Programming
: Cartis, C
Հրապարակվել է: (2004) -
Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming
: Cartis, C
Հրապարակվել է: (2009)