Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
129 tokens/sec
GPT-4o
28 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The Mixed Integer Trust Region Problem (2402.08827v2)

Published 13 Feb 2024 in math.OC and cs.DM

Abstract: In this paper we consider the problem of minimizing a general quadratic function over the mixed integer points in an ellipsoid. This problem is strongly NP-hard, NP-hard to approximate within a constant factor, and optimal solutions can be irrational. In our main result we show that an arbitrarily good solution can be found in polynomial time, if we fix the number of integer variables. This algorithm provides a natural extension to the mixed integer setting, of the polynomial solvability of the trust region problem proven by Ye, Karmarkar, Vavasis, and Zippel. Our result removes a key bottleneck in the design and analysis of model trust region methods for mixed integer nonlinear optimization problems. The techniques introduced to prove this result are of independent interest and can be used in other mixed integer programming problems involving quadratic functions. As an example we consider the problem of minimizing a general quadratic function over the mixed integer points in a polyhedron. For this problem, we show that a solution satisfying weak bounds with respect to optimality can be computed in polynomial time, provided that the number of integer variables is fixed. It is well-known that finding a solution satisfying stronger bounds cannot be done in polynomial time, unless P=NP.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (24)
  1. Mathematical Programming 69, 429–441 (1995)
  2. Bienstock, D.: A note on polynomial solvability of the CDT problem. SIAM Journal on Optimization 26(1), 488–498 (2016)
  3. Springer (2014)
  4. Society for Industrial and Applied Mathematics (2000)
  5. Del Pia, A.: An approximation algorithm for indefinite mixed integer quadratic programming. Mathematical Programming, Series A 201, 263–293 (2023)
  6. Del Pia, A.: Convex quadratic sets and the complexity of mixed integer convex quadratic programming. arXiv:2311.00099 (2024)
  7. Mathematical Programming, Series A 162(1), 225–240 (2017)
  8. Exler, O.: New trust region SQP methods for continuous and integer optimization. Ph.D. thesis, Universität Bayreuth (2013)
  9. Optimization Letters 1, 269–280 (2007)
  10. Theoretical Computer Science 1(3), 237–267 (1976)
  11. Karmakar, N.: An interior-point approach to NP-complete problems - part I. In: J. Lagarias, M.J. Todd (eds.) Mathematical Developments Arising from Linear Programming, vol. Contemporary Mathematics 114, pp. 297–308. American Mathematical Society, Providence, RI (1989)
  12. Theoretical Computer Science 361, 210–225 (2006)
  13. Lenstra, H.W.J.: Integer programming with a fixed number of variables. Mathematics of Operations Research 8(4), 538–548 (1983)
  14. The Springer International Series in Engineering and Computer Science. Springer, New York, NY (2002)
  15. Wiley, Chichester (1983). Translated by E.R. Dawson from Slozhnost’ Zadach i Effektivnost’ Metodov Optimizatsii (1979).
  16. Newby, E.: General solution methods for mixed integer quadratic programming and derivative free mixed integer non-linear programming problems. Ph.D. thesis, University of the Witwatersrand (2013)
  17. Computational Optimization and Applications 60, 199–229 (2015)
  18. Journal of Global Optimization 1(1), 15–22 (1991)
  19. Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)
  20. SIAM Journal on Computing 29(6), 2074–2097 (2000)
  21. Vavasis, S.A.: On approximation algorithms for concave quadratic programming. In: C. Floudas, P.M. Pardalos (eds.) Recent Advances in Global Optimization, pp. 3–18. Princeton University Press, Princeton, NJ (1992)
  22. Vavasis, S.A.: Polynomial time weak approximation algorithms for quadratic programming. In: P.M. Pardalos (ed.) Complexity in Numerical Optimization. World Scientific (1993)
  23. Tech. Rep. 90-1182, Department of Computer Science, Cornell University, Ithaca, New York (1990)
  24. Ye, Y.: On affine scaling algorithms for nonconvex quadratic programming. Mathematical Programming 56, 285–300 (1992)

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com