On a solution method in indefinite quadratic programming under linear constraints

References

• Polak E. Optimization. algorithms and consistent approximations. New York (NY): Springer-Verlag; 1997.
   Google Scholar
• Bomze IM. On standard quadratic optimization problems. J Global Optim. 1998;13:369–387.
   Web of Science ®Google Scholar
• Gupta OK. Applications of quadratic programming. J Inf Optim Sci. 1995;16:177–194.
   Google Scholar
• Cornuéjols G, Peña J, Tütüncü R. Optimization methods in finance. 2nd ed.Cambridge: Cambridge University Press; 2018.
   Google Scholar
• Jen T-C, Wang S-J. Image enhancement based on quadratic programming. The 15th IEEE International Conference on Image Processing; 2008. p. 3164–3167; San Diego (CA). Available from: https://scholar.nycu.edu.tw/en/publications/image-enhancement-based-on-quadratic-programming
   Google Scholar
• McCarl BA, Moskowitz H, Furtan H. Quadratic programming applications. Omega. 1977;5:43–55.
   Web of Science ®Google Scholar
• Akoa FB. Combining DC algorithms (DCAs) and decomposition techniques for the training of nonpositive–semidefinite kernels. IEEE Trans Neur Networks. 2008;19:1854–1872.
   PubMed Web of Science ®Google Scholar
• Xu HM, Xue H, Chen X-H, et al. Solving indefinite kernel support vector machine with difference of convex functions programming. Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17), Association for the Advancement of Artificial Intelligence; 2017. p. 2782–2788; San Francisco (CA). Available from: https://ojs.aaai.org/index.php/AAAI/issue/view/302
   Google Scholar
• Xue H, Song Y, Xu H-M. Multiple indefinite kernel learning for feature selection. Knowledge-Based Systems. https://doi.org/10.1016/j.knosys.2019.105272; 2019.
   Google Scholar
• Liu F, Huang X, Peng C, et al. Robust kernel approximation for classification. The 24th International Conference ‘Neural Information Processing, ICONIP 2017, Guangzhou, China; 2017. p. 14–18. Proceedings, Part I; 2017. p. 289–296.
   Google Scholar
• Wiebking R. Selected applications of all-quadratic programming. OR Spektrum. 1980;1:243–249.
   Google Scholar
• Lee GM, Tam NN, Yen ND. Quadratic programming and affine variational inequalities: a qualitative study. New York (NY): Springer Verlag; 2005.
   Google Scholar
• Bomze IM, Danninger G. A finite algorithm for solving general quadratic problems. J Global Optim. 1994;4:1–16.
   Web of Science ®Google Scholar
• Cambini R, Sodini C. Decomposition methods for solving nonconvex quadratic programs via branch and bound. J Global Optim. 2005;33:313–336.
   Web of Science ®Google Scholar
• Pham Dinh T, Le Thi HA. Solving a class of linearly constrained indefinite quadratic programming problems by d.c. algorithms. J Global Optim. 1997;11:253–285.
   Web of Science ®Google Scholar
• Pham Dinh T, Le Thi HA. A d.c. optimization algorithm for solving the trust-region subproblem. SIAM J Optim. 1998;8:476–505.
   Web of Science ®Google Scholar
• Pham Dinh T, Le Thi HA. A branch and bound method via DC optimization algorithm and ellipsoidal techniques for box constrained nonconvex quadratic programming problems. J Global Optim. 1998;13:171–206.
   Web of Science ®Google Scholar
• Pham Dinh T, Le Thi HA, Akoa F. Combining DCA (DC algorithms) and interior point techniques for large-scale nonconvex quadratic programming. Optim Methods Softw. 2008;23:60–629.
   Web of Science ®Google Scholar
• Ye Y. An extension of Karmarkar's algorithm and the trust region method for quadratic programming. In: Megiddo N, editor. Progress in Mathematical Programming. New York (NY): Springer; 1989. p. 49–63.
   Google Scholar
• Ye Y. On affine scaling algorithms for nonconvex quadratic programming. Math Programming. 1992;56:285–300.
   Web of Science ®Google Scholar
• Ye Y. Interior point algorithms: theory and analysis. New York (NY): Wiley; 1997.
   Google Scholar
• Gould NIM, Toint P.L. A Quadratic Programming Page. http://www.numerical.rl.ac.uk/people/nimg/qp/qp.html.
   Google Scholar
• Pardalos PM, Vavasis SA. Quadratic programming with one negative eigenvalue is NP-hard. J Global Optim. 1991;1:15–22.
   Google Scholar
• Pham Dinh T, Le Thi HA. Convex analysis approach to d.c. programming: theory, algorithms and applications. Acta Math Vietnam. 1997;22:289–355.
   Google Scholar
• Le Thi HA, Pham Dinh T. The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann Oper Res. 2005;133:23–46.
   Web of Science ®Google Scholar
• Pham Dinh T, Le Thi HA. DC (difference of convex functions) programming. Theory, algorithms, applications: the state of the art. Proceedings of the First International Workshop on Global Constrained Optimization and Constraint Satisfaction (Cocos’02); Valbonne Sophia Antipolis, France; 2002. p. 2–4.
   Google Scholar
• Le Thi HA, Pham Dinh T, Yen ND. Properties of two DC algorithms in quadratic programming. J Global Optim. 2011;49:481–495.
   Web of Science ®Google Scholar
• Le Thi HA, Pham Dinh T, Yen ND. Behavior of DCA sequences for solving the trust-region subproblem. J Global Optim. 2012;53:317–329.
   Web of Science ®Google Scholar
• Tuan HN. Boundedness of a type of iterative sequences in two-dimensional quadratic programming. J Optim Theory Appl. 2015;164:234–245.
   Web of Science ®Google Scholar
• Tuan HN. Linear convergence of a type of DCA sequences in nonconvex quadratic programming. J Math Anal Appl. 2015;423:1311–1319.
   Web of Science ®Google Scholar
• Luo ZQ, Tseng P. Error bound and convergence analysis of matrix splitting algorithms for the affine variational inequality problem. SIAM J Optim. 1992;2:43–54.
   Web of Science ®Google Scholar
• Tseng P. On linear convergence of iterative methods for the variational inequality problem. J Comput Appl Math. 1995;60:237–252.
   Web of Science ®Google Scholar
• Luo Z-Q. New error bounds and their applications to convergence analysis of iterative algorithms. Math Program. 2000;88:341–355.
   Web of Science ®Google Scholar
• Leong WJ, Goh BS. Convergence and stability of line search methods for unconstrained optimization. Acta Appl Math. 2013;127:155–167.
   Web of Science ®Google Scholar
• Le Thi HA, Huynh VN, Pham Dinh T. Convergence analysis of difference-of-convex algorithm with subanalytic data. J Optim Theory Appl. 2018;179:103–126.
   Web of Science ®Google Scholar
• An NT, Nam NM. Convergence analysis of a proximal point algorithm for minimizing differences of functions. Optimization. 2017;66:129–147.
   Web of Science ®Google Scholar
• Le Thi HA, Pham Dinh T. DC programming and DCA: thirty years of developments. Math Program. 2018;169:5–68.
   Web of Science ®Google Scholar
• Jiang J. Asymptotic analysis of mixed effects models. theory, applications, and open problems. Boca Raton (FL): CRC Press; 2017.
   Google Scholar
• Stoer J, Bulirsch R. Introduction to numerical analysis. New York (NY): Springer-Verlag; 1980.
   Google Scholar
• Kinderlehrer D, Stampacchia G. An introduction to variational inequalities and their applications. New York (NY): Academic Press, Inc; 1980.
   Google Scholar
• Press WH, Teukolsky SA, Vetterling WT, et al. Numerical recipes in C. the art of scientific computing. 2nd ed. New York (NY): Cambridge University Press; 1997.
   Google Scholar
• Achterberg T, Towle E Non-convex quadratic optimization. Webinar talk on some tools of Gurobi 9.0. https://www.gurobi.com/resource/non-convex-quadratic-optimization; 2019.
   Google Scholar