Publications - Optimization


Refereed Journal Articles

  1. Juliang Zhang, Yong Shi, Peng Zhang, Several multi-criteria programming methods for classification, Computers and Operations Research,Vol.36, No.3, 823-836,2009.
  1. Juliang Zhang, Lingyun Wu, Xiangsun Zhang, A trust region method for optimization problem with singular solutions, Applied Mathematics and Optimization, Vol.56,No.3 379–394,2007.
  1. J.-L. Zhang, Y. Wang and X.-S. Zhang. A superlinearly convergent trust region method without assumption of positive definite Hessian. J. of Optimization Theory and Application, Vol. 129, No. 1, 2006.
  1. Juliang Zhang, A robust trust region method for nonlinear optimization with inequality constraint, Applied Mathematics and Computation, Vol 176/2 pp 688-699，2006.
  1. Juliang Zhang, Jian Chen, A New Noninterior Predictor–Corrector Method for the P0 LCP，Applied Mathematics and Optimization, Vol.53, No.1, 79-100, 2006
  1. Juliang Zhang, Xiangsun Zhang, A smoothing Levenberg–Marquardt method for NCP, Applied Mathematics and Computation, Vol 178/2, pp 212-228, 2006
  1. Zhongwen Chen and Xiang-Sun Zhang, A nonmonotone trust-region algorithm with nonmonotone penalty parameters for constrained optimization. Journals of Computational and Applied Mathematics, Vol. 172, pp. 7-39, 2004.
  1. J.-L. Zhang, X.-S. Zhang and Y.-M. Su. Predictor-corrector smoothing methods for monotone LCP. Acta Mathematicae Applicatae Sinica, English Series, Vol. 20, No. 4, pp. 557-572, 2004.
  1. Naihua Xiu, Yiju Wang, and X.-S. Zhang. Modified fixed-point equations and related iterative methods for variational inequalities. Computers and Mathematics with Applications, Vol. 47, pp. 913-920, 2004.
  1. J.-L. Zhang and Y. Wang. A new trust region method for nonlinear equations. Mathematical Method of Operational Research, Vol. 58, No. 3, 283-298, 2003.
  1. J.-L. Zhang and X.-S. Zhang. A sequential penalty algorithm for nonlinear constrained optimization. J. of Optimization Theory and Application, Vol. 118, No. 3, pp. 635-655, 2003.
  1. J.-L. Zhang and X.-S. Zhang. An adaptive trust region method for equality constrained optimization. J. System Sciences and Complexity, Vol. 16, No. 4, pp. 494-505, 2003.
  1. J.-L. Zhang and X.-S. Zhang. A predictor-corrector method for convex quadratic programming. Journal of Systems Science and Mathematical Sciences, Vol. 23, No. 3, pp. 366-372, 2003. (in Chinese)
  1. J.-L. Zhang and X.-S. Zhang. A nonmonotone adaptive trust region method and its convergence. Computers and Mathematics with Applications, Vol. 45, pp. 1469-1477, 2003.
  1. J.-L. Zhang, X.-S. Zhang and X.J. Zhuo. A robust SQP method for optimization with inequality constraints. J. of Computational Mathematics, Vol. 21, No. 2, pp. 247-256, 2003.
  1. J.-L. Zhang, X.-S. Zhang and Z.W. Chen. On the convergence of a trust region method for general constrained optimization without regular condition. Acta Mathematicae Applicatae Sinica, Vol. 26, No. 1, pp. 1-10, 2003.
  1. L.-P. Zhang and X.-S. Zhang, Global linear and quadratic one-step smoothing Newton method for $P_0$-LCP. Journal of Global Optimization, Vol. 25, No. 4, pp. 363-376, 2003.
  1. J.-L. Zhang, X.-S. Zhang and X.-J. Zhuo. On the global convergence of a trust region method without regularity conditions. Mathematica Numerica Sinica, Vol. 24, No. 4, pp. 437-450, 2002. (in Chinese)
  1. J.-L. Zhang and X.-S. Zhang. A SQP method for inequality constrained optimization. Acta Mathematicae Applicatae Sinica, English Series, Vol. 18, No. 1, pp. 77-84, 2002.
  1. Xiang-Sun Zhang, Ju-Liang Zhang and Li-Zhi Liao. An adaptive trust region method and its convergence. Science in China (Series A), Vol. 45, No. 5, pp. 620-631, 2002.
  1. J.-L. Zhang and X.-S. Zhang. A robust SQP method based on a smoothing approximate penalty function for inequality constrained optimization. Journal of Systems Science and Complexity, Vol. 15, No. 1, pp. 102-112, 2002.
  1. Zhongwen Chen and Xiang-Sun Zhang. A trust-region and affine scaling algorithm for linearly constrained optimization. Science in China (Series A), Vol. 45, No. 7, pp. 1-9, 2002.
  1. Ju-Liang Zhang and Xiang-Sun Zhang. A quasi-Newton--trust region method for equality constrained optimization and its convergence properties. OR Transactions, Vol. 5, No. 4, pp. 72-80, 2001.
  1. Ju-Liang Zhang and Xiang-Sun Zhang. A modified SQP method with nonmonotone linesearch technique. Journal of Global Optimization, Vol. 21, No. 2, pp. 201-218, 2001.
  1. Ju-Liang Zhang and Xiang-Sun Zhang. A SQP method based on smoothing penalty function for nonlinear optimization with inequality constraint. J. of Systems Science and Complexity, Vol. 14, No. 2, pp. 212-217, 2001.
  1. Ju-Liang Zhang and Xiang-Sun Zhang. A SQP method for equality constrained optimization and its convergence. Acta Mathematicae Applicatae Sinica, Vol. 24, No. 1, pp. 1-9, 2001. (in Chinese)
  1. X.-S. Zhang, Z.-W.Chen and J.-L.Zhang. A self-adaptive trust region method for unconstrained optimization. OR Transactions, Vol. 5, No. 1, pp. 53-62, 2001.
  1. Ju-Liang Zhang and Xiang-Sun Zhang. A smoothing approximation to the exact penalty function for optimization with inequality constraints. J. Sys. Sci. & Math. Scis, Vol. 20, No. 4, pp. 499-505, 2000.
  1. X.-S. Zhang. A unified approach for design of LP polynomial algorithms. Journal of Engineering, Vol. 7, No. 3, pp. 155-160, 1994.
  1. X.-S. Zhang. Stability study of linear programming with parameters. Journal of Qufu Normal University, Vol. 19, No. 1, pp. 37-43, 1993. (in Chinese)
  1. X.-S. Zhang, J.-C. Cui and D.-G. Liu. A survey of the development of sensitivity analysis in parametric LP. Mathematics in Practice and Theory, No. 4, pp. 41-48, 1991. (in Chinese)
  1. D.-Z Du, F. Wu and X.-S Zhang. Why the objective function is nonlinearized in interior point methods for linear programming? Mathematics in Practice and Theory, No. 2, pp. 63-68, 1990. (in Chinese)
  1. X.-S. Zhang and D.-Z. Du. Extended binary search and it's application in design of polynomial-time algorithm for LP. Systems Science and Mathematical Sciences, Vol. 10, No. 4, pp. 371-376, 1990. (in Chinese)
  1. D.-Z. Du, F. Wu and X.-S. Zhang. On Rosen's gradient projection methods. Annals of Operations Research, Vol. 24, pp. 11-28, 1990.
  1. X.-S. Zhang and D.-G. Liu. A note on the continuity of solutions of parametric linear programs. Mathematical Programming, Vol. 47, pp. 143-153, 1990.
  1. J.-J. Niu and X.-S. Zhang. Discussion on the possibility of applying the concepts and methods of nonlinear programming to design polynomial algorithm of linear programming. Journal of Qufu Normal University, Natural Science Edition, Vol. 15, No. 4, pp. 8-14, 1989. (in Chinese)
  1. D.-Z. Du and X.-S. Zhang. On a new gradient projection method. Systems Science and Mathematical Sciences, Vol. 2, No. 2, pp. 184-192, 1989.
  1. D.-Z. Du and X.-S. Zhang. Global convergence of Rosen's gradient projection method. Mathematical Programming, Vol. 44, No. 3, pp. 357-366, 1989.
  1. X.-S. Zhang. Discussion on the convergence of Rosen's gradient projection method. Acta Mathematicae Applicatae Sinica (English Series), Vol. 3, No. 3, pp. 280-288, 1987.
  1. D.-Z. Du and X.-S. Zhang. Global convergence of Rosen's gradient projection method. Chinese Journal of Operations Research, Vol. 6, No. 2, pp. 73-74, 1987. (in Chinese)
  1. D.-Z. Du and X.-S. Zhang. A convergence theorem of Rosen's gradient projection method. Mathematical Programming, Vol. 36, No. 2, pp. 135-144, 1986.
  1. X.-S. Zhang and J.B. Rosen. Global minimization of concave program. Mathematics in Economics, Vol. 1, No. 1, pp. 121-138, 1985. (in Chinese)
  1. X.-S. Zhang. A discussion on the convergence of Rosen's gradient projection method. Acta Mathematicae Applicatae Sinica, Vol. 8, No. 1, pp. 125-128, 1985. (in Chinese)
  1. X.-S. Zhang. A survey of deterministic methods for searching global optimum. Chinese J. of Operations Research, Vol. 3, No. 2, pp. 1-13, 1984. (in Chinese)
  1. X.-S. Zhang. On convergence of gradient projection method of nonlinear constraints problem. Chinese Journal of Operations Research, Vol. 1, No. 1, 1982. (in Chinese)
  1. X.-S. Zhang. Discussion on Polak's algorithm of nonlinear programming. Acta Mathematicae Applicatae Sinica, Vol. 4, No. 1, pp. 1-13, 1981. (in Chinese)
  1. X.-S. Zhang. An improved Rosen-Ploak method. Acta Mathematicae Applicatae Sinica, Vol. 2, No. 3, pp. 257-267, 1979. (in Chinese)

Proceedings Articles


  1. Hong-Wei Liu.
    Global Convergence of the Non-Quasi-Newton Method with Non-Monotone Line Search for Unconstrained Optimization Problem.
    The Ninth International Symposium on Operations Research and Its Applications (ISORA’10), pp. 270-279
  1. Ting-Ting Gao, Zhi-Xia Yang, Ling Jing. On Universum-Support Vector Machines, Operations Research and Its Applications, Lecture Notes in Operations Research, 10, pp. 473-480, World Publishing Corporation, Zhangjiajie, 2009.
  1. Zhi-Xia Yang, Naiyang Deng. Multi-instance Support Vector Machine Based on Convex Combination, Operations Research and Its Applications, Lecture Notes in Operations Research, 10, pp. 481-487, World Publishing Corporation, Zhangjiajie, 2009.
  1. Zhen-Jun Shi and Xiang-Sun Zhang. Convergence analysis of adaptive trust region methods. Report of Research, IAM-R002, Institute of Applied Mathematics, AMSS, CAS, 2005.
  1. Zhen-Jun Shi and Xiang-Sun Zhang. From line search method to trust region method. Operations Research and Its Applications, Lecture Notes in Operations Research, Vol. 5, pp. 156-170, World Publishing Corporation, Beijing, 2005.
  1. Xiang-Sun Zhang and Ju-Liang Zhang. A quasi-Neuton-trust region method for equality constrained optimization and its convergence properties. Proceedings of the Sixth National Conference of Operations Research Society of China, pp. 998-1005, Global-Link Publishing Company, Hong Kong, 2000.
  1. Sheng Li and Xiang-Sun Zhang. Some useful numerical examples in discussion on continuity of solutions of parametric linear programming. Proceedings of APORS'91, pp. 501-508, Peking University Press, Beijing, 1992.

CategoryPublication
Valid XHTML :: Valid CSS: :: Powered by WikkaWiki