The Convergent Generalized Central Paths for Linearly Constrained Convex Programming
The convergence of central paths has been a focal point of research on interior point methods. Quite detailed analyses have been made for the linear case. However, when it comes to the convex case, even if the constraints remain linear, the problem is unsettled. In [Math. Program., 103 (2005), pp. 6...
| Main Authors: | , , , |
|---|---|
| Format: | Journal Article |
| Published: |
Society for Industrial and Applied Mathematics
2018
|
| Online Access: | http://purl.org/au-research/grants/arc/DP160102819 http://hdl.handle.net/20.500.11937/69781 |