Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations

No abstract is available for this paper.

• Publication year

  2011

• Venue

  Mathematical programming

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s10107-010-0340-3
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• MIP reformulations of the probabilistic set covering problem

  2010cited by this paper
• Branching and bounds tighteningtechniques for non-convex MINLP

  2009cited by this paper
• FilMINT: An Outer-Approximation-Based Solver for Nonlinear Mixed Integer Programs

  2008cited by this paper
• A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs

  2008cited by this paper
• Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs

  2008cited by this paper
• A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations

  2007cited by this paper
• A polyhedral study of nonconvex quadratic programs with box constraints

  2005cited by this paper
• A branch-and-cut algorithm for nonconvex quadratic programs with box constraints

  2005influential reference
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization

  2003cited by this paper
• A global optimization algorithm for nonconvex generalized disjunctive programming and applications to process systems

  2001cited by this paper
• On Polyhedral Approximations of the Second-Order Cone

  2001cited by this paper
• Second order cone programming relaxation of nonconvex quadratic optimization problems

  2001cited by this paper
• Projection and Lifting in Combinatorial Optimization

  2000cited by this paper
• A branch-and-cut method for 0-1 mixed convex programming

  1999cited by this paper
• Disjunctive Programming: Properties of the Convex Hull of Feasible Points

  1998influential reference
• A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems

  1998cited by this paper
• NP-hardness of linear multiplicative programming and related problems

  1996cited by this paper
• The Homotopy Principle and Algorithms for Linear Programming

  1991cited by this paper
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems

  1976cited by this paper

• Multiphase Iterative Algorithm for Mixed-Integer Optimal Control

  2025cites this paper
• Solving Sparse MIQCQPs: Application to the Unit Commitment Problem with ACOPF Constraints

  2025cites this paper
• Constructing Optimal Piecewise Quadratic Approximations for Enhancing Deterministic Global Optimization

  2025cites this paper
• Using quadratic cuts to iteratively strengthen convexifications of box quadratic programs

  2025cites this paper
• Branch-and-Price for Prescriptive Contagion Analytics

  2024cites this paper
• A Disjunctive Cutting Plane Algorithm for Bilinear Programming

  2024cites this paper
• A Global Solution Algorithm for AC Optimal Power Flow through Linear Constrained Quadratic Programming

  2024cites this paper
• Submodular maximization and its generalization through an intersection cut lens

  2023cites this paper
• An effective global algorithm for worst-case linear optimization under polyhedral uncertainty

  2023cites this paper
• A new global algorithm for factor-risk-constrained mean-variance portfolio selection

  2022cites this paper
• Partial Lasserre relaxation for sparse Max-Cut

  2022cites this paper
• Compact mixed-integer programming formulations in quadratic optimization

  2022cites this paper
• On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs

  2022cites this paper
• A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation

  2021cites this paper
• Convexification of bilinear forms through non-symmetric lifting

  2021cites this paper
• SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs

  2021cites this paper
• An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation

  2021cites this paper
• SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs

  2021cites this paper
• Load Control Problems in Direct Current Distribution Networks: Optimality, Equilibrium of Games

  2020cites this paper
• Handling Separable Non-convexities Using Disjunctive Cuts

  2020cites this paper
• Combinatorial Optimization: 6th International Symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020, Revised Selected Papers

  2020influential citation
• A Finitely Convergent Disjunctive Cutting Plane Algorithm for Bilinear Programming

  2020cites this paper
• Sequential Convexification of a Bilinear Set

  2020cites this paper
• A Global Optimization Algorithm for Solving Indefinite Quadratic Programming

  2020cites this paper
• Effective algorithms for optimal portfolio deleveraging problem with cross impact

  2020cites this paper
• Compact mixed-integer programming relaxations in quadratic optimization

  2020cites this paper
• Global solution of non-convex quadratically constrained quadratic programs

  2019cites this paper
• Intersection Disjunctions for Reverse Convex Sets

  2019cites this paper
• Scoring positive semidefinite cutting planes for quadratic optimization via trained neural networks

  2019influential citation
• Intersection Cuts for Polynomial Optimization

  2019cites this paper
• Enhancing Semidefinite Relaxation for Quadratically Constrained Quadratic Programming via Penalty Methods

  2018cites this paper
• Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint

  2018cites this paper
• Global optimization of MIQCPs with dynamic piecewise relaxations

  2018cites this paper
• Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods

  2018cites this paper
• Demand Side Management in Direct Current Distribution Networks: Convergence and Optimality

  2018cites this paper
• Efficient treatment of bilinear forms in global optimization

  2018cites this paper
• A Complementary Cutting Plane Approach for Nonconvex Quadratically Constrained Quadratic Programs

  2018cites this paper
• A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming

  2018cites this paper
• New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation

  2018cites this paper
• Intersection Cuts for Factorable MINLP

  2018cites this paper
• A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems

  2018influential citation
• Selecting cutting planes for quadratic semidefinite outer-approximation via trained neural networks

  2018influential citation
• Extensions on ellipsoid bounds for quadratic integer programming

  2018cites this paper
• Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem

  2018cites this paper
• Extensions on ellipsoid bounds for quadratic integer programming

  2017cites this paper
• Conic approximation to quadratic optimization with linear complementarity constraints

  2017cites this paper
• Enhancing convexification techniques for solving nonconvex quadratic programming problems

  2017cites this paper
• Integer programming techniques for Polynomial Optimization

  2017cites this paper
• Extensão de limites elipsoidais em programação quadrática inteira

  2017cites this paper
• On global optimization with indefinite quadratics

  2017influential citation
• DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs

  2017cites this paper
• Linear programing relaxations for a strategic pricing problem in electricity markets

  2017cites this paper
• A Global Algorithm for Quadratic Programming with One Negative Eigenvalue Based on Successive Linear Conic Optimization and Convex Relaxation

  2016influential citation
• The SCIP Optimization Suite 3.2

  2016cites this paper
• Global optimization advances in Mixed-Integer Nonlinear Programming, MINLP, and Constrained Derivative-Free Optimization, CDFO

  2016cites this paper
• Outer-product-free sets for polynomial optimization and oracle-based cuts

  2016cites this paper
• Relaxations in mixed-integer quadratically constrained programming and robust programming. (Relaxations en programmation mixte en nombres entiers avec contraintes quadratiques et en programmation robuste)

  2016cites this paper
• Conic approximation to quadratic optimization with linear complementarity constraints

  2016cites this paper
• Solving Box-Constrained Nonconvex Quadratic Programs

  2016cites this paper
• Sparse pseudoinverses via LP and SDP relaxations of Moore-Penrose

  2016cites this paper
• Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2

  2015cites this paper
• Exact quadratic convex reformulations of mixed-integer quadratically constrained problems

  2015cites this paper
• A Binarisation Approach to Non-Convex Quadratically Constrained Quadratic Programs

  2015cites this paper
• Generating cutting planes for the semidefinite relaxation of quadratic programs

  2015cites this paper
• Faster, but weaker, relaxations for quadratically constrained quadratic programs

  2014cites this paper
• On Minimal Valid Inequalities for Mixed Integer Conic Programs

  2014cites this paper
• Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets

  2014cites this paper
• On Minimal Valid Inequalities for Mixed Integer Conic Programs

  2014cites this paper
• Semidefinite Relaxation for Two Mixed Binary Quadratically Constrained Quadratic Programs: Algorithms and Approximation Bounds

  2014cites this paper
• A cutting plane algorithm for bounding a strategic pricing problem in electricity markets

  2014cites this paper
• Decomposition in multistage stochastic programming and a constraint integer programming approach to mixed-integer nonlinear programming

  2013cites this paper
• SDP relaxation for a strategic pricing bilevel problem in electricity markets

  2013cites this paper
• On the composition of convex envelopes for quadrilinear terms

  2013cites this paper
• Cutting Planes for Convex Objective Nonconvex Optimization

  2013cites this paper
• A branch-and-cut approach to portfolio selection with marginal risk control in a linear conic programming framework

  2013cites this paper
• General solution methods for mixed integer quadratic programming and derivative free mixed integer non-linear programming problems

  2013cites this paper
• Mixed-integer nonlinear optimization*†

  2013cites this paper
• Semidefinite Approximation for Mixed Binary Quadratically Constrained Quadratic Programs

  2013cites this paper
• Semidefinite Programming. Methods and algorithms for energy management. (Programmation semi-définie positive. Méthodes et algorithmes pour le management d'énergie)

  2013cites this paper
• Optimal rank-sparsity decomposition

  2013cites this paper
• Conic Reformulations and Approximations to Some Subclasses of Nonconvex Quadratic Programming Problems.

  2013influential citation
• Extending a CIP framework to solve MIQCPs

  2012cites this paper
• Strong formulations for convex functions over nonconvex sets

  2012cites this paper
• Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations

  2012influential citation
• Disjunctive Cuts for Mixed Integer Nonlinear Programming Problems

  2012cites this paper
• Mixed integer bilinear programming with applications to the pooling problem

  2012cites this paper
• GloMIQO: Global mixed-integer quadratic optimizer

  2012influential citation
• Copula-based multivariate input modeling

  2012cites this paper
• Non-convex mixed-integer nonlinear programming: A survey

  2012cites this paper
• An integer linear programming approach for bilinear integer programming

  2012cites this paper
• Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints

  2012cites this paper
• Disjunctive Cuts for Nonconvex MINLP

  2012cites this paper
• Linear Programming Relaxations of Quadratically Constrained Quadratic Programs

  2012cites this paper
• A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation

  2012cites this paper
• The split closure of a strictly convex body

  2011cites this paper
• Disjunctive Inequalities: Applications And Extensions

  2011influential citation
• An Outer-Inner Approximation for separable MINLPs

  2011cites this paper
• Cutting Planes for Mixed Integer Programming

  2011cites this paper
• On linear programs with linear complementarity constraints

  2011cites this paper
• Exploiting Second-Order Cone Structure for Global Optimization

  2010cites this paper