Skip to main content
Springer Nature Link
Log in

Exactness conditions for an SDP relaxation of the extended trust region problem

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

In this paper we show that a standard SDP relaxation for so called extended trust-region problem is equivalent to a convex quadratic problem, with a linear objective and constraint functions and some additional simple convex quadratic constraints. Through this equivalence, new conditions, generalizing the ones existing in the literature, under which the SDP relaxation is exact, are introduced.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. Bao, X., Sahinidis, N.V., Tawarmalani, M.: Semidefinite relaxations for quadratically constrained quadratic programming: a review and comparisons. Math. Program. 129, 129–157 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ben-Tal, A., den Hertog, D.: Hidden conic quadratic representation of some nonconvex quadratic optimization problems. Math. Program. 143, 1–29 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bienstock, D., Michalka, A.: Polynomial solvability of variants of the trust-region subproblem. In: Proceedings of the 25th annual ACM-SIAM symposium on discrete algorithms, SODA14, pp. 380–390 (2014)

  4. Bomze, I.M.: Copositive relaxation beats Lagrangian dual bounds in quadratically and linearly constrained QPs. SIAM J. Optim. 25(3), 1249–1275 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  5. Burer, S., Anstreicher, K.: Second-order cone constraints for extended trust-region subproblems. SIAM J. Optim. 23(1), 432–451 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  6. Burer, S., Yang, B.: The trust region subproblem with non-intersecting linear constraints. Math. Program. 149, 253–264 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  7. Chen, J., Burer, S.: Globally solving nonconvex quadratic programming problems via completely positive programming. Math. Program. Comput. 4(1), 33–52 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  8. He, S., Luo, Z.-Q., Nie, J., Zhang, S.: Semidefinite relaxation bounds for indefinite homogeneous quadratic optimization. SIAM J. Optim. 19(2), 503–523 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  9. Hsia, Y., Sheu, R.-L.: Trust region subproblem with a fixed number of additional linear inequality constraints has polynomial complexity. Available at: arXiv:1312.1398

  10. Jeyakumar, V., Li, G.Y.: Trust-Region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization. Math. Program. 147, 171–206 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kim, S., Kojima, M., Toh, K.-C.: A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems. Math. Program. (to appear) (2016)

  12. Locatelli, M.: Some results for quadratic problems with one or two quadratic constraints. Oper. Res. Lett. 43, 126–131 (2015)

    Article  MathSciNet  Google Scholar 

  13. Sturm, J.F., Zhang, S.: On cones of nonnegative quadratic functions. Math. Oper. Res. 28, 246–267 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  14. Ye, Y., Zhang, S.: New results on quadratic minimization. SIAM J. Optim. 14, 245–267 (2003)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

The author is grateful to two anonymous reviewers whose suggestions helped to improve an earlier version of the work.

Author information

Authors and Affiliations

  1. Dipartimento di Ingegneria dell’Informazione, Università di Parma, Via G.P. Usberti, 181/A, 43124, Parma, Italy

    Marco Locatelli

Authors
  1. Marco Locatelli
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marco Locatelli.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Locatelli, M. Exactness conditions for an SDP relaxation of the extended trust region problem. Optim Lett 10, 1141–1151 (2016). https://doi.org/10.1007/s11590-016-1001-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-016-1001-0

Keywords