Analysis of some interior point continuous trajectories for convex programming
In this paper, we analyse three interior point continuous trajectories for convex programming with general linear constraints. The three continuous trajectories are derived from the primal–dual path-following method, the primal–dual affine scaling method and the central path, respectively. Theoretic...
| Main Authors: | , , |
|---|---|
| Format: | Journal Article |
| Published: |
Taylor & Francis Ltd.
2017
|
| Online Access: | http://hdl.handle.net/20.500.11937/52592 |