Skip to main content
SpringerLink
Log in

Boundedness of a Type of Iterative Sequences in Two-Dimensional Quadratic Programming

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

We prove that any iterative sequence generated by the projection decomposition algorithm of Pham Dinh et al. (Optim Methods Softw 23:609–629, 2008) in quadratic programming is bounded, provided that the quadratic program in question is two-dimensional and solvable.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bank, B., Guddat, J., Klatte, D., Kummer, B., Tammer, K.: Nonlinear Parametric Optimization. Birkhuser Verlag, Basel-Boston (1983)

    Google Scholar 

  2. Cottle, R.W., Pang, J.-S., Stone, R.E.: The Linear Complementarity Problem. Academic Press, New York (1992)

    MATH  Google Scholar 

  3. Lee, G.M., Tam, N.N., Yen, N.D.: Quadratic Programming and Affine Variational Inequalities: A Qualitative Study. Nonconvex Optimization and Its Applications, vol. 78. Springer, New York (2005)

  4. Frank, M., Wolfe, P.: An algorithm for quadratic programming. Nav. Res. Logist. Q. 3, 95–110 (1956)

    Article  MathSciNet  Google Scholar 

  5. Majthay, A.: Optimality conditions for quadratic programming. Math. Program. 1, 359–365 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  6. Contesse, L.: Une caractérisation complète des minima locaux en programmation quadratique. Numer. Math. 34, 315–332 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  7. Gowda, M.S., Pang, J.-S.: On solution stability of the linear complementarity problem. Math. Oper. Res. 17, 77–83 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  8. Tam, N.N., Yen, N.D.: Continuity properties of the Karush–Kuhn–Tucker point set in quadratic programming problems. Math. Program. A 85, 193–206 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  9. Phu, H.X., Yen, N.D.: On the stability of solutions to quadratic programming problems. Math. Program. A 89, 385–394 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  10. Tam, N.N.: Continuity of the optimal value function in indefinite quadratic programming. J. Glob. Optim. 23, 43–61 (2002)

    Article  MATH  Google Scholar 

  11. Lee, G.M., Tam, N.N., Yen, N.D.: On the optimal value function of a linearly perturbed quadratic program. J. Glob. Optim. 32, 119–134 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  12. Lee, G.M., Tam, N.N., Yen, N.D.: Continuity of the solution map in quadratic programs under linear perturbations. J. Optim. Theory Appl. 129, 415–423 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  13. Bomze, I.M., Danninger, G.: A finite algorithm for solving general quadratic problems. J. Glob. Optim. 4, 1–16 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  14. Cambini, R., Sodini, C.: Decomposition methods for solving nonconvex quadratic programs via Branch and Bound. J. Glob. Optim. 33, 313–336 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  15. Pham Dinh, T., Le Thi, H.A.: Solving a class of linearly constrained indefinite quadratic programming problems by D.C. algorithms. J. Glob. Optim. 11, 253–285 (1997)

    Article  MATH  Google Scholar 

  16. Pham Dinh, T., Le Thi, H.A.: A branch and bound method via DC optimization algorithm and ellipsoidal techniques for box constrained nonconvex quadratic programming problems. J. Glob. Optim. 13, 171–206 (1998)

    Article  MATH  Google Scholar 

  17. Pham Dinh, T., Le Thi, H.A.: Convex analysis approach to D.C. programming: theory, algorithms and applications. Acta Math. Vietnam. 22, 289–355 (1997)

    MATH  MathSciNet  Google Scholar 

  18. Pham Dinh, T., Le Thi, H.A., Akoa, F.: Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming. Optim. Methods Softw. 23, 609–629 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  19. Le Thi, H.A., Pham Dinh, T., Yen, N.D.: Properties of two DC algorithms in quadratic programming. J. Glob. Optim. 49, 481–495 (2011)

    Article  MATH  Google Scholar 

  20. Polyak, B.T.: Introduction to Optimization. Translated from the Russian. Optimization Software, Inc., Publications Division, New York (1987)

  21. Pham Dinh, T., Le Thi, H.A.: A D.C. optimization algorithm for solving the trust-region subproblem. SIAM J. Optim. 8, 476–505 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  22. Le Thi, H.A., Pham Dinh, T., Yen, N.D.: Behavior of DCA sequences for solving the trust-region subproblem. J. Glob. Optim. 53, 317–329 (2012)

    Article  MATH  Google Scholar 

  23. Tuan, H.N., Yen, N.D.: Convergence of Pham Dinh–Le Thi Algorithm for the trust-region subproblem. J. Glob. Optim. 55, 337–347 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  24. Tuan, H.N.: Convergence rate of Pham Dinh–Le Thi algorithm for the trust-region subproblem. J. Optim. Theory Appl. 154, 904–915 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  25. Rockafellar, R.T.: Convex Analysis. Princeton Mathematical Series. Princeton University Press, Princeton (1970)

    Google Scholar 

Download references

Acknowledgments

This research is funded by Vietnam National Foundation for Science and Technology Development (NAFOSTED) under Grant number 101.02-2012.03. The author would like to thank Professor Nguyen Dong Yen, and the two anonymous referees for valuable comments, which have helped to improve greatly the presentation.

Author information

Authors and Affiliations

  1. Department of Mathematics, Hanoi Pedagogical University, No. 2, Xuan Hoa, Phuc Yen, Vinh Phuc, Vietnam

    Hoang Ngoc Tuan

Authors
  1. Hoang Ngoc Tuan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hoang Ngoc Tuan.

Additional information

Communicated by Nguyen Dong Yen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tuan, H.N. Boundedness of a Type of Iterative Sequences in Two-Dimensional Quadratic Programming. J Optim Theory Appl 164, 234–245 (2015). https://doi.org/10.1007/s10957-014-0530-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-014-0530-x

Keywords

Mathematics Subject Classification (2000)

Search

Navigation