A new notion of weighted centers for semidefinite programming
The notion of weighted centers is essential in V-space interior-point algorithms for linear programming. Although there were some successes in generalizing this notion to semidefinite programming via weighted center equations, we still do not have a generalization that preserves two important proper...
Saved in:
Main Author: | Chua, Chek Beng. |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2009
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/100091 http://hdl.handle.net/10220/5988 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Analyticity of weighted central paths and error bounds for semidefinite programming
by: Chua, Chek Beng.
Published: (2009) -
The primal-dual second-order cone approximations algorithm for symmetric cone programming
by: Chua, Chek Beng.
Published: (2009) -
Relating homogeneous cones and positive definite cones via T-algebras
by: Chua, Chek Beng.
Published: (2009) -
A superlinearly convergent smoothing newton continuation algorithm for variational inequalities over definable sets
by: Chua, Chek Beng, et al.
Published: (2015) -
Invariance and efficiency of convex representations
by: Chua, Chek Beng., et al.
Published: (2009)