On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems

Journal of Global Optimization

Volumn 33, Issue 3, 2005, Pages 369-391

  Fang, Shu Cherng ^a,b   Han, Jiye ^c   Huang, Zheng Hai ^d   Ilker Birbil, S ^e  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

^b TSINGHUA UNIVERSITY   (China)

^c INSTITUTE OF APPLIED MATHEMATICS   (China)

^d TIANJIN UNIVERSITY   (China)

^e SABANCI UNIVERSITY   (Turkey)

Author keywords

65K10; 90C33

Indexed keywords

ALGORITHMS; FUNCTIONS; ITERATIVE METHODS; LINEAR SYSTEMS; PROBLEM SOLVING;

ENTROPY FUNCTION; FINITE TERMINATION; NEWTON-TYPE METHOD; VERTICAL LINEAR COMPLEMENTARITY PROBLEM (VLCP);

ENTROPY;

EID: 27844487710     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-004-6098-5     Document Type: Article

References (42)

1. Bertsekas, D.P. (1977), Approximation procedures based on the method of multipliers, Journal of Optimization Theory and Applications 23, 487-510.
2. Burke, J. and Xu, S. (1998), The global linear convergence of a non-interior path-following algorithm for linear complementarity problem, Mathematics of Operations Reseasch 23, 719-734.
3. Chang, P.L. (1980), A minimax approach to nonlinear programming, Ph.D. dissertation, Department of Mathematics, University of Washington, Seattle, WA.
4. Chen, B. and Chen, X. (2000), A global linear and local quadratic continuation smoothing method for variational inequalities with box constrains, Computational Optimization and Applications 13, 131-158.
5. Cottle, R.W. and Dantzig, G.B. (1970), A generalization of the linear complementarity problem, Journal of Combinatorial Theory 8, 79-90.
6. Cottle, R.W., Pang, J.S. and Stone, R.E. (1992), The Linear Complementarity Problem, Academic Press, Boston, MA.
7. Chen, X. and Ye, Y. (1999), On homotopy-smoothing methods for variational inequalities, SIAM Journal on Control and Optimization 37, 589-616.
8. Ebiefung, A.A. (1995), Nonlinear mappings associated with the generalized linear complementarity problem, Mathematical Programming 69, 255-268.
9. Ebiefung, A.A. and Kostreva, M.M. (1993), The generalized Leontief input-output model and its application to the choice of the new technology, Annals of Operations Research 44, 161-172.
10. Engelke, S. and Kanzow, C. (2000) Predictor-corrector smoothing methods for the solution of linear programming, Preprint, Department of Mathematics, University of Hamburg, Germany, March, 2000.
11. Fang, S.-C. and Tsao, H.-S.J. (1996), On the entropic perturbation and exponential penalty methods for linear programming, Journal of Optimization Theory and Applications 89, 461-466.
12. Fang, S.-C., Rajasekera, J.R. and Tsao, H.-S. J. (1997), Entropy Optimization and Mathematical Programming, Kluwer Academic Publishers, Boston/London/Dordrecht, 1997.
13. Fischer, A. and Kanzow, C. (1996), On the finite termination of an iterative method for linear complementarity problems, Mathematical Programming 74, 279-292.
14. Fujisawa, T. and Kuh, E.S. (1972), Piecewise-linear theory of nonlinear networks, SIAM Journal on Applied Mathematics 22, 307-328.
15. Goldstein, A.A. (1997), Chebyshev approximation and linear inequalities via exponentials, Report, Department of Mathematics, University of Washington, Seattle, WA.
16. Gowda, M.S. and Sznajder, R. (1994), The generalized order linear complementarity problem, SIAM Journal of Matrix Analysis and Applications 15, 779-795.
17. Gowda, M.S. and Sznajder, R. (1996), A generalization of the Nash equilibrium theorem on bimatrix games, International Journal of Game Theory 25, 1-12.
18. Hoffman, A.J. (1952), On approximate solutions of systems of linear equalities, Journal of Research of the National Bureau of Standards 49, 263-265.
19. Huang, Z.H. and Han, J. (2003), Non-interior continuation method for solving the monotone semidefinite complementarity problem, Applied Mathematics and Optimization 47, 195-211.
20. 0 function, Journal of Optimization Theory and Applications 117, 39-68.
21. 0- and monotone LCP, Mathematical Programming 99, 423-441.
22. 0-LCP, Journal of Computational Mathematics, 22, 797-806.
23. Illés, T., Peng, J.M., Roos, C. and Terlaky, T. (2001), A strongly polynomial procedure yielding a maximally complementarity solution for P*(k) linear complementarity problems, SIAM Journal of Optimization 11, 320-340.
24. Kort, B.W. and Bertsekas, D.P. (1972), A new penalty function for constrained minimization, Proceedings of the 1972 IEEE Conference on Decision and Control, New Orleans, Louisiana.
25. Li, X.S. (1991), An aggregate function method for nonlinear programming, Science in China (Ser. A) 34, 1467-1473.
26. Li, X.S. and Fang, S.-C. (1997), On the entropic regularization method for solving min-max problems with applications, Mathematical Methods of Operations Research 46, 119-130.
27. Mangasarian, O.L. (1979), Generalized linear complementarity problems as linear programming, Opemtions Research Verfahren 31, 393-402.
28. Mohan, S.R., Neogy, S.K. and Sridhar, R. (1996), The generalized linear complementarity problem revisited, Mathematical Programming 74, 197-218.
29. Mehrotra, S. and Ye, Y. (1993), On finding the optimal facet of linear programs, Mathematical Programming 62, 497-515.
30. Peng, P.J. and Lin, Z. (1999), A non-interior continuation method for generalized linear complementarity problems, Mathematical Programming 86, 533-563.
31. Qi, H.D. and Liao, L.Z. (1999), A smoothing Newton method for extended vertical linear complementarity problems, SIAM Journal on Matrix Analysis and Applications 21, 45-66.
32. Qi, H.D., Liao, L.Z. and Lin, Z. (1999), Regularized smoothing approximations to vertical nonlinear complementarity problems, Journal of Mathematical Analysis and Applications 230, 261-276.
33. Qi, L. and Sun, D. (2000), Improving the convergence of non-interior point algorithm for nonlinear complementarity problems, Mathematics of Computation 69, 283-304.
34. Schrijver, A. (1986), Theory of Linear and Integer Programming, Wiley, New York.
35. Sun, M. (1987), Singular control problems in bounded intervals, Stochastics 21, 303-344.
36. Sun, M. (1989), Monotonicity of Mangasarian's iterative algorithm for the generalized linear complementarity problem, Journal of Mathematical Analysis and Applications 144, 473-485.
37. Sun, D., Han, J., and Zhao, Y.B. (1998), On the finite termination of the damped-Newton algorithm for the linear complementarity problem, Acta Mathematica Applicatae Sinica 21, 148-154.
38. 0 and P-properties, extended vertical and horizontal LCP's, Linear Algebra and its Applications 223/224, 695-716.
39. Tseng, P. (1999), Analysis of a non-interior continuation method based on Chen-Mangasarian smoothing functions for complementarity problems, In: Fukushima, M. and Qi, L. (eds.), Reformulation-Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, pp. 381-404, Kluwer Academic Publishers, Boston.
40. Tseng, P. (2000), Error bounds and superlinear convergence analysis of some Newton-type methods in optimization. In: Di Pillo, G. and Giannessi, F. (eds.), Nonlinear Optimization and Related Topics, pp. 445-462, Kluwer Academic Publishers, Boston.
41. Tseng, P. and Bertsekas, D.P. (1993), On the convergence of the exponential multiplier method for convex programming, Mathematical Programming 60, 1-19.
42. Ye, Y. (1992), On the finite convergence of interior-point algorithms for linear programming, Mathematical Programming 57, 325-335.