Unbounded convex sets for non-convex mixed-integer quadratic programming

DOI10.1007/S10107-012-0609-9zbMATH Open1291.90146OpenAlexW2123914477WikidataQ57702145 ScholiaQ57702145MaRDI QIDQ2436643FDOQ2436643

Authors: Samuel Burer, Adam N. Letchford 

Publication date: 25 February 2014

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-012-0609-9

Recommendations

• Integer quadratic quasi-polyhedra
• On nonconvex quadratic programming with box constraints
• Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
• Convex hull of two quadratic or a conic quadratic and a quadratic inequality
• Mixed-integer convex representability

zbMATH Keywords

convex analysispolyhedral combinatoricsglobal optimisationmixed-integer non-linear programming

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Mixed integer programming (90C11)

Cites Work

• Some NP-complete problems in quadratic and nonlinear programming
• Title not available (Why is that?)
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs
• Title not available (Why is that?)
• Cones of Matrices and Set-Functions and 0–1 Optimization
• On Cones of Nonnegative Quadratic Functions
• Geometry of cuts and metrics
• On the Matrix Equation X′X = A
• Title not available (Why is that?)
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• On the computational complexity of membership problems for the completely positive cone and its dual
• Title not available (Why is that?)
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• Review of nonlinear mixed-integer and disjunctive programming techniques
• Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
• On the cone of positive semidefinite matrices
• Computable representations for convex hulls of low-dimensional quadratic forms
• Chvátal closures for mixed integer programming problems
• A study of the quadratic semi-assignment polytope
• A semidefinite programming approach to the quadratic knapsack problem
• Semidefinite programming relaxation for nonconvex quadratic programs
• A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
• Title not available (Why is that?)
• SDP relaxations in combinatorial optimization from a Lagrangian viewpoint.
• On nonconvex quadratic programming with box constraints
• Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions
• Integer quadratic quasi-polyhedra
• Minimal requirements for Minkowski's theorem in the plane I
• Gap inequalities for non-convex mixed-integer quadratic programs
• A polyhedral approach for nonconvex quadratic programming problems with box constraints
• Title not available (Why is that?)
• Integer optimization on convex semialgebraic sets
• Title not available (Why is that?)
• Box-inequalities for quadratic assignment polytopes
• Polyhedra related to integer-convex polynomial systems

Cited In (12)

• A note on representations of linear inequalities in non-convex mixed-integer quadratic programs
• Valid inequalities for quadratic optimisation with domain constraints
• Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
• Convex hull of two quadratic or a conic quadratic and a quadratic inequality
• Integer quadratic quasi-polyhedra
• Quadratic programs with hollows
• Model development and optimization for space engineering: concepts, tools, applications, and perspectives
• Robust combinatorial optimization with variable budgeted uncertainty
• On the separation of split inequalities for non-convex quadratic integer programming
• Irreducible infeasible sets in convex mixed-integer programs
• Closedness of integer hulls of simple conic sets
• Convex hull results on quadratic programs with non-intersecting constraints

This page was built for publication: Unbounded convex sets for non-convex mixed-integer quadratic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2436643)