[CVPR 2025 Best Paper Award Candidate & Oral] Convex Relaxation for Robust Vanishing Point Estimation in Manhattan World
-
Updated
Apr 18, 2026 - Python
[CVPR 2025 Best Paper Award Candidate & Oral] Convex Relaxation for Robust Vanishing Point Estimation in Manhattan World
A curated survey and paper list for global solvers in 3D vision: certifiable optimization, convex relaxation, Branch-and-Bound, and robust estimation.
[ECCV 2024] GlobalPointer: Large-Scale Plane Adjustment with Bi-Convex Relaxation
MCPy is a python library for McCormick relaxations with sub-gradients. This is quite useful for prototyping and testing new convex relaxation and global optimization algorithms.
A header-only C++ library for solving Sparse Modeling Problems via Biconjugate Convex Relaxation Techniques.
Sound neural-network robustness verifier based on DeepPoly abstract interpretation, back-substitution + learnable ReLU (α) bounds certify L∞ adversarial robustness on MNIST/CIFAR-10 classifiers.
Implementation in Julia of a method by Cao and Khan (2023) for constructing convex relaxations of implicit/inverse functions.
To associate your repository with the convex-relaxation topic, visit your repo's landing page and select "manage topics."