No article text was recorded for this version.
relaxation tightness-efficiency tradeoff
Version 1 of 132 papers44 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Alternative SDP and SOCP approximations for polynomial optimization
- Blog: Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming
- Blog: Compact MILP Formulations for the p-Center Problem
- Blog: On partial optimality in multi-label MRFs
- Blog: An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials
- Blog: The Probable Value of the Lovász--Schrijver Relaxations for Maximum Independent Set
- Blog: Convex Structure Learning for Bayesian Networks: Polynomial Feature Selection and Approximate Ordering
- Blog: DisjunctiveProgramming.jl: Generalized Disjunctive Programming Models and Algorithms for JuMP
- Blog: Between steps: Intermediate relaxations between big-M and convex hull formulations
- Blog: Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
- Blog: Efficient Continuous Relaxations for Dense CRF
- Blog: Tight convex relaxations for vector-valued labeling problems
- Blog: Approximation Algorithms for Submodular Multiway Partition
- Blog: Exponential Convergence of Sum-of-Squares Hierarchies for Trigonometric Polynomials
- Blog: DS++: A flexible, scalable and provably tight relaxation for matching problems
- Blog: An Analysis of Convex Relaxations for MAP Estimation
- Blog: SDP Relaxation with Randomized Rounding for Energy Disaggregation
- Blog: P-split formulations: a class of intermediate formulations between big-M and convex hull for disjunctive constraints
- Blog: Distance to the nearest stable Metzler matrix
- Blog: Convergence and Energy Landscape for Cheeger Cut Clustering
- Blog: Hybrid Methods in Solving Alternating-Current Optimal Power Flows
- Blog: The QC Relaxation: A Theoretical and Computational Study on Optimal Power Flow
- Blog: Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems
- Blog: A Convex Relaxation of the Ambrosio-Tortorelli Elliptic Functionals for the Mumford-Shah Functional
- Blog: Sparse sum-of-squares (SOS) optimization: A bridge between DSOS/SDSOS and SOS optimization for sparse polynomials
- Blog: Towards an SDP-based Approach to Spectral Methods: A Nearly-Linear-Time Algorithm for Graph Partitioning and Decomposition
- Blog: The Convex Hull of a Quadratic Constraint over a Polytope
- Blog: Multiple-Instance Learning via Disjunctive Programming Boosting
- Blog: Strong SOCP Relaxations for the Optimal Power Flow Problem
- Blog: Position-Indexed Formulations for Kidney Exchange
- Blog: Constrained fractional set programs and their application in local clustering and community detection
- Blog: Two lagrangian relaxation based heuristics for vertex coloring problem
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_relaxation_tightness_efficiency_tradeoff_72249503,
title = {relaxation tightness-efficiency tradeoff},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/relaxation-tightness-efficiency-tradeoff/rdr_722495031cd241d9bfcf254ebacbf1eb},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_relaxation_tightness_efficiency_tradeoff_72249503_v1,
title = {relaxation tightness-efficiency tradeoff},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/relaxation-tightness-efficiency-tradeoff/rdr_722495031cd241d9bfcf254ebacbf1eb/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}