Real roots of real cubics and optimization
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:LIOV2PSWrecord.jsonopen to challenge →
read the original abstract
The solution of the cubic equation has a century-long history; however, the usual presentation is geared towards applications in algebra and is somewhat inconvenient to use in optimization where frequently the main interest lies in real roots. In this note, we present the roots of the cubic in a form that makes them convenient to use and we also focus on information on the location of the real roots. Armed with this, we provide several applications in optimization where we compute Fenchel conjugates, proximal mappings and projections.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery
Introduces deep-unfolded LOP-l2/l1 networks using implicit differentiation and deep weight factorization for data-driven block-sparse recovery with resilience to impulsive noise.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.