Pages that link to "Item:Q4012419"

The following pages link to Cones of Matrices and Set-Functions and 0–1 Optimization (Q4012419):

Displaying 50 items.

• Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints (Q3454970) (← links)
• Convex Relaxations for Permutation Problems (Q3456867) (← links)
• Lehman's Theorem and the Directed Steiner Tree Problem (Q3462549) (← links)
• Binary Positive Semidefinite Matrices and Associated Integer Polytopes (Q3503844) (← links)
• Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (Q3539803) (← links)
• Improved Approximation Guarantees through Higher Levels of SDP Hierarchies (Q3541786) (← links)
• Interior Point Methods for Nonlinear Optimization (Q3569506) (← links)
• Resolution Width and Cutting Plane Rank Are Incomparable (Q3599159) (← links)
• A new series of conjectures and open questions in optimization and matrix analysis (Q3628305) (← links)
• On semidefinite bounds for maximization of a non-convex quadratic objective over the<i>l₁</i>unit ball (Q3635701) (← links)
• Matrix cones, projection representations, and stable set polyhedra (Q3973406) (← links)
• Semidefinite relaxation and nonconvex quadratic optimization (Q4391292) (← links)
• Copositive realxation for genera quadratic programming (Q4391294) (← links)
• Mixed linear and semidefinite programming for combinatorial and quadratic optimization (Q4504791) (← links)
• Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets (Q4509736) (← links)
• Communication Lower Bounds via Critical Block Sensitivity (Q4554052) (← links)
• From weak to strong linear programming gaps for all constraint satisfaction problems (Q4568111) (← links)
• The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem (Q4577740) (← links)
• Proof Complexity Meets Algebra (Q4617977) (← links)
• A guide to conic optimisation and its applications (Q4634309) (← links)
• Quadratic knapsack relaxations using cutting planes and semidefinite programming (Q4645922) (← links)
• The cone of flow matrices: Approximation hierarchies and applications (Q4687214) (← links)
• Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem (Q4715798) (← links)
• A Derivation of Lovász' Theta via Augmented Lagrange Duality (Q4809664) (← links)
• Semidefinite relaxation for linear programs with equilibrium constraints (Q4921222) (← links)
• Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs (Q4994984) (← links)
• Superlinear Integrality Gaps for the Minimum Majority Problem (Q5020845) (← links)
• Exploiting low-rank structure in semidefinite programming by approximate operator splitting (Q5034932) (← links)
• Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems (Q5038440) (← links)
• Lifting for Simplicity: Concise Descriptions of Convex Sets (Q5044992) (← links)
• Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
• Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps (Q5076689) (← links)
• Size-degree trade-offs for sums-of-squares and positivstellensatz proofs (Q5091776) (← links)
• Nonlinear formulations and improved randomized approximation algorithms for multicut problems (Q5101403) (← links)
• Combining semidefinite and polyhedral relaxations for integer programs (Q5101410) (← links)
• Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory (Q5135262) (← links)
• BREAKING THE RECTANGLE BOUND BARRIER AGAINST FORMULA SIZE LOWER BOUNDS (Q5168421) (← links)
• Smoothing and Regularization for Mixed-Integer Second-Order Cone Programming with Applications in Portfolio Optimization (Q5172959) (← links)
• A Notion of Total Dual Integrality for Convex, Semidefinite, and Extended Formulations (Q5216778) (← links)
• No Small Linear Program Approximates Vertex Cover Within a Factor 2 − <i>ɛ</i> (Q5219712) (← links)
• Global Registration of Multiple Point Clouds Using Semidefinite Programming (Q5252586) (← links)
• Narrow Proofs May Be Maximally Long (Q5277920) (← links)
• The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454) (← links)
• Cones of multipowers and combinatorial optimization problems (Q5413066) (← links)
• The Complexity of Propositional Proofs (Q5444711) (← links)
• Exact Solution of Two Location Problems via Branch-and-Bound (Q5506728) (← links)
• (Q5708497) (← links)
• (Q5708498) (← links)
• Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems (Q5740224) (← links)
• (Q5743407) (← links)