Table of Contents Author Guidelines Submit a Manuscript
Advances in Operations Research
Volume 2013, Article ID 513918, 7 pages
http://dx.doi.org/10.1155/2013/513918
Research Article

A Newton-Type Algorithm for Solving Problems of Search Theory

Department of Mathematical Sciences, Tsinghua University, Beijing 100084, China

Received 9 March 2012; Accepted 15 December 2012

Academic Editor: Chandal Nahak

Copyright © 2013 Liping Zhang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. B. O. Koopman, Search and Screening. General Principles with Historical Applications, Military Operations Research Society, Alexandria, Va, USA, 1999.
  2. M. Patriksson, “A survey on the continuous nonlinear resource allocation problem,” European Journal of Operational Research, vol. 185, no. 1, pp. 1–46, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. V. V. Popovich, Y. A. Ivakin, and S. S. Shaida, “Theory of search for moving objects,” in Proceedings of the IEEE Ocean Conference and Exhibition, pp. 1319–1329, Biloxi, Miss, USA, October 2002. View at Publisher · View at Google Scholar · View at Scopus
  4. W. Chen, Y. J. Shi, H. F. Teng, X. P. Lan, and L. C. Hu, “An efficient hybrid algorithm for resource-constrained project scheduling,” Information Sciences, vol. 180, no. 6, pp. 1031–1039, 2010. View at Publisher · View at Google Scholar · View at Scopus
  5. S. M. Stefanov, “Convex quadratic minimization subject to a linear constraint and box constraints,” Applied Mathematics Research Express, vol. 2004, no. 1, pp. 17–42, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. C. L. Sun, J. C. Zeng, and J. S. Pan, “An improved vector particle swarm optimization for constrained optimization problems,” Information Sciences, vol. 181, no. 6, pp. 1153–1163, 2011. View at Publisher · View at Google Scholar · View at Scopus
  7. A. Fischer, “A special Newton-type optimization method,” Optimization, vol. 24, no. 3-4, pp. 269–284, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. L. Zhang, S.-Y. Wu, and T. Gao, “Improved smoothing Newton methods for P0 nonlinear complementarity problems,” Applied Mathematics and Computation, vol. 215, no. 1, pp. 324–332, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. L. P. Zhang and Y. Zhou, “A new approach to supply chain network equilibrium models,” Computers & Industrial Engineering, vol. 63, pp. 82–88, 2012. View at Publisher · View at Google Scholar
  10. R. Mifflin, “Semismooth and semiconvex functions in constrained optimization,” SIAM Journal on Control and Optimization, vol. 15, no. 6, pp. 959–972, 1977. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. L. Qi, “Regular pseudo-smooth NCP and BVIP functions and globally and quadratically convergent generalized Newton methods for complementarity and variational inequality problems,” Mathematics of Operations Research, vol. 24, no. 2, pp. 440–471, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. L. Q. Qi and J. Sun, “A nonsmooth version of Newton's method,” Mathematical Programming, vol. 58, no. 3, pp. 353–367, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. F. H. Clarke, Optimization and Nonsmooth Analysis, John Wiley & Sons, New York, NY, USA, 1983. View at MathSciNet
  14. X. Chen, L. Qi, and D. Sun, “Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities,” Mathematics of Computation, vol. 67, no. 222, pp. 519–540, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. L. Q. Qi, “Convergence analysis of some algorithms for solving nonsmooth equations,” Mathematics of Operations Research, vol. 18, no. 1, pp. 227–244, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  16. C. Wilkinson and S. K. Gupta, “Allocation promotional effort to competing activities: a dynamic programming approach,” in Proceedings of the International Federation of Operational Research Societies Conference (IFORS '69), pp. 419–432, Venice, Italy, 1969. View at Publisher · View at Google Scholar