Skip to main content
SpringerLink
Log in

Copositive Optimization and Its Applications in Graph Theory

  • Conference paper
  • First Online:
Optimization, Variational Analysis and Applications (IFSOVAA 2020)

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 355))

  • 632 Accesses

Abstract

Recently, copositive optimization has received a lot of attention to the Operational Research community, and it is rapidly expanding and becoming a fertile field of research. In this chapter, we demonstrate the diversity of copositive formulations in different domains of optimization: continuous, discrete, and stochastic optimization problems. Further, we discuss the role of copositivity for local and global optimality conditions. Finally, we talk about some applications of copositive optimization in graph theory and game theory.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 199.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Amaral, P.A., Bomze, I.M., Júdice, J.: Copositivity and constrained fractional quadratic problems. J. Math. Program. 146, 325–350 (2014)

    Google Scholar 

  2. Bomze, I.M.: Copositive optimization - recent developments and applications. Eur. J. Oper. Res. 216, 509–520 (2012)

    Article  MathSciNet  Google Scholar 

  3. Bomze, I.M.: On standard quadratic optimization problems. J. Global Optim. 13(4), 369–387 (1998)

    Article  MathSciNet  Google Scholar 

  4. Bomze, I.M., Dür, M., de Klerk, E., Roos, C., Quist, A.J., Terlaky, T.: On copositive programming and standard quadratic optimization problems. J. Global Optim. 18, 301–320 (2000)

    Article  MathSciNet  Google Scholar 

  5. Bapat, R.B., Neogy, S.K.: On a quadratic programming problem involving distances in trees. Ann. Oper. Res. 243, 365–373 (2016)

    Article  MathSciNet  Google Scholar 

  6. Burer, S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Program. 120, 479–495 (2009)

    Article  MathSciNet  Google Scholar 

  7. Burer, S.: Copositive programming. In: Anjos, M.F., Lasserre, J.B. (eds.) Handbook of Semidefinite, Cone and Polynomial Optimization: Theory, Algorithms, Software and Applications, International Series in Operations Research and Management Science. Springer, New York (2012)

    Google Scholar 

  8. Bundfuss, S., D\(\ddot{{\rm u}}\)r, M.: An adaptive linear approximation algorithm for copositive programs. SIAM J. Opt. 20, 30–53 (2009)

    Google Scholar 

  9. Crouzeix, J.-P., Hassouni, A., Lahlou, A., Schaible, S.: Positive subdefinite matrices, generalized monotonicity and linear complementarity problems. SIAM J. Matrix Anal. Appl. 22, 66–85 (2000)

    Article  MathSciNet  Google Scholar 

  10. Crouzeix, J.-P., Komlósi, S.: The linear complementarity problem and the class of generalized positive subdefinite matrices. Optimization Theory (Matrahaza, 1999), Applied Optimization 59. Kluwer Academic Publisher, Dordrecht, pp. 45–63 (2001)

    Google Scholar 

  11. Dankelmann, P.: Average distance in weighted graphs. Discrete Math. 312, 12–20 (2012)

    Article  MathSciNet  Google Scholar 

  12. Dubey, D., Neogy, S.K.: On solving a non-convex quadratic programming problem involving resistance distances in graphs. Ann. O.R. 287, 643–651 (2020)

    Google Scholar 

  13. Eichfelder, G., Povh, J.: On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets. Optim. Lett. 7, 1373–1386 (2013)

    Article  MathSciNet  Google Scholar 

  14. Granot, F., Skorin-Kapov, J.: Towards a strongly polynomial algorithm for strictly convex quadratic programs: an extension of Tardos’ algorithm. Math. Program. 46, 225–236 (1990)

    Article  MathSciNet  Google Scholar 

  15. Kojima, M., Mizuno, S., Yoshise, A.: A polynomial-time algorithm for a class of linear complementarity problems. Math. Program. 44, 1–26 (1989)

    Article  MathSciNet  Google Scholar 

  16. Mohan, S.R., Neogy, S.K., Das, A.K.: More on positive subdefinite matrices and the linear complementarity problem. Linear Algebra Appl. 338, 275–285 (2001)

    Article  MathSciNet  Google Scholar 

  17. Nguyen, D.V.: Completely positive and copositive program modelling for quadratic optimization problems. Optimization, https://doi.org/10.1080/02331934.2020.1712392

Download references

Acknowledgements

The authors would like to thank the anonymous referees for their constructive suggestions which considerably improve the overall presentation of the chapter.

Author information

Authors and Affiliations

  1. Indian Statistical Institute, 7, S.J.S Sansanwal Marg, New Delhi, 110016, India

    S. K. Neogy & Vatsalkumar N. Mer

Authors
  1. S. K. Neogy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vatsalkumar N. Mer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. K. Neogy .

Editor information

Editors and Affiliations

  1. Institute of Science, Banaras Hindu University, Varanasi, Uttar Pradesh, India

    Vivek Laha

  2. Institut de Mathématiques de Toulouse, Paul Sabatier University, Toulouse, France

    Pierre Maréchal

  3. Institute of Science, Banaras Hindu University, Varanasi, Uttar Pradesh, India

    S. K. Mishra

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Neogy, S.K., Mer, V.N. (2021). Copositive Optimization and Its Applications in Graph Theory. In: Laha, V., Maréchal, P., Mishra, S.K. (eds) Optimization, Variational Analysis and Applications. IFSOVAA 2020. Springer Proceedings in Mathematics & Statistics, vol 355. Springer, Singapore. https://doi.org/10.1007/978-981-16-1819-2_4

Download citation

Publish with us

Policies and ethics

Search

Navigation