Facial structure of copositive and completely positive cones over a second-order cone
Pith reviewed 2026-05-23 04:20 UTC · model grok-4.3
The pith
The faces of copositive and completely positive cones over a second-order cone are classified along with their dimensions and exposedness.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
We classify the faces of copositive and completely positive cones over a second-order cone and investigate their dimension and exposedness properties. Then we compute two parameters related to chains of faces of both cones. At the end, we discuss some possible extensions of the results with a view toward analyzing the facial structure of general copositive and completely positive cones.
What carries the argument
The second-order cone used to construct the lifted copositive and completely positive cones, whose faces are enumerated by type.
If this is right
- Every face belongs to one of a finite number of explicitly described families.
- The dimension of any given face follows directly from its membership in one of those families.
- Exposedness of each face type is settled by the classification.
- Two concrete numerical invariants for maximal chains of faces are obtained for both cones.
Where Pith is reading between the lines
- The explicit list supplies a concrete test case against which future attempts to classify faces of copositive cones over other base cones can be checked.
- Knowledge of the face lattice may simplify the design of cutting-plane or facial-reduction methods that operate on these particular cones.
- The discussion of extensions indicates that the second-order-cone case may serve as a stepping stone toward cones whose base is no longer self-dual.
Load-bearing premise
The algebraic and geometric features of the second-order cone are sufficient to produce an exhaustive list of all faces in the two lifted cones.
What would settle it
An explicit face of the copositive cone over the second-order cone whose dimension or exposedness property fails to match any of the listed types.
read the original abstract
We classify the faces of copositive and completely positive cones over a second-order cone and investigate their dimension and exposedness properties. Then we compute two parameters related to chains of faces of both cones. At the end, we discuss some possible extensions of the results with a view toward analyzing the facial structure of general copositive and completely positive cones.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper classifies the faces of the copositive cone and the completely positive cone over the second-order cone. It determines the dimension and exposedness properties of these faces, computes two parameters related to chains of faces, and discusses possible extensions toward the facial structure of general copositive and completely positive cones.
Significance. If the classification holds, the explicit description of faces, their dimensions, exposedness, and chain parameters for this specific lifted setting supplies a concrete case study that can serve as a benchmark for understanding the geometry of copositive and completely positive cones. Such results are potentially useful for duality theory and facial-reduction techniques in copositive programming, and the explicit treatment of the second-order cone case may help identify patterns for more general cones.
minor comments (2)
- The abstract and introduction would benefit from a brief statement of the main theorems (e.g., the number of face types or the explicit form of the extreme rays) to allow readers to assess the scope of the classification without reading the full proofs.
- Notation for the second-order cone and the lifted copositive/completely positive cones should be introduced once in a dedicated preliminary section and used consistently thereafter.
Simulated Author's Rebuttal
We thank the referee for the positive assessment of the manuscript, the recognition of its potential utility for duality and facial reduction, and the recommendation of minor revision. No major comments appear in the report.
Circularity Check
No significant circularity
full rationale
The paper performs a classification of faces for the copositive and completely positive cones over the second-order cone, together with dimension, exposedness, and chain parameters. This rests on the standard lifted definitions of copositivity and complete positivity combined with the algebraic structure of the SOC; the abstract and scope description contain no equations, fitted parameters, or self-citations that reduce any claimed result to its own inputs by construction. The work is self-contained against external benchmarks in convex cone theory and explicitly flags extensions rather than claiming generality, so the derivation chain does not exhibit circularity.
Axiom & Free-Parameter Ledger
Forward citations
Cited by 2 Pith papers
-
Copositive Matrices with Ordered Off-Diagonal Entries
Copositive matrices with nondecreasing off-diagonal entries admit a PSD plus nonnegative decomposition, which implies exactness of a natural relaxation for separable quadratic optimization over the simplex.
-
Inexact subgradient algorithm with a non-asymptotic convergence guarantee for copositive programming problems
An inexact subgradient algorithm achieves O(ε^{-2}) iteration complexity for ε-accurate solutions to copositive programs while allowing inexact solves of NP-hard quadratic subproblems and providing a sufficient condit...
Reference graph
Works this paper leans on
-
[1]
L. Bai, J.E. Mitchell, and J.-S. Pang. On conic QPCCs, conic QCQPs and completely positive programs. Math. Program. , 159(1–2):109–136, 2016. doi:10.1007/s10107-015-0951-9
-
[2]
G.P. Barker and D.H. Carlson. Cones of diagonally dominant matrice s. Pac. J. Math., 57(1):15–32, 1975. doi:10.2140/pjm.1975.57.15
- [3]
-
[4]
I.M. Bomze, M. D¨ ur, E. de Klerk, C. Roos, A.J. Quist, and T. Terla ky. On copositive programming and standard quadratic optimization proble ms. J. Glob. Optim., 18(4):301–320, 2000. doi:10.1023/A:1026583532263
-
[5]
J. Borwein and H. Wolkowicz. Regularizing the abstract convex pr ogram. J. Math. Anal. Appl. , 83(2):495–530, 1981. doi:10.1016/0022-247X(81)90138-4
-
[6]
S. Burer. On the copositive representation of binary and contin uous nonconvex quadratic programs. Math. Program. , 120(2):479–495, 2009. doi:10.1007/s10107-008-0223-z
-
[7]
S. Burer. Copositive programming. In M.F. Anjos and J.B. Lasser re, editors, Handbook on Semidefinite, Conic and Polynomial Optimizatio n, pages 201–218. Springer, New York, NY, 2012. doi:10.1007/978-1-4614-0769-0_8
-
[8]
S. Burer and H. Dong. Representing quadratically constrained q uadratic pro- grams as generalized copositive programs. Oper. Res. Lett. , 40(3):203–206, 2012. doi:10.1016/j.orl.2012.02.001
-
[9]
P.H. Diananda. On a conjecture of L. J. Mordell regarding an ineq ual- ity involving quadratic forms. J. Lond. Math. Soc. , s1-36(1):185–192, 1961. doi:10.1112/jlms/s1-36.1.185
-
[10]
P.J.C. Dickinson. Geometry of the copositive and completely posit ive cones. J. Math. Anal. Appl. , 380(1):377–395, 2011. doi:10.1016/j.jmaa.2011.03.005. 37
- [11]
-
[12]
L.E. Dubins. On extreme points of convex sets. J. Math. Anal. Appl. , 5(2):237–244,
-
[13]
doi:10.1016/S0022-247X(62)80007-9
-
[14]
G. Ewald. Combinatorial Convexity and Algebraic Geometry . Springer, New York, NY, 1996. doi:10.1007/978-1-4612-4044-0
-
[15]
J. Faraut and A. Kor´ anyi.Analysis on Symmetric Cones . Clarendon Press, Oxford, UK, 1994
work page 1994
-
[16]
L. Faybusovich. Jordan-algebraic approach to convexity the orems for quadratic mappings. SIAM J. Optim. , 17(2):558–576, 2006. doi:10.1137/050635560
-
[17]
M.S. Gowda. Weighted LCPs and interior point systems for copos itive linear transformations on Euclidean Jordan algebras. J. Glob. Optim. , 74(2):285–295,
-
[18]
doi:10.1007/s10898-019-00760-7
-
[19]
M.S. Gowda and R. Sznajder. Automorphism invariance of P- and GUS-properties of linear transformations on Euclidean Jordan algebras. Math. Oper. Res. , 31(1):109–123, 2006. doi:10.1287/moor.1050.0182
-
[20]
M.S. Gowda, R. Sznajder, and J. Tao. The automorphism group of a completely positive cone and its Lie algebra. Linear Algebra Appl. , 438(10):3862–3871, 2013. doi:10.1016/j.laa.2011.10.006
-
[21]
J.-B. Hiriart-Urruty and J. Malick. A fresh variational-analysis lo ok at the pos- itive semidefinite matrices world. J. Optim. Theory Appl. , 153(3):551–577, 2012. doi:10.1007/s10957-011-9980-6
-
[22]
R.A. Horn and C.R. Johnson. Matrix Analysis . Cambridge University Press, New York, NY, second edition, 2013. doi:10.1017/CBO9781139020411
-
[23]
M. Ito and B.F. Louren¸ co. A bound on the Carath´ eodory number. Linear Algebra Appl., 532:347–363, 2017. doi:10.1016/j.laa.2017.06.043
-
[24]
B. Korte and J. Vygen. Combinatorial Optimization: Theory and Al- gorithms. Springer, Berlin, Heidelberg, Germany, sixth edition, 2018. doi:10.1007/978-3-662-56039-6
-
[25]
A.S. Lewis. Eigenvalue-constrained faces. Linear Algebra Appl., 269(1–3):159–181,
-
[26]
doi:10.1016/S0024-3795(97)81515-7 . 38
-
[27]
B.F. Louren¸ co, M. Muramatsu, and T. Tsuchiya. Facial reduc tion and partial polyhedrality. SIAM J. Optim. , 28(3):2304–2326, 2018. doi:10.1137/15M1051634
-
[28]
B.F. Louren¸ co and A. Takeda. Generalized subdifferentials of s pectral func- tions over Euclidean Jordan algebras. SIAM J. Optim. , 30(4):3387–3414, 2020. doi:10.1137/19M1245001
-
[29]
M. Nishijima. On the longest chain of faces of the completely pos- itive and copositive cones. Linear Algebra Appl. , 698:479–491, 2024. doi:10.1016/j.laa.2024.06.012
-
[30]
M. Nishijima and B.F. Louren¸ co. Non-facial exposedness of co positive cones over symmetric cones. J. Math. Anal. Appl. , 545(2):129166, 2025. doi:10.1016/j.jmaa.2024.129166
-
[31]
M. Nishijima and K. Nakata. Approximation hierarchies for copos itive cone over symmetric cone and their comparison. J. Glob. Optim. , 88(4):831–870, 2024. doi:10.1007/s10898-023-01319-3
-
[32]
M. Nishijima and K. Nakata. Generalizations of doubly nonnegativ e cones and their comparison. J. Oper. Res. Soc. Jpn. , 67(3):84–109, 2024. doi:10.15807/jorsj.67.84
- [33]
-
[34]
doi:10.1007/s10898-020-00960-6
-
[35]
G. Pataki. The geometry of semidefinite programming. In H. Wolk owicz, R. Saigal, and L. Vandenberghe, editors, Handbook of Semidefinite Programming: Theory, Algorithms, and Applications , pages 29–65. Kluwer Academic Publishers, Norwell, MA, 2000. doi:10.1007/978-1-4615-4381-7_3
-
[36]
I. P´ olic and T. Terlaky. A survey of the S-lemma. SIAM Rev. , 49(3):371–418,
-
[37]
doi:10.1137/S003614450444614X
-
[38]
R.T. Rockafellar. Convex Analysis . Princeton University Press, Princeton, NJ, 1970
work page 1970
-
[39]
V. Roshchina, T. Sang, and D. Yost. Compact convex sets with prescribed fa- cial dimensions. In D.R. Wood, J. de Gier, C.E. Praeger, and T. Tao, e di- tors, 2016 MATRIX Annals , pages 167–175. Springer, Cham, Switzerland, 2018. doi:10.1007/978-3-319-72299-3_7
-
[40]
I. Satake. Linear Algebra. Macel Dekker, New York, NY, 1975. 39
work page 1975
-
[41]
N. Shaked-Monderer and A. Berman. Copositive and Completely Positive Matrices . World Scientific, Singapore, 2021. doi:10.1142/11386
-
[42]
V. Soltan. Lectures on Convex Sets . World Scientific, Singapore, second edition,
-
[43]
J.F. Sturm and S. Zhang. On cones of nonnegative quadratic fu nctions. Math. Oper. Res., 28(2):246–267, 2003. doi:10.1287/moor.28.2.246.14485
-
[44]
B.-S. Tam. A note on polyhedral cones. J. Aust. Math. Soc. , 22(4):456–461, 1976. doi:10.1017/S1446788700016311
- [45]
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.