Computing critical angles between two convex cones

DOI10.1007/S10957-024-02424-3MaRDI QIDQ6453188zbMATH OpenFDO

Authors Welington de Oliveira, Valentina Sessa, David Sossa

Publication date 29 September 2023

Full work available at URL https://doi.org/10.1007/S10957-024-02424-3

Mathematics Subject Classification ID

Jordan algebras (algebras, triples and pairs) (17C99) Inequalities and extremum problems involving convexity in convex geometry (52A40) Numerical analysis (65-XX) Computer science (68-XX) Nonconvex programming, global optimization (90C26) Fractional programming (90C32) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• Critical angles in polyhedral convex cones: Numerical and statistical considerations
• Critical angles between two convex cones. I: General theory
• Critical angles between two convex cones. II: Special cases
• An active index algorithm for the nearest point problem in a polyhedral cone
• Numerical resolution of cone-constrained eigenvalue problems

Cited in

(2)

• Computing the least cone-constrained singular value of matrices
• Measuring dissimilarity between convex cones by means of max-min angles

This page was built for publication: Computing critical angles between two convex cones

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6453188)