IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v79y2021i4d10.1007_s10898-020-00960-6.html
   My bibliography  Save this article

Gaddum’s test for symmetric cones

Author

Listed:
  • Michael Orlitzky

    (Towson University)

Abstract

A real symmetric matrix A is copositive if $$\left\langle {Ax},{x}\right\rangle \ge 0$$ Ax , x ≥ 0 for all x in the nonnegative orthant. Copositive programming gained fame when Burer showed that hard nonconvex problems can be formulated as completely-positive programs. Alas, the power of copositive programming is offset by its difficulty: simple questions like “is this matrix copositive?” have complicated answers. In 1958, Jerry Gaddum proposed a recursive procedure to check if a given matrix is copositive by solving a series of matrix games. It is easy to implement and conceptually simple. Copositivity generalizes to cones other than the nonnegative orthant. If K is a proper cone, then the linear operator L is copositive on K if $$\left\langle {L \left( {x}\right) },{x}\right\rangle \ge 0$$ L x , x ≥ 0 for all x in K. Little is known about these operators in general. We extend Gaddum’s test to self-dual and symmetric cones, thereby deducing criteria for copositivity in those settings.

Suggested Citation

  • Michael Orlitzky, 2021. "Gaddum’s test for symmetric cones," Journal of Global Optimization, Springer, vol. 79(4), pages 927-940, April.
    • Handle: RePEc:spr:jglopt:v:79:y:2021:i:4:d:10.1007_s10898-020-00960-6
    DOI: 10.1007/s10898-020-00960-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-020-00960-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-020-00960-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. de Klerk, E. & Pasechnik, D.V. & Sotirov, R., 2008. "On Semidefinite Programming Relaxations of the Traveling Salesman Problem (revision of DP 2007-101)," Other publications TiSEM ea23cd70-a3b1-401a-aa3f-0, Tilburg University, School of Economics and Management.
    2. M. Seetharama Gowda & Roman Sznajder, 2006. "Automorphism Invariance of P - and GUS -Properties of Linear Transformations on Euclidean Jordan Algebras," Mathematics of Operations Research, INFORMS, vol. 31(1), pages 109-123, February.
    3. Yu. E. Nesterov & M. J. Todd, 1997. "Self-Scaled Barriers and Interior-Point Methods for Convex Programming," Mathematics of Operations Research, INFORMS, vol. 22(1), pages 1-42, February.
    4. Alfredo Iusem & Felipe Lara, 2019. "Existence Results for Noncoercive Mixed Variational Inequalities in Finite Dimensional Spaces," Journal of Optimization Theory and Applications, Springer, vol. 183(1), pages 122-138, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Sungwoo Park & Dianne P. O’Leary, 2015. "A Polynomial Time Constraint-Reduced Algorithm for Semidefinite Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 166(2), pages 558-571, August.
    2. Chee-Khian Sim, 2019. "Interior point method on semi-definite linear complementarity problems using the Nesterov–Todd (NT) search direction: polynomial complexity and local convergence," Computational Optimization and Applications, Springer, vol. 74(2), pages 583-621, November.
    3. Sturm, J.F., 2001. "Avoiding Numerical Cancellation in the Interior Point Method for Solving Semidefinite Programs," Other publications TiSEM 949fb20a-a2c6-4d87-85ea-8, Tilburg University, School of Economics and Management.
    4. Robert Chares & François Glineur, 2008. "An interior-point method for the single-facility location problem with mixed norms using a conic formulation," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 68(3), pages 383-405, December.
    5. Terlaky, Tamas, 2001. "An easy way to teach interior-point methods," European Journal of Operational Research, Elsevier, vol. 130(1), pages 1-19, April.
    6. J.-S. Chen, 2007. "Conditions for Error Bounds and Bounded Level Sets of Some Merit Functions for the Second-Order Cone Complementarity Problem," Journal of Optimization Theory and Applications, Springer, vol. 135(3), pages 459-473, December.
    7. Lingchen Kong & Levent Tunçel & Naihua Xiu, 2012. "Existence and Uniqueness of Solutions for Homogeneous Cone Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 153(2), pages 357-376, May.
    8. B.V. Halldórsson & R.H. Tütüncü, 2003. "An Interior-Point Method for a Class of Saddle-Point Problems," Journal of Optimization Theory and Applications, Springer, vol. 116(3), pages 559-590, March.
    9. G. Q. Wang & Y. Q. Bai, 2012. "A New Full Nesterov–Todd Step Primal–Dual Path-Following Interior-Point Algorithm for Symmetric Optimization," Journal of Optimization Theory and Applications, Springer, vol. 154(3), pages 966-985, September.
    10. G. Q. Wang & L. C. Kong & J. Y. Tao & G. Lesaja, 2015. "Improved Complexity Analysis of Full Nesterov–Todd Step Feasible Interior-Point Method for Symmetric Optimization," Journal of Optimization Theory and Applications, Springer, vol. 166(2), pages 588-604, August.
    11. E. A. Yıldırım, 2003. "An Interior-Point Perspective on Sensitivity Analysis in Semidefinite Programming," Mathematics of Operations Research, INFORMS, vol. 28(4), pages 649-676, November.
    12. Xiao-Kang Wang & Wen-Hui Hou & Chao Song & Min-Hui Deng & Yong-Yi Li & Jian-Qiang Wang, 2021. "BW-MaxEnt: A Novel MCDM Method for Limited Knowledge," Mathematics, MDPI, vol. 9(14), pages 1-17, July.
    13. A. Iusem & F. Lara, 2022. "Proximal Point Algorithms for Quasiconvex Pseudomonotone Equilibrium Problems," Journal of Optimization Theory and Applications, Springer, vol. 193(1), pages 443-461, June.
    14. Héctor Ramírez & David Sossa, 2017. "On the Central Paths in Symmetric Cone Programming," Journal of Optimization Theory and Applications, Springer, vol. 172(2), pages 649-668, February.
    15. Vasile L. Basescu & John E. Mitchell, 2008. "An Analytic Center Cutting Plane Approach for Conic Programming," Mathematics of Operations Research, INFORMS, vol. 33(3), pages 529-551, August.
    16. Wei Hong Yang & Lei-Hong Zhang & Chungen Shen, 2017. "On the Range of the Pseudomonotone Second-Order Cone Linear Complementarity Problem," Journal of Optimization Theory and Applications, Springer, vol. 173(2), pages 504-522, May.
    17. Ximei Yang & Hongwei Liu & Yinkui Zhang, 2015. "A New Strategy in the Complexity Analysis of an Infeasible-Interior-Point Method for Symmetric Cone Programming," Journal of Optimization Theory and Applications, Springer, vol. 166(2), pages 572-587, August.
    18. G. Q. Wang & Y. Q. Bai & X. Y. Gao & D. Z. Wang, 2015. "Improved Complexity Analysis of Full Nesterov–Todd Step Interior-Point Methods for Semidefinite Optimization," Journal of Optimization Theory and Applications, Springer, vol. 165(1), pages 242-262, April.
    19. J. Tao, 2009. "Positive Principal Minor Property of Linear Transformations on Euclidean Jordan Algebras," Journal of Optimization Theory and Applications, Springer, vol. 140(1), pages 131-152, January.
    20. Chinedu Izuchukwu & Yekini Shehu & Chibueze C. Okeke, 2023. "Extension of forward-reflected-backward method to non-convex mixed variational inequalities," Journal of Global Optimization, Springer, vol. 86(1), pages 123-140, May.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:79:y:2021:i:4:d:10.1007_s10898-020-00960-6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.