Name
Title | ||
|---|---|---|
A New Wide Neighborhood Primal-Dual Infeasible-Interior-Point Method for Symmetric Cone Programming. |
Abstract | ||
|---|---|---|
We present a new infeasible-interior-point method, based on a wide neighborhood, for symmetric cone programming. The convergence is shown for a commutative class of search directions, which includes the Nesterov-Todd direction and the xs and sx directions. Moreover, we derive the complexity bound of the wide neighborhood infeasible interior-point methods that coincides with the currently best known theoretical complexity bounds for the short step path-following algorithm. © 2013 Springer Science+Business Media New York. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/s10957-013-0303-y | J. Optimization Theory and Applications |
Keywords | Field | DocType |
infeasible-interior-point method,jordan algebra,polynomial complexity,symmetric cone programming,wide neighborhood | Convergence (routing),Mathematical optimization,Commutative property,Symmetric cone,Polynomial complexity,Interior point method,Mathematics,Jordan algebra | Journal |
Volume | Issue | ISSN |
158 | 3 | 15732878 |
Citations | PageRank | References |
15 | 0.68 | 19 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hongwei Liu | 1 | 78 | 12.29 |
| Ximei Yang | 2 | 26 | 2.34 |
| Changhe Liu | 3 | 38 | 3.62 |