Pages that link to "Item:Q1774170"

The following pages link to A branch-and-cut algorithm for nonconvex quadratic programs with box constraints (Q1774170):

Displaying 50 items.

• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• Semidefinite relaxations for non-convex quadratic mixed-integer programming (Q378112) (← links)
• An LPCC approach to nonconvex quadratic programs (Q431005) (← links)
• On linear programs with linear complementarity constraints (Q452341) (← links)
• Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (Q506441) (← links)
• Nonlinear optimization problem of interdependent investment projects portfolio (Q507118) (← links)
• An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160) (← links)
• Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization (Q522270) (← links)
• RLT: A unified approach for discrete and continuous nonconvex optimization (Q537611) (← links)
• Relaxing the optimality conditions of box QP (Q538311) (← links)
• Quadratic factorization heuristics for copositive programming (Q542052) (← links)
• Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations (Q652290) (← links)
• DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (Q723488) (← links)
• A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743) (← links)
• An accelerating algorithm for globally solving nonconvex quadratic programming (Q824677) (← links)
• Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound (Q839489) (← links)
• A note on sufficient global optimality conditions for fixed charge quadratic programs (Q845625) (← links)
• Convex programming with single separable constraint and bounded variables (Q885824) (← links)
• Box-constrained quadratic programs with fixed charge variables (Q933786) (← links)
• Optimizing a polyhedral-semidefinite relaxation of completely positive programs (Q977327) (← links)
• Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming (Q1029700) (← links)
• Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (Q1621692) (← links)
• Global optimality conditions for fixed charge quadratic programs (Q1670551) (← links)
• Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
• Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods (Q1730782) (← links)
• New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128) (← links)
• Globally solving nonconvex quadratic programming problems via completely positive programming (Q1762459) (← links)
• A polyhedral study of nonconvex quadratic programs with box constraints (Q1774169) (← links)
• Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
• On convex relaxations for quadratically constrained quadratic programming (Q1925792) (← links)
• Algorithms for linear programming with linear complementarity constraints (Q1935876) (← links)
• Separation and relaxation for cones of quadratic forms (Q1942279) (← links)
• An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation (Q2044572) (← links)
• Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems (Q2073059) (← links)
• Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints (Q2089865) (← links)
• A reduced proximal-point homotopy method for large-scale non-convex BQP (Q2114822) (← links)
• Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
• Testing copositivity via mixed-integer linear programming (Q2226458) (← links)
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
• Solving linear programs with complementarity constraints using branch-and-cut (Q2281449) (← links)
• A binarisation heuristic for non-convex quadratic programming with box constraints (Q2294229) (← links)
• Outlier detection and least trimmed squares approximation using semi-definite programming (Q2445775) (← links)
• A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations (Q2476994) (← links)
• A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming (Q2633541) (← links)
• Computable representations for convex hulls of low-dimensional quadratic forms (Q2638365) (← links)
• Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations (Q2638381) (← links)
• Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations (Q2826815) (← links)
• Disjunctive Cuts for Nonconvex MINLP (Q2897296) (← links)
• Linear Programming Relaxations of Quadratically Constrained Quadratic Programs (Q2897305) (← links)
• Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)