A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
From MaRDI portal
(Redirected from Publication:1774170)
Recommendations
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems
- A branch and bound algorithm for nonconvex quadratic programming with quadratic constraints
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation
Cites work
- scientific article; zbMATH DE number 221928 (Why is no real title available?)
- A Computational Study of Search Strategies for Mixed Integer Programming
- A polyhedral study of nonconvex quadratic programs with box constraints
- An Algorithm for Large Zero-One Knapsack Problems
- An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
- BARON: A general purpose global optimization software package
- MINTO, a Mixed INTeger Optimizer
Cited in
(66)- scientific article; zbMATH DE number 7413562 (Why is no real title available?)
- An effective global algorithm for worst-case linear optimization under polyhedral uncertainty
- A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems
- A reduced proximal-point homotopy method for large-scale non-convex BQP
- scientific article; zbMATH DE number 6310870 (Why is no real title available?)
- (Global) optimization: historical notes and recent developments
- Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems
- A feasible method for general convex low-rank SDP problems
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- A binarisation heuristic for non-convex quadratic programming with box constraints
- Relaxing the optimality conditions of box QP
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Computable representations for convex hulls of low-dimensional quadratic forms
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- A polyhedral study of nonconvex quadratic programs with box constraints
- Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
- An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Solving the canonical dual of box- and integer-constrained nonconvex quadratic programs via a deterministic direct search algorithm
- A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming
- Quadratic factorization heuristics for copositive programming
- Globally solving nonconvex quadratic programming problems via completely positive programming
- Solution to nonconvex quadratic programming with both inequality and box constraints
- Testing copositivity via mixed-integer linear programming
- Separation and relaxation for cones of quadratic forms
- Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints
- Disjunctive Cuts for Nonconvex MINLP
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation
- Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems
- An accelerating algorithm for globally solving nonconvex quadratic programming
- On convex relaxations for quadratically constrained quadratic programming
- Box-constrained quadratic programs with fixed charge variables
- Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties
- Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations
- Algorithms for linear programming with linear complementarity constraints
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- Linear programming relaxations of quadratically constrained quadratic programs
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
- Outlier detection and least trimmed squares approximation using semi-definite programming
- An LPCC approach to nonconvex quadratic programs
- A new algorithm for the general quadratic programming problems with box constraints
- DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs
- Domain reduction techniques for global NLP and MINLP optimization
- A note on sufficient global optimality conditions for fixed charge quadratic programs
- On linear programs with linear complementarity constraints
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization
- Convex programming with single separable constraint and bounded variables
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
- Nonlinear optimization problem of interdependent investment projects portfolio
- Solving linear programs with complementarity constraints using branch-and-cut
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- RLT: A unified approach for discrete and continuous nonconvex optimization
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Global optimality conditions for fixed charge quadratic programs
- A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems
- Cutting plane generation through sparse principal component analysis
This page was built for publication: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1774170)
