Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms
From MaRDI portal
Publication:5110560
DOI10.1137/19M1249825zbMath1444.90083arXiv1903.05521OpenAlexW3025795274MaRDI QIDQ5110560
Ambros M. Gleixner, Benjamin Müller, Felipe Serrano
Publication date: 20 May 2020
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.05521
global optimizationprojectionpropagationnonconvexseparationbilinear termsmixed-integer quadratically constrained programs
Related Items
Cutting Plane Generation through Sparse Principal Component Analysis, Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms, A new framework to relax composite functions in nonlinear programs, Implications, conflicts, and reductions for Steiner trees, Convex envelopes for ray-concave functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
- Three enhancements for optimization-based bound tightening
- Enhancing RLT relaxations via a new class of semidefinite cuts
- Lift-and-project for mixed 0-1 programming: recent progress
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- SCIP: solving constraint integer programs
- Projection, lifting and extended formulation integer and combinatorial optimization
- Polarity and the complexity of the shooting experiment
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- Geometric comparison of combinatorial polytopes
- Semidefinite programming relaxation for nonconvex quadratic programs
- A semidefinite programming approach to the quadratic knapsack problem
- Domain reduction techniques for global NLP and MINLP optimization
- Convex envelopes of bivariate functions through the solution of KKT systems
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- A global optimization algorithm for linear fractional and bilinear programs
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- On convex relaxations for quadratically constrained quadratic programming
- For or against structural realism? A verdict from high energy physics
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Symmetry in Mathematical Programming
- Feasibility-Based Bounds Tightening via Fixed Points
- Branching and bounds tighteningtechniques for non-convex MINLP
- Jointly Constrained Biconvex Programming
- The Homotopy Principle and Algorithms for Linear Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Quantifying Double McCormick
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Semidefinite Programming
- Learning and Propagating Lagrangian Variable Bounds for Mixed-Integer Nonlinear Programming
- Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms
- Mixed Integer Programming: Analyzing 12 Years of Progress
- On Polyhedral Approximations of the Second-Order Cone
