Abstract
We consider the problem of maximization of a convex quadratic form on a convex polyhedral set, which is known to be NP-hard. In particular, we focus on upper bounds on the maximum value. We investigate utilization of different vector norms (estimating the Euclidean one) and different objective matrix factorizations. We arrive at some kind of duality with positive duality gap in general, but with possibly tight bounds. We discuss theoretical properties of these bounds and also extensions to generally preconditioned factors. We employ mainly the maximum vector norm since it yields efficiently computable bounds, however, we study other norms, too. Eventually, we leave many challenging open problems that arose during the research.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming. Theory and Algorithms, 3rd edn. Wiley, New York (2006)
Černý, M., Hladík, M.: The complexity of computation and approximation of the t-ratio over one-dimensional interval data. Comput. Stat. Data Anal. 80, 26–43 (2014)
Fiedler, M., Nedoma, J., Ramík, J., Rohn, J., Zimmermann, K.: Linear Optimization Problems with Inexact Data. Springer, New York (2006)
Floudas, C.A., Visweswaran, V.: Quadratic optimization. In: Horst, R., Pardalos, P.M. (eds.) Handbook of Global Optimization, pp. 217–269. Springer, Boston, MA (1995)
Gould, N.I.M., Toint, P.L.: A quadratic programming bibliography. RAL Internal Report 2000-1, Science and Technology Facilities Council, Scientific Computing Department, Numerical Analysis Group (2012). ftp://ftp.numerical.rl.ac.uk/pub/qpbook/qp.pdf. Accessed 24 Nov 2019
Hartman, D., Hladík, M.: Tight bounds on the radius of nonsingularity. In: Nehmeier, Mm, et al. (eds.) Scientific Computing, Computer Arithmetic, and Validated Numerics: 16th International Symposium, SCAN 2014, Würzburg, Germany, September 21–26, LNCS, vol. 9553, pp. 109–115. Springer (2016)
Hartman, D., Hladík, M.: Regularity radius: properties, approximation and a not a priori exponential algorithm. Electron. J. Linear Algebra 33, 122–136 (2018)
Hladík, M., Hartman, D.: Maximization of a convex quadratic form on a polytope: factorization and the Chebyshev norm bounds. In: Le Thi, H.A., et al. (eds.) Optimization of Complex Systems: Theory, Models, Algorithms and Applications, AISC, vol. 991, pp. 119–127. Springer, Cham (2020)
Horst, R., Tuy, H.: Global Optimization. Deterministic Approaches. Springer, Berlin (1990)
Konno, H.: Maximizing a convex quadratic function over a hypercube. J. Oper. Res. Soc. Jpn. 23(2), 171–188 (1980)
Kreinovich, V., Lakeyev, A., Rohn, J., Kahl, P.: Computational Complexity and Feasibility of Data Processing and Interval Computations. Kluwer, Dordrecht (1998)
Locatelli, M., Schoen, F.: Global optimization: Theory, Algorithms, and Applications, MOS-SIAM Series on Optimization, vol. 15. SIAM, Philadelphia, PA (2013)
Meyer, C.D.: Matrix Analysis and Applied Linear Algebra. SIAM, Philadelphia (2000)
Pardalos, P., Rosen, J.: Methods for global concave minimization: a bibliographic survey. SIAM Rev. 28(3), 367–79 (1986)
Rohn, J.: Computing the norm \(\Vert A\Vert _{\infty,1}\) is NP-hard. Linear Multilinear Algebra 47(3), 195–204 (2000)
Sherali, H.D., Adams, W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer, Boston (1999)
Tuy, H.: Convex Analysis and Global Optimization, Springer Optimization and Its Applications, vol. 110, 2nd edn. Springer, Cham (2016)
Vavasis, S.A.: Nonlinear Optimization: Complexity Issues. Oxford University Press, New York (1991)
Vavasis, S.A.: Polynomial time weak approximation algorithms for quadratic programming. In: Pardalos, P.M. (ed.) Complexity in Numerical Optimization, pp. 490–500. World Scientific Publishing, Singapore (1993)
Zamani, M.: A new algorithm for concave quadratic programming. J. Glob. Optim. 75(3), 655–681 (2019)
Zamani, M.: New bounds for nonconvex quadratically constrained quadratic programming. arXiv preprint arXiv:1902.08861 (2019)
Acknowledgements
The authors were supported by the Czech Science Foundation Grant P403-18-04735S.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Hladík, M., Hartman, D. & Zamani, M. Maximization of a PSD quadratic form and factorization. Optim Lett 15, 2515–2528 (2021). https://doi.org/10.1007/s11590-020-01624-w
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-020-01624-w