method · first seen 12 Oct 2026
McCormick relaxation
A linear relaxation technique that bounds bilinear terms by convex and concave envelopes over variable bounds.
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,…
Latest 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,…