1 |
L. Faybusovich, Euclidean Jordan and interior-point algorithms, Positivity, 1(1997), 331-357.
DOI
ScienceOn
|
2 |
K. Amini and M. R. Peyghami, Exploring complexity of large update interior-point methods for linear complementarity problem based on kernel function, Appl. Math. Comput., 207, (2009), 501-513.
DOI
ScienceOn
|
3 |
G. M. Cho, M. K. Kim and Y. H. Lee, Complexity of large-update interior point algorithm for linear complementary problems, Comput. Math. Appl. 53(2007), 948-960.
DOI
ScienceOn
|
4 |
L. Faybusovich and R. Arana, A long-step primal-dual algorithm for symmetric programming problems, Systems Control Lett., 43(2001), 3-7.
DOI
ScienceOn
|
5 |
G. M. Cho and M. K. Kim, A new large-update interior point algorithm for LCPs based on kernel functions, Appl. Math. Comput., 182(2006), 1169-1183.
DOI
ScienceOn
|
6 |
Y. Q. Bai, G. Q. Wang and C. Roos, A new primal-dual interior-point algorithm for second-order cone optimization, November, 2004, preprint.
|
7 |
G. M. Cho, A new large-update interior point algorithm for linear complementarity problems, J. Comput. Appl. Math., 216(2008), 265-278.
DOI
ScienceOn
|
8 |
Y. Q. Bai, M. El. Ghami and C. Roos, A comparative study of kernel functions for primal-dual interior-point algorithms in linear optimization, SIAM J. Optim., 15, No.1, (2004), 101-128.
DOI
ScienceOn
|
9 |
A. Ben-Tal and A. Nemirovski, Lectures on Modern Convex Optimization. Analysis, Algorithms and Engineering Applications, MPS-SIAM Ser. Optim. 2, SIAM, Philadelphia, 2001.
|
10 |
Y. Q. Bai and G. Q. Wang, Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function, Acta Math. Sin. (Engl. Ser.), 23, No. 11, (2007), 2027-2042.
DOI
ScienceOn
|
11 |
K. Amini and M. R. Peyghami, An Interior-point algorithm for linear optimization based on a new kernel function, Southeast Asian Bull. Math., 29, (2005), 651-667.
|
12 |
J. Peng, C. Roos and T. Terlaky, Self-regular functions and new search directions for linear and semidefinite optimization, Math. Program., 93(2002), 129-171.
DOI
ScienceOn
|
13 |
E. D. Andersen, J. Gondzio, Cs. Meszaros, and X. Xu, Implementation of interior point methods for large scale linear programming, in Interior Point Methods of Mathematical Programming, T. Terlaky, ed., Kluwer Academic Publishers, Dordrecht, The Netherlands, 1996, pp. 189-252.
|
14 |
L. Tunc¸el, Potential reduction and primal-dual methods, in Handbook of Semidefinite Programming, Theory, Algorithms and Applications, H. Wolkowicz, R. Saigal and L. Vandenberghe, eds., Kluwer Academic Publichers, Boston, MA, 2000, pp. 235-265.
|
15 |
S. Schmieta and F. Alizadeh, Extensions of primal-dual interior-point algorithms to symmetric cones, Math. Program., 96(2003), 409-438.
DOI
ScienceOn
|
16 |
J. Sturm, Theory and algorithms of semidefinite programming, in High Performance Optimization, H. Frenk, C. Roos, T. Terlaky and S. Zhang, eds., Kluwer Academic Publishers, Dordrecht, The Netherlands, (1999), 3-194.
|
17 |
T. Tsuchiya, A Polynomial Primal-Dual Path-Following Algorithm for Second-Order Cone Programming, Technical report 649, The Institute of Satistical Mathematics, Tokyo, 1997.
|
18 |
T. Tsuchiya, A convergent analysis of the scaling-invariant primal-dual path-following algorithms for secondorder cone programming, Optim. Methods Softw., 11/12 (1999), 141-182.
|
19 |
J. Peng, C. Roos, T. Terlaky and A. Yoshise, Self-regular proximities and new search directions for nonlinear complementarity problems, preprint.
|
20 |
J. Renegar, A Mathematical View of Interior-Point Methods in Convex Optimization, MPS/SIAM Ser. Optim., SIAM, Philadelphia, 2001.
|
21 |
J. Peng, C. Roos and T. Terlaky, Self-Regularity: A New Paradigm for Primal-Dual Interior-Point Algorithms, Princeton University Press, Princeton, NJ, 2002.
|
22 |
J. Peng, C. Roos and T. Terlaky, A new and efficient large-update interior-point method for linear optimization, J. Comput. Sci. Tech., 6 (2001), 61-80.
|
23 |
E. de Klerk. Interior Point Methods for Semidefinite Programming, Ph. D. Thesis, Faculty of ITS/TWI, Delft University of Technology, The Netherlands, 1997.
|
24 |
L. Faybusovich and T. Tsuchiya, Primal-dual algorithms and infinite-dimensional Jordan algebras of finite rank, Math. Program., 97(2003), 471-493.
DOI
ScienceOn
|
25 |
J. Faraut and A. Koranyi, Analysis on Symmetric Cones, Oxford University Press, London, Oxford, UK, 1994.
|
26 |
M. Seetharama Gowda, Roman Szajder and J. Tao, Some P-properties for linear transformations on Euclidean Jordan algebras, Linear Algebra and its Applications 393(2004), 203-232.
DOI
ScienceOn
|
27 |
M. S. Lobo, L. Vandenberghe, S. Boyd, and H. Lebret, Applications of second-order cone programming, Linear Algebra Appl., 284(1998), 193-228.
DOI
ScienceOn
|
28 |
M. Muramatsu, On a commutative class of search directions for linear progrmming over symmetric cones, J. Optim. Theory Appl., 112(2002), 595-625.
DOI
ScienceOn
|
29 |
Y. E. Nesterov and A. S. Nemirovskii, Interior Point Polynomial Algorithms in Convex Programming, SIAM Stud. Appl. Math. 13, SIAM, Philadelphia, 1994.
|
30 |
J. Peng, C. Roos and T. Terlaky, Primal-dual interior-point methods for second-order conic optimization based on self-regular proximities, SIAM J. Optim., 13(2002), 179-203.
DOI
ScienceOn
|
31 |
B. K. Choi and G. M. Lee, On complexity analysis of the primal-dual interior-point methods for semidefinite optimization problem based on a new proximity function, Nonlinear Anal.-Theory Methods Appl., 71 (2009), e2628-e2640.
DOI
ScienceOn
|
32 |
L. Faybusovich, Linear systems in Jordan algebras and primal-dual interior-point algorithms, J. Comput. Appl. Math., 86(1997), 149-175.
DOI
ScienceOn
|
33 |
L. Faybusovich, A Jordan-algebraic approach to potential-reduction algorithms, Math. Z., 239(2002), 117-129.
DOI
ScienceOn
|