method · first seen 12 Oct 2026
convex relaxation
Replacing a nonconvex optimization problem with a convex surrogate that provides valid bounds on the optimum.
Mentions per week
PapersCodeDiscussion
Earliest sources
- Learning to Design Convex Relaxations for Nonconvex OptimizationPapers · 12 Oct 2026 · Jinrun Liu, Bai Yan, Tengfei Liu, Qunfeng Liu, Jian Yang, Shi Cheng, Yuhui Shi,…
- PnP*: A certifiable solver for Perspective-n-PointPapers · 22 Oct 2026 · Bang-Shien Chen, Caitrin E. Eaton, David M. Rosen
- A Convex-Analytic Reformulation for Poisoning Attacks on Logistic RegressionPapers · 12 Nov 2026 · Carina Moreira Costa, Maria Eduarda Pinheiro, Martin Schmidt
- Relax-and-Sparsify Approximation Algorithms for Sparse Ridge RegressionPapers · 15 Nov 2026 · Shixuan Yi, Yongchun Li
Latest sources
- Relax-and-Sparsify Approximation Algorithms for Sparse Ridge RegressionPapers · 15 Nov 2026 · Shixuan Yi, Yongchun Li
- A Convex-Analytic Reformulation for Poisoning Attacks on Logistic RegressionPapers · 12 Nov 2026 · Carina Moreira Costa, Maria Eduarda Pinheiro, Martin Schmidt
- PnP*: A certifiable solver for Perspective-n-PointPapers · 22 Oct 2026 · Bang-Shien Chen, Caitrin E. Eaton, David M. Rosen
- Learning to Design Convex Relaxations for Nonconvex OptimizationPapers · 12 Oct 2026 · Jinrun Liu, Bai Yan, Tengfei Liu, Qunfeng Liu, Jian Yang, Shi Cheng, Yuhui Shi,…