2013
DOI: 10.12785/amis/070624
|View full text |Cite
|
Sign up to set email alerts
|

On the Convergence of Central Path and Generalized Proximal Point Method for Symmetric Cone Linear Programming

Abstract: Abstract:In this paper, we consider the symmetric cone linear programming(SCLP), by using the Jordan-algebraic technique, we extend the generalized proximal point method in linear programming and semidefinite programming to the SCLP. Under some reasonable conditions, we obtain the convergence of primal central paths associated to the symmetric cone distance function.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
1
0

Year Published

2016
2016
2017
2017

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 19 publications
0
1
0
Order By: Relevance
“…Euclidean Jordan algebras have been used to deal with optimization problems involving symmetric cones (cf. [4,5,7,6,8,9,10,11,15,16,12,13,19,18,20,21,22]). The optimization problems involving symmetric cones are tractable ones.…”
mentioning
confidence: 99%
“…Euclidean Jordan algebras have been used to deal with optimization problems involving symmetric cones (cf. [4,5,7,6,8,9,10,11,15,16,12,13,19,18,20,21,22]). The optimization problems involving symmetric cones are tractable ones.…”
mentioning
confidence: 99%