Self-regularity: A new paradigm for primal-dual interior-point algorithms

Self-Regularity: A New Paradigm for Primal-Dual Interior-Point Algorithms

Volumn , Issue , 2009, Pages 1-185

  Peng, Jiming ^a   Roos, Cornelis ^b   Terlaky, Tamás ^a  

^a MCMASTER UNIVERSITY   (Canada)

^b DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84923828114     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Book

References (139)

1. I. Adler and F. Alizadeh. Primal-dual interior-point algorithms for convex quadratically constrained and semidefinite optimization problems. Technical Report RRR-111-95, Rutcor, Rutgers Center for Operations Research, New Brunswick, NJ, 1995.
2. A. Alizadeh. Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM Journal on Optimization, 5:13-51, 1995.
3. F. Alizadeh, J.A. Haeberly, M.V. Nayakkankuppann, M. Overton and S. Schmieta. SDPPack user's guide. New York University, New York, 1997.
4. F. Alizadeh, J.P. Haeberly and M.L. Overton. A new primal-dual interior-point method for semidefinite programming, in: J.G. Lewis (editor), Proceedings of the Fifth SIAM Conference on Applied Linear Algebra, pp. 113-117, SIAM, 1994.
5. F. Alizadeh, J.-P.A. Haeberley and M.L. Overton. Primal-dual methods for semidefinite programming: convergence rates, stability and numerical results. SIAM Journal on Optimization, 8:746-768, 1998.
6. E.D. Andersen and K.D. Andersen. The MOSEK interior-point optimizer for linear programming: an implementation of the homogeneous algorithm, in: H. Frenk, C. Roos, T. Terlaky and S. Zhang (editors), High Performance Optimization, pp. 197-232, Kluwer Academic Publishers, Boston, MA, 1999.
7. E.D. Andersen, J. Gondzio, Cs. Mészáros and X. Xu. Implementation of interior-point methods for large scale linear programming, in: T. Terlaky (editor), Interior Point Methods of Mathematical Programming, pp. 189-252. Kluwer Academic Publishers, Dordrecht, The Netherlands, 1996.
8. E.D. Andersen, C. Roos and T. Terlaky. On implementing a primal-dual interior-point method for conic quadratic optimization. To appear in Mathematical Programming, 2002.
9. E.D. Andersen and Y. Ye. On a homogeneous algorithm for the monotone complementarity problem. Mathematical Programming, 84:375-399, 1999.
10. R. Bellman. Introduction to Matrix Analysis, Volume 12. Classics in Applied Mathematics, SIAM, Philadelphia, PA, 1995.
11. R. Bellman and K. Fan. On systems of linear inequalities in Hermitian matrix variables, in: V.L. Klee (editor), Convexity, 7:1-11, Proceedings of Symposia in Pure Mathematics, American Mathematical Society, Providence, RI, 1963.
12. A. Ben-Tal and A. Nemirovskii. Lectures on Modern Convex Optimization: Analysis, Algorithms and Engineering Applications, MPS-SAM Series on Optimisation, Vol. 02, SIAM, Philadelphia, PA, 2001.
13. K.H. Borgwardt. The Simplex Method: A Probabilistic Analysis. Springer-Verlag, Berlin, 1987.
14. W. Cook, A.M.H. Gerards, A. Schrijver and É . Tardos. Sensitivity results in integer linear programming. Mathematical Programming, 34:251-264, 1986.
15. R.W. Cottle, J.S. Pang, and R.E. Stone. The Linear Complementarity Problem. Academic Press Inc., San Diego, CA, 1992.
16. CPLEX user's guide, CPLEX Optimization Inc., Incline Village, NV, 1993.
17. G.B. Dantzig. Linear Programming and Extensions. Princeton University Press, Princeton, NJ, 1963.
18. I.I. Dikin. Iterative solution of problems of linear and quadratic programming. Doklady Akademiia Nauk SSSK 174, 747-748. Translated in Soviet Mathematics Doklady, 8, 674-675, 1967.
19. J. Faraut and A. Korányi. Analysis on Symmetric Cones. Oxford University Press, New York, 1994.
20. L. Faybusovich. Euclidean Jordan algebras and interior-point algorithms. Positivity, 1:331-357, 1997.
21. L. Faybusovich. A Jordan-algebraic approach to potential-reduction algorithms. Technical Report, Department of Mathematics, University of Notre Dame, Notre Dame, IN, 1998.
22. M.C. Ferris and J.S. Pang. Engineering and economic applications of complementarity problems, SIAM Journal on Optimization, 39:669-713, 1997.
23. A.V. Fiacco and G.P. McCormick. Nonlinear Programming: Sequential Unconstrained Minimization Techniques. John Wiley & Sons, New York, 1968. Reprint: Volume 4 of SIAM Classics in Applied Mathematics, SIAM Publications, Philadelphia, PA, 1990.
24. R. Frisch. The logarithmic potential method for solving linear programming problems. Memorandum, University Institute of Economics, Oslo, 1955.
25. R. Frisch. The logarithmic potential method for convex programming problems. Memorandum, University Institute of Economics, Oslo, 1955.
26. K. Fujisawa, M. Kojima and K. Nakata. SDPA (semidefinite programming algorithm) user's manual-version 4.10, Technical Report, Department of Information Science, Tokyo Institute of Technology, Tokyo, Japan 1998.
27. M. Fukushima, Z.Q. Luo and P. Tseng. Smoothing functions for second-order-cone complementarity problems. Preprint, Department of Mathematics, University of Washington, Seattle, WA, November, 2000.
28. P.E. Gill, W. Murray, M.A. Saunders, J.A. Tomlin and M.H. Wright. On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method. Mathematical Programming, 36:183-209, 1986.
29. F. Glineur. Improving complexity of structured convex optimization problems using selfconcordant barriers. To appear in European Journal of Operations Research, 2002.
30. M.X. Goemans and D.P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. JACM, 42:1115-1145, 1995.
31. D. Goldfarb and K. Scheinberg. Interior point trajectories in semidefinite programming. SIAM Journal on Optimization, 8:871-886, 1998.
32. A.J. Goldman and A.W. Tucker. Theory of linear programming, in: H.W. Kuhn and A.W. Tucker (editors), Linear Inequalities and Related Systems, Annals of Mathematical Studies, 38:63-97, Princeton University Press, Princeton, NJ, 1956.
33. C.C. Gonzaga. Path-following methods for linear programming. SIAM Review, 34:167-227, 1992.
34. O. Güler. Existence of interior-points and interior paths in nonlinear monotone complementarity problems. Mathematics of Operations Research, 18:128-147, 1993.
35. O. Güler. Limiting behavior of the weighted central paths in linear programming. Mathematical Programming, 65:347-363, 1994.
36. O. Güler and Y. Ye. Convergence behavior of interior-point algorithms. Mathematical Programming, 60:215-228, 1993.
37. P.T. Harker and J.S. Pang. Finite-dimensional variational inequality and nonlinear complementarity problems: fa survey of theory, algorithms and applications, Mathematical Programming, 48:161-220, 1990.
38. C. Helmberg, F. Rendl, R.J. Vanderdei and H. Wolkowicz. An interior-point method for semidefinite programming. SIAM Journal on Optimization, 6:342-361, 1996.
39. D. den Hertog. Interior Point Approach to Linear, Quadratic and Convex Programming, Volume 277, Mathematics and its Applications. Kluwer Academic Publishers, Dordrecht, The Netherlands, 1994.
40. R.A. Horn and C.R. Johnson. Topics in Matrix Analysis. Cambridge University Press, 1991.
41. P. Huard. Resolution of mathematical programming with nonlinear constraints by the method of centers, in: J. Abadie (editor), Nonlinear Programming, North-Holland Publishing Company, Amsterdam, The Netherlands, pp. 207-219, 1967.
42. P. Hung and Y. Ye. An asymptotically O{eth}pnL)-iteration path-following linear programming algorithm that uses long steps. SIAM Journal on Optimization, 6:570-586, 1996.
43. T. Illés, C. Roos and T. Terlaky. Polynomial affine-scaling algorithms for P*(κ) linear complementarity problems, in: P. Gritzmann, R. Horst, E. Sachs and R. Tichatschke (editors), Recent Advances in Optimization, Proceedings of the 8th French-German Conference on Optimization, Trier, July 21-26, 1996, Lecture Notes in Economics and Mathematical Systems 452, pp. 119-137, Springer-Verlag, 1997.
44. G. Isac. Complementarity Problems, Lecture Notes in Mathematics, Springer-Verlag, New York, 1992.
45. B. Jansen. Interior Point Techniques in Optimization, Complexity, Sensitivity and Algorithms. Kluwer Academic Publishers, Dordrecht, 1997.
46. B. Jansen, C. Roos and T. Terlaky. The theory of linear programming: skew symmetric self-dual problems and the central path. Optimization, 29:225-233, 1994.
47. B. Jansen, C. Roos, T. Terlaky and J.-Ph. Vial. Primal-dual algorithms for linear programming based on the logarithmic barrier method. Journal of Optimization Theory Application, 83:1-26, 1994.
48. B. Jansen, C. Roos, T. Terlaky and Y. Ye. Improved complexity using higher order correctors for primal-dual Dikin affine scaling. Mathematical Programming, Series B, 76:117-130, 1997.
49. B. Jansen, C. Roos, T. Terlaky and A. Yoshise. Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems. Mathematical Programming, 78:315-345, 1997.
50. F. Jarre. The Method of Analytic Centers for Smooth Convex Programs. Ph.D Thesis, Institut für Angewandte Mathematik and Statistik, Universität Würzburg, Würzburg, Germany, 1989.
51. F. Jarre. Interior-point methods via self-concordance or relative Lipschitz condition. Optimization Methods Software, 5:75-104, 1995.
52. N.K. Karmarkar. A new polynomial-time algorithm for linear programming. Combinatorica, 4:373-395, 1984.
53. L.G. Khachiyan. A polynomial algorithm for linear programming. Doklady Akad. Nauk USSR, 244:1093-1096, 1979. Translated in Soviet Math. Doklady, 20:191-194, 1979.
54. V. Klee and G.J. Minty. How good is the simplex method? in: O. Shisha (editor), Inequalities III, Academic Press, New York, 1972.
55. E. de Klerk. Interior Point Methods for Semidefinite Programming. Ph.D. Thesis, Faculty of ITS/TWI, Delft University of Technology, The Netherlands, 1997.
56. E. de Klerk, C. Roos and T. Terlaky. Infeasible-start semidefinite programming algorithms via self-dual embeddings, in: P. Pardalos and H. Wolkowicz (editors), Topics in Semidefinite and Interior-point Methods, Toronto, ON, 1996, pp. 215-236, Fields Inst. Commun., 18, American Mathematical Society, Providence, RI, 1998.
57. M. Kojima, N. Megiddo and T. Noma. Homotopy continuation methods for nonlinear complementarity problems. Mathematics of Operations Research, 16:754-774, 1991.
58. M. Kojima, N. Megiddo, T. Noma and A. Yoshise. A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, Volume 538, Lecture Notes in Computer Science. Springer Verlag, Berlin, 1991.
59. M. Kojima, S. Mizuno and A. Yoshise. A primal-dual interior-point algorithm for linear programming, in: N. Megiddo (editor), Progress in Mathematical Programming: Interior Point and Related Methods, pp. 29-47. Springer Verlag, New York, 1989.
60. M. Kojima, S. Mizuno and A. Yoshise. A polynomial-time algorithm for a class of linear complementarity problems. Mathematical Programming, 44:1-26, 1989.
61. M. Kojima, S. Shindoh and S. Hara. Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices. SIAM Journal on Optimization, 7:86-125, 1997.
62. G. Lesaja. Interior-Point Methods for Pp-complementarity Problems. Ph.D. Thesis, University of Iowa, Iowa City, IA, 1996.
63. M.S. Lobo, L. Vandenberghe, S. Boyd and H. Lebret. Applications of second-order cone programming. Linear Algebra and its Applications, 284:193-228, 1998.
64. F.A. Lootsma. Numerical Methods for Nonlinear Optimization. Academic Press, London, 1972.
65. Z.Q. Lou, J. Sturm and S. Zhang. Conic linear programming and self-dual embedding. Optimization Methods and Software, 14:169-218, 2000.
66. I.J. Lustig, R.E. Marsten and D.F. Shanno. Interior point methods: computational state of the art. ORSA Journal on Computing, 6:1-15, 1994.
67. O.L. Mangasarian. Nonlinear Programming, McGraw-Hill, New York, 1969. Reprinted by SIAM Publications, 1995.
68. L. McLinden. The analogue of Moreau's proximation theorem, with applications to the nonlinear complementarity problems. Pacific Journal of Mathematics, 88:101-161, 1980.
69. K.A. McShane, C.L. Monma and D.F. Shanno. An implementation of a primal-dual interior-point method for linear programming. ORSA Journal on Computing, 1:70-83, 1989.
70. N. Megiddo. Pathways to the optimal set in linear programming, in: N. Megiddo (editor), Progress in Mathematical Programming: Interior Point and Related Methods, pp. 131-158. Springer Verlag, New York, 1989. Identical version in Proceedings of the 6th Mathematical Programming Symposium of Japan, Nagoya, Japan, pp. 1-35, 1986.
71. S. Mehrotra. On the implementation of a (primal-dual) interior-point method. SIAM Journal on Optimization, 2:575-601, 1992.
72. S. Mehrotra and Y. Ye. On finding the optimal facet of linear programs. Mathematical Programming, 62:497-515, 1993.
73. S. Mehrota and J. Sun. An algorithm for convex quadratic programming that requires u {eth}n3:5L{Thorn} arithmetic operations. Mathematics of Operations Research, 15:342-363, 1990.
74. S. Mehrota and J. Sun. A method of analytic centers for quadratically constrained convex quadratic programs, SIAM Journal of Numerical Analysis, 28:529-544, 1991.
75. S. Mizuno and A. Nagasawa. A primal-dual affine scaling potential reduction algorithm for linear programming. Mathematical Programming, 62:119-131, 1993.
76. R.D.C. Monteiro. Primal-dual path-following algorithms for semidefinite programming. SIAM Journal on Optimization, 7:663-678, 1997.
77. R.D.C. Monteiro and I. Adler. Interior-path following primal-dual algorithms: Part I: Linear programming. Mathematical Programming, 44:27-41, 1989.
78. R.D.C. Monteiro and I. Adler. Interior-path following primal-dual algorithms: Part II: Convex quadratic programming. Mathematical Programming, 44:43-66, 1989.
79. R.D.C. Monteiro, I. Adler and M.G.C. Resende. A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series. Mathematics of Operations Research, 15:191-214, 1990.
80. R.D.C. Monteiro and T. Tsuchiya. Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions. Mathematical Programming, 88:61-83, 2000.
81. J. Moré and W. Rheinboldt. On P-and S-functions and related classes of n-dimensional nonlinear mappings. Linear Algebra and its Applications, 6:45-68, 1973.
82. K.G. Murty. Linear Programming. John Wiley & Sons, Inc., 1983.
83. A.S. Nemirovskii and K. Scheinberg. Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic programming. Mathematical Programming, 72:273-289, 1996.
84. Y.E. Nesterov. Quality of semidefinite relaxation for nonconvex quadratic optimization. Optimization Methods and Software, 9:141-160, 1998.
85. Y.E. Nesterov and A.S. Nemirovskii. Interior point polynomial algorithms in convex programming. SIAM Studies in Applied Mathematics, Volume 13, SIAM, Philadelphia, PA, 1994.
86. Y.E. Nesterov and M.J. Todd. Self-scaled barriers and interior-point methods for convex programming. Mathematics of Operations Research, 22:1-42, 1997.
87. Y.E. Nesterov and M.J. Todd. Primal-dual interior-point methods for self-scaled cones. SIAM Journal on Optimization, 8:324-362, 1998.
88. Optimization Subroutine Library, Guide and References. IBM Corporation, Kingston, NY, 1991.
89. J.S. Pang. Complementarity problems, in: R. Horst and P. Pardalos (editors), Handbook in Global Optimization, pp. 271-338, Kluwer Academic Publishers, Boston, MA, 1994.
90. J. Peng, C. Roos and T. Terlaky. New complexity analysis of primal-dual Newton methods for Pp{eth}k{Thorn} linear complementarity problems, in: H. Frenk, C. Roos, T. Terlaky and S. Zhang (editors), High Performance Optimization, pp. 245-265, Kluwer Academic Publishers, Boston, MA, 1999.
91. J. Peng, C. Roos and T. Terlaky. New complexity analysis of the primal-dual Newton method for linear programming. Annals of Operations Research, 99:23-39, 2000.
92. J. Peng, C. Roos and T. Terlaky. A new class of polynomial primal-dual methods for linear and semidefinite optimization. To appear in European Journal of Operations Research, 2002.
93. J. Peng, C. Roos and T. Terlaky. Self-regular proximities and new search directions for linear and semidefinite optimization. To appear in Mathematical Programming, 2002.
94. J. Peng, C. Roos and T. Terlaky. New primal-dual algorithms for second-order conic optimizaion based on self-regular proximities. To appear in SIAM Journal on Optimization, 2002.
95. J. Peng, C. Roos, T. Terlaky and A. Yoshise. Self-regular proximities and new search directions for Pp{eth}k{Thorn} complementarity problems. AdvOL-Report#2000-6, Department of Computing and Software, McMaster University, Canada.
96. J. Peng, T. Terlaky and A. Yoshise. Some results about Pp{eth}k{Thorn} complementarity problems. AdvOL-Report#2002-1, Department of Computing and Software, McMaster University, Canada.
97. C. Roos. A comparative study of barrier functions for primal-dual interior-point algorithms in linear optimization. Technical Report in preparation, Faculty of Technical Mathematics and Informatics, Delft University of Technology, The Netherlands, 2001.
98. F. Potra and R.Q. Sheng. Homogeneous interior-point algorithms for semidefinite programming. Optimization Methods and Software, 9:161-184, 1998.
99. J. Renegar. A polynomial-time algorithm, based on Newton's method, for linear programming. Mathematical Programming, 40:59-93, 1988.
100. J. Renegar. A Mathematical View of Interior-Point Methods in Convex Optimization. MPS-SIAM Series on Optimization, vol. 03, SIAM, Philadelphia, PA, 2001.
101. C. Roos, T. Terlaky and J.-Ph.Vial. Theory and Algorithms for Linear Optimization. An Interior Approach. John Wiley & Sons, Chichester, 1997.
102. C. Roos and J.-Ph.Vial. A polynomial method of approximate centers for linear programming. Mathematical Programming, 54:295-305, 1992.
103. W. Rudin, Principles of Mathematical Analysis. Mac-Graw Hill Company, New York, 1978.
104. M. Shida, S. Shindoh and M. Kojima, Existence of search directions in interior-point algorithms for the SDP and the monotone SDLCP, SIAM Journal on Optimization, 8:387-396, 1998.
105. G. Sonnevend. An "analytic center" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming, in: A. Prèkopa, J. Szelezsán and B. Strazicky (editors), System Modelling and Optimization: Proceedings of the 12th IFIP Conference, Budapest, Hungary, September 1985, Volume 84, Lecture Notes in Control and Information Sciences, pp. 866-876. Springer Verlag, Berlin, 1986.
106. J.F. Sturm. Theory and Algorithms of Semidefinite Programming, in: H. Frenk, C. Roos, T. Terlaky and S. Zhang (editors), High Performance Optimization, pp. 1-194, Kluwer Academic Publishers, Boston, MA, 1999.
107. J.F. Sturm. Using SeDuMi 1.02, A MATLAB toolbox for optimization over symmetric cones. Interior point methods. Optimization Methods and Software, 11/12:625-653, 1999.
108. J.F. Sturm and S. Zhang, Symmetric primal-dual path following algorithms for semidefinite programming, Applied Numerical Mathematics, 29:301-315, 1999.
109. K. Tanabe. Centered Newton methods for mathematical programming, System Modelling and Optimization, 197-206, Springer-Verlag, New York, 1988.
110. T. Terlaky (editor). Interior Point Methods of Mathematical Programming. Kluwer Academic Publishers, Boston, MA, 1996.
111. M.J. Todd. Probabilistic models for linear programming. Mathematics of Operations Research, 16:671-693, 1991.
112. M.J. Todd. A study of search directions in primal-dual interior-point methods for semidefinite programming, Optimization Methods and Software, 11:1-46, 1999.
113. M.J. Todd, K.C. Toh and R.H. Tütüncü. On the Nesterov-Todd direction in semidefinite programming, SIAM Journal on Optimization, 8:769-796, 1998.
114. M.J. Todd and Y. Ye. A lower bound on the number of iterations of long-step and polynomial interior-point linear programming algorithms. Annals of Operations Research, 62:233-252, 1996.
115. K.C. Toh, M.J. Todd and R.H. Tütüncü . SDPT3-A MATLAB package for semidefinite programming, version 2.1. Interior point methods. Optimization Methods and Software, 11/12:545-581, 1999.
116. T. Tsuchiya. A polynomial primal-dual path-following algorithm for second-order cone programming. Technical Report 649, The Institute of Statistical Mathematics, Tokyo, December, 1997.
117. T. Tsuchiya. A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming. Interior point methods. Optimization Methods and Software, 11/12:141-182, 1999.
118. A.W. Tucker. Dual systems of homogeneous linear relations, in: H.W. Kuhn and A.W. Tucker (editors), Linear Inequalities and Related Systems, Annals of Mathematical Studies, 38:3-18, Princeton University Press, Princeton, NJ, 1956.
119. L. Vandenberghe and S. Boyd. SP: Software for semidefinite programming. Information System Laboratory, Electrical Engineering Department, Stanford University, CA, 1994.
120. L. Vandenberghe and S. Boyd. A primal-dual potential reduction method for problems involving matrix inequalities. Mathematical Programming, 69:205-236, 1995.
121. L. Vandenberghe and S. Boyd. Semidefinite Programming. SIAM Review, 38:49-95, 1996.
122. R.J. Vanderbei. LOQO user's manual-version 3.10. Interior point methods. Optimization Methods and Software, 11/12:485-514, 1999.
123. H. Wolkowicz, R. Saigal and L. Vandenberghe. Handbook of Semidefinite Programming (Theory, Algorithms and Applications). Kluwer Academic Publishers, Boston, MA, 2000.
124. S.J. Wright. A path-following infeasible-interior-point algorithm for linear complementarity problems. Optimization Methods and Software, 2:265-295, 1993.
125. S.J. Wright. Primal-Dual Interior-Point Methods. SIAM, Philadelphia, PA, 1997.
126. X. Xu, P.-F. Hung and Y. Ye. A simplification of the homogeneous and self-dual linear programming algorithm and its implementation. Annals of Operations Research, 62:151-172, 1996.
127. Y. Ye. On the finite convergence of interior-point algorithms for linear programming. Mathematical Programming, 57:325-335, 1992.
128. Y. Ye. Toward probabilistic analysis of interior-point algorithms for linear programming. Mathematics of Operations Research, 19:38-52, 1994.
129. Y. Ye. On homogeneous and self-dual algorithms for LCP. Mathematical Programming, 76:211-222, 1997.
130. Y. Ye. Interior Point Algorithms, Theory and Analysis. John Wiley & Sons, Chichester, 1997.
131. Y. Ye, M. Todd and S. Mizuno. An homogeneous and self-dual linear programming algorithm. Mathematics of Operations Research, 19:53-67, 1994.
132. A. Yoshise. Complementarity problems, in: T. Terlaky (editor), Interior Point Methods of Mathematical Programming, pp. 189-252. Kluwer Academic Publishers, Dordrecht, 1996.
133. L.L. Zhang and Y. Zhang. On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms. Mathematical Programming, 68:303-318, 1995.
134. Y. Zhang. User's guide to LIPSOL: linear-programming interior-point solvers V0.4. Interior point methods. Optimization Methods and Software, 11/12:385-396, 1999.
135. Y. Zhang, On extending some primal-dual algorithms from linear programming to semidefinite programming, SIAM Journal on Optimization, 8:365-386, 1998.
136. G.Y. Zhao. Interior point algorithms for linear complementarity problems based on large neighborhoods of the central path. SIAM Journal on Optimization, 8:397-413, 1998.
137. Y.B. Zhao and G. Isac. Properties of a multivalued mapping associated with some nonmonotone complementarity problems. SIAM Journal on Control and Optimization, 30:571-593, 2000.
138. Y.B. Zhao and D. Li. Strict feasibility condition in nonlinear complementarity problems. J. of Optimization Theory and Applications, 107:643-666, 2000.
139. J. Zhu. A path following algorithm for a class of convex programming problems. Zeitschrift für Operations Research, 36:359-377, 1992.