A Jordan--algebraic approach to potential--reduction algorithms (1998) [2 citations — 0 self]
Download:
|
|
by Leonid Faybusovich
http://www.coins.nd.edu/~lfaybuso/potenr.ps
Add To MetaCart
Abstract:
Abstract. We consider the linear monotone complementarity problem for domains obtained as the intersection of an ane subspace and the Cartesian product of symmetric cones. A primal-dual potential reduction algorithm is described and its complexity estimates are established with the help of the Jordan-algebraic technique
Citations
| 276 | Primal-Dual Interior-Point Methods – Wright |
| 138 | Self-scaled barriers and interior-point methods for convex programming – Nesterov, Todd - 1997 |
| 96 | Analysis on Symmetric Cones – Faraut, Korányi - 1994 |
| 24 | systems in Jordan Algebras and primal-dual Interior point methods – Faybusovich - 1997 |
| 18 | Euclidean Jordan algebras and interior-point algorithms – Faybusovich - 1997 |
| 14 | algebras, Symmetric cones and Interior-point methods – Faybusovich - 1995 |
| 7 | Symmetric spaces – Loos - 1969 |
| 7 | Potential reduction methods in mathematical programming – Todd - 1995 |
| 3 | Pseudodierential Analysis on Symmetric Cones – Unterberger, Upmeier - 1996 |
| 1 | Jordan algebras and their applications – Koecher - 1962 |
| 1 | Yoshise , "An O( p nL) iteration potential reduction algorithm for linear complementarity problems – Kojima, Mizuno, et al. - 1991 |
| 1 | Toeplitz operators and index theory in several variables ", Birkhauser – Upmeier - 1996 |
| 1 | Primal-dual interior-point methods", SIAM – Wright - 1997 |
