Analyticity of weighted central paths and error bounds for semidefinite programming
The purpose of this paper is two-fold. Firstly, we show that every Cholesky-based weighted central path for semi definite programming is analytic under strict complementarity. This result is applied to homogeneous cone programming to show that the central paths defined by the known class of optimal...
Saved in:
Main Author: | |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2009
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/91356 http://hdl.handle.net/10220/5855 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Be the first to leave a comment!