The Dikin-Karmarkar principle for steepest descent
Steepest feasible descent methods for inequality constrained optimization problems have commonly been plagued by short steps. The consequence of taking short steps is slow convergence or even convergence to non-stationary points (zigzagging). In linear programming, both the projective algorithm of K...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English |
| Published: |
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1911/16565 |