Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
From MaRDI portal
Recommendations
- A polyhedral approach for nonconvex quadratic programming problems with box constraints
- Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints
- On nonconvex quadratic programming with box constraints
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- Solving Quadratic Programming by Cutting Planes
Cites work
- scientific article; zbMATH DE number 4070633 (Why is no real title available?)
- scientific article; zbMATH DE number 221928 (Why is no real title available?)
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A polyhedral approach for nonconvex quadratic programming problems with box constraints
- A polyhedral branch-and-cut approach to global optimization
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts
- An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes
- Benchmarking optimization software with performance profiles.
- Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computable representations for convex hulls of low-dimensional quadratic forms
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Edmonds polytopes and weakly hamiltonian graphs
- Experiments in quadratic 0-1 programming
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Globally solving nonconvex quadratic programming problems via completely positive programming
- Introduction to global optimization.
- On convex relaxations for quadratically constrained quadratic programming
- On cuts and matchings in planar graphs
- On nonconvex quadratic programming with box constraints
- On the cut polytope
- On valid inequalities for quadratic programming with continuous variables and binary indicators
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Outline of an algorithm for integer solutions to linear programs
- Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- The cut polytope and the Boolean quadric polytope
- Total unimodularity and the Euler-subgraph problem
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
Cited in
(35)- Spectral relaxations and branching strategies for global optimization of mixed-integer quadratic programs
- Solution to nonconvex quadratic programming with both inequality and box constraints
- Fix and bound: an efficient approach for solving large-scale quadratic programming problems with box constraints
- A distributionally robust optimization approach for two-stage facility location problems
- On nonconvex quadratic programming with box constraints
- Optimal design of line replaceable units
- Using \(\ell_1\)-relaxation and integer programming to obtain dual bounds for sparse PCA
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- Volume computation for sparse Boolean quadric relaxations
- Data-driven decision model based on local two-stage weighted ensemble learning
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints
- Using general triangle inequalities within quadratic convex reformulation method
- Cutting plane generation through sparse principal component analysis
- On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints
- A polyhedral study of nonconvex quadratic programs with box constraints
- Solving Quadratic Programming by Cutting Planes
- Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems
- The Running Intersection Relaxation of the Multilinear Polytope
- scientific article; zbMATH DE number 7413562 (Why is no real title available?)
- Skyport location problem for urban air mobility system
- On the impact of running intersection inequalities for globally solving polynomial optimization problems
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
- A computational study on QP problems with general linear constraints
- On the separation of split inequalities for non-convex quadratic integer programming
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
- AN ITERATIVE ALGORITHM FOR A CLASS OF NONLINEAR INTEGER BILEVEL PROGRAMMING PROBLEMS WITH BOX CONSTRAINTS
- Compact mixed-integer programming formulations in quadratic optimization
- Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints
- SDP-based branch-and-bound for non-convex quadratic integer optimization
- (Global) optimization: historical notes and recent developments
- Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization
- Convexification techniques for fractional programs
- A binarisation heuristic for non-convex quadratic programming with box constraints
- Extended formulations for convex hulls of some bilinear functions
This page was built for publication: Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1621692)
