Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 835819, 10 pages
http://dx.doi.org/10.1155/2014/835819
Research Article

A Noninterior Path following Algorithm for Solving a Class of Multiobjective Programming Problems

1College of Mathematics, Luoyang Normal University, Luoyang 471022, China
2Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, Changchun 130012, China
3Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100093, China
4National Key Laboratory of Science and Technology on Advanced Composites in Special Environments, Harbin Institute of Technology, Harbin 150080, China

Received 10 January 2014; Revised 20 July 2014; Accepted 28 July 2014; Published 13 August 2014

Academic Editor: Gerhard-Wilhelm Weber

Copyright © 2014 Menglong Su et al. 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. H. W. Kuhn and A. W. Tucker, “Nonlinear programming,” in Proceedings of the 2nd Berkeley Symposium on Mathematical Statistics and Probability, J. Neyman, Ed., University of California Press, Berkeley, Calif, USA, 1951.
  2. M. Guignard, “Generalized Kuhn-Tucker conditions for mathematical programming problems in a Banach space,” SIAM Journal on Control and Optimization, vol. 7, pp. 232–241, 1969. View at Publisher · View at Google Scholar · View at MathSciNet
  3. C. Y. Lin and J. L. Dong, Methods and Theories in Multiobjective Optimization, Jinlin Education Press, Changchun, China, 1992.
  4. T. Maeda, “Second-order conditions for efficiency in nonsmooth multiobjective optimization problems,” Journal of Optimization Theory and Applications, vol. 122, no. 3, pp. 521–538, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  5. N. Karmarkar, “A new polynomial-time algorithm for linear programming,” Combinatorica, vol. 4, no. 4, pp. 373–395, 1984. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. 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, vol. 36, no. 2, pp. 183–209, 1986. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. C. C. Gonzaga, “Path-following methods for linear programming,” SIAM Review, vol. 34, no. 2, pp. 167–224, 1992. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. M. Kojima, S. Mizuno, and A. Yoshise, “A primal-dual interior point algorithm for linear programming,” in Progress in Mathematical Programming, Interior Point and Related Methods, N. Megiddo, Ed., Springer, New York, NY, USA, 1988. View at Google Scholar
  9. N. Megiddo, “Pathways to the optimal set in linear programming,” in Progress in Mathematical programming, Interior Point and Related Methods, pp. 131–158, Springer, New York, NY, USA, 1988. View at Google Scholar · View at MathSciNet
  10. R. D. C. Monteiro and I. Adler, “Interior path following primal-dual algorithms. I. Linear programming,” Mathematical Programming, vol. 44, no. 1, pp. 27–41, 1989. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. R. D. C. Monteiro and I. Adler, “Interior path following primal-dual algorithms, Part II: convex quadratical programming,” Mathematical Programming, vol. 44, no. 1, pp. 43–66, 1989. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. J. Renegar, “A polynomial-time algorithm, based on Newton's method, for linear programming,” Mathematical Programming, vol. 40, no. 1, pp. 59–93, 1988. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. K. O. Kortanek, F. Potra, and Y. Ye, “On some efficient interior point methods for nonlinear convex programming,” Linear Algebra and Its Applications, vol. 152, pp. 169–189, 1991. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. G. P. McCormick, “The projective SUMT method for convex programming,” Mathematics of Operations Research, vol. 14, no. 2, pp. 203–223, 1989. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. R. D. C. Monteiro and I. Adler, “An extension of Karmarkar type algorithm to a class of convex separable programming problems with global linear rate of convergence,” Mathematics of Operations Research, vol. 15, no. 3, pp. 408–422, 1990. View at Publisher · View at Google Scholar · View at MathSciNet
  16. J. Zhu, “A path following algorithm for a class of convex programming problems,” ZOR-Mathematical Methods of Operations Research, vol. 36, no. 4, pp. 359–377, 1992. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. R. B. Kellogg, T. Y. Li, and J. Yorke, “A constructive proof of the Brouwer fixed-point theorem and computational results,” SIAM Journal on Numerical Analysis, vol. 13, no. 4, pp. 473–483, 1976. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  18. S. Smale, “A convergent process of price adjustment and global Newton methods,” Journal of Mathematical Economics, vol. 3, no. 2, pp. 107–120, 1976. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. J. C. Alexander and J. A. Yorke, “The homotopy continuation method: numerically implementable topological procedures,” Transactions of the American Mathematical Society, vol. 242, pp. 271–284, 1978. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  20. C. B. Carcia and W. I. Zangwill, “An approach to homotopy and degree theory,” Mathematics of Operations Research, vol. 4, no. 4, pp. 390–405, 1979. View at Publisher · View at Google Scholar · View at MathSciNet
  21. S. N. Chow, J. Mallet-Paret, and J. A. Yorke, “Finding zeroes of maps: homotopy methods that are constructive with probability one,” Mathematics of Computation, vol. 32, no. 143, pp. 887–899, 1978. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  22. Y. Li and Z. H. Lin, “A constructive proof of the Pincare-Birkhoff theorem,” Transactions of the American Mathematical Society, vol. 347, no. 6, pp. 2111–2126, 1995. View at Publisher · View at Google Scholar · View at MathSciNet
  23. J. Miller, “Finding the zeros of an analytic function,” Applied Mathematics and Computation, vol. 27, no. 3, pp. 243–249, 1988. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  24. L. T. Watson, “An algorithm that is globally convergent with probability one for a class of nonlinear two-point boundary value problems,” SIAM Journal on Numerical Analysis, vol. 16, no. 3, pp. 394–401, 1979. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  25. Z. H. Lin, B. Yu, and G. C. Feng, “A combined homotopy interior point method for convex nonlinear programming,” Applied Mathematics and Computation, vol. 84, no. 2-3, pp. 193–211, 1997. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. B. Yu, Q. Xu, and G. Feng, “On the complexity of a combined homotopy interior method for convex programming,” Journal of Computational and Applied Mathematics, vol. 200, no. 1, pp. 32–46, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  27. B. Yu and Z. Lin, “Homotopy method for a class of nonconvex Brouwer fixed-point problems,” Applied Mathematics and Computation, vol. 74, no. 1, pp. 65–77, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  28. Q. Xu, C. Dang, and D. Zhu, “Generalizations of fixed point theorems and computation,” Journal of Mathematical Analysis and Applications, vol. 354, no. 2, pp. 550–557, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  29. Z. Lin and Y. Li, “Homotopy method for solving variational inequalities,” Journal of Optimization Theory and Applications, vol. 100, no. 1, pp. 207–218, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  30. Q. Xu, B. Yu, G. Feng, and C. Dang, “Condition for global convergence of a homotopy method for variational inequality problems on unbounded sets,” Optimization Methods & Software, vol. 22, no. 4, pp. 587–599, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  31. D. L. Zhu, Q. Xu, and Z. Lin, “A homotopy method for solving bilevel programming problem,” Nonlinear Analysis: Theory, Methods & Applications, vol. 57, no. 7-8, pp. 917–928, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  32. W. Song and G. M. Yao, “Homotopy method for a general multiobjective programming problem,” Journal of Optimization Theory and Applications, vol. 138, no. 1, pp. 139–153, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  33. E. L. Allgower and K. Georg, Introduction to Numerical Continuation Methods, SIAM Society for Industried and Applied Mathematics, Philadelphia, Pa, USA, 2003.
  34. Z. K. Wang and T. A. Gao, An Introduction to Homotopy Methods, Chongqing Press, Chongqing, China, 1990.
  35. J. Guddat, F. G. Vazquez, and H. T. Jongen, Parametric Optimization: Singularities, Path Following, and Jumps, John Wiley & Sons, Chichester, UK, 1990.
  36. H. T. Jongen, P. Jonker, and F. Twilt, Nonlinear optimization in ℝn: I. Morse Theory, Chebyshev Approximation, Peter Lang, New York, NY, USA, 1983. View at MathSciNet
  37. H. T. Jongen, P. Jonker, and F. Twilt, Nonlinear Optimization in ℝn: II. Transversality, Flows, Parametric Aspects, Verlag Peter Lang, New York, NY, USA, 1986. View at MathSciNet
  38. H. T. Jongen, P. Jonker, and F. Twilt, “One-parameter families of optimization problems: equality constraints,” Journal of Optimization Theory and Applications, vol. 48, no. 1, pp. 141–161, 1986. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  39. H. Th. Jongen, P. Jonker, and F. Twilt, “Critical sets in parametric optimization,” Mathematical Programming, vol. 34, no. 3, pp. 333–353, 1986. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  40. H. T. Jongen, J. Rückmann, and G. Weber, “One-parametric semi-infinite optimization: on the stability of the feasible set,” SIAM Journal on Optimization, vol. 4, no. 3, pp. 637–648, 1994. View at Publisher · View at Google Scholar · View at MathSciNet
  41. H. T. Jongen, F. Twilt, and G. Weber, “Semi-infinite optimization: structure and stability of the feasible set,” Journal of Optimization Theory and Applications, vol. 72, no. 3, pp. 529–552, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  42. H. T. Jongen and G. Weber, “On parametric nonlinear programming,” Annals of Operations Research, vol. 27, no. 1–4, pp. 253–283, 1990. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  43. B. N. Lundberg and A. B. Poore, “Numerical continuation and singularity detection methods for parametric nonlinear programming,” SIAM Journal on Optimization, vol. 3, no. 1, pp. 134–154, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  44. K. Geoge, “Numerical integration of the Davidenko equation,” in Numerical Solution of Nonlinear Equations, E. Allgower, K. Glashoff, and H. O. Peitgen, Eds., vol. 878 of Lecture Notes in Mathematics, pp. 128–161, Springer, New York, NY, USA, 1981. View at Publisher · View at Google Scholar
  45. C. den Heijer and W. C. Rheinboldt, “On steplength algorithms for a class of continuation methods,” SIAM Journal on Numerical Analysis, vol. 18, no. 5, pp. 925–948, 1981. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  46. W. C. Rheinboldt and R. G. Melhem, “A comparison of methods for determining turning points of nonlinear equations,” Computing, vol. 29, no. 3, pp. 103–114, 1982. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  47. G. L. Naber, Topological Methods in Euclidean Spaces, Cambridge University Press, Cambridge, UK, 1980. View at MathSciNet
  48. W. Hock and K. Schittkowski, Test Examples for Nonlinear Programming Codes, vol. 187, Springer, Berlin, Germany, 1981. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus