1 Jordan algebras and symmetric cones

2021 ◽  
pp. 1-30
2016 ◽  
Vol 09 (03) ◽  
pp. 1650049 ◽  
Author(s):  
Marzieh Sayadi Shahraki ◽  
Maryam Zangiabadi ◽  
Hossein Mansouri

In this paper, we present a predictor–corrector infeasible-interior-point method based on a new wide neighborhood of the central path for linear complementarity problem over symmetric cones (SCLCP) with the Cartesian [Formula: see text]-property. The convergence of the algorithm is proved for commutative class of search directions. Moreover, using the theory of Euclidean Jordan algebras and some elegant tools, the iteration bound improves the earlier complexity of these kind of algorithms for the Cartesian [Formula: see text]-SCLCPs.


Positivity ◽  
2004 ◽  
Vol 8 (4) ◽  
pp. 369-378 ◽  
Author(s):  
Keiko Uohashi ◽  
Atsumi Ohara

2012 ◽  
Vol 29 (02) ◽  
pp. 1250015 ◽  
Author(s):  
G. Q. WANG

In this paper, we present a new polynomial interior-point algorithm for the monotone linear complementarity problem over symmetric cones by employing the framework of Euclidean Jordan algebras. At each iteration, we use only full Nesterov and Todd steps. The currently best known iteration bound for small-update method, namely, [Formula: see text], is obtained, where r denotes the rank of the associated Euclidean Jordan algebra and ε the desired accuracy.


1989 ◽  
Vol 30 (1) ◽  
pp. 159-160 ◽  
Author(s):  
S. R. Sverchkov
Keyword(s):  

2004 ◽  
Vol 32 (10) ◽  
pp. 3995-4003 ◽  
Author(s):  
M. Cabrera ◽  
A. R. Villena
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document