Pages that link to "Item:Q1774169"

The following pages link to A polyhedral study of nonconvex quadratic programs with box constraints (Q1774169):

Displaying 39 items.

• Global solutions to folded concave penalized nonconvex learning (Q282459) (← links)
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← 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)
• An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160) (← links)
• Relaxing the optimality conditions of box QP (Q538311) (← links)
• Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
• Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations (Q652290) (← links)
• A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743) (← 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)
• Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
• Box-constrained quadratic programs with fixed charge variables (Q933786) (← links)
• Global optimality conditions for fixed charge quadratic programs (Q1670551) (← links)
• A branch-and-bound algorithm for instrumental variable quantile regression (Q1697970) (← links)
• Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
• New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128) (← links)
• A branch-and-cut algorithm for nonconvex quadratic programs with box constraints (Q1774170) (← links)
• Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
• Separation and relaxation for cones of quadratic forms (Q1942279) (← links)
• Semidefinite program duals for separable polynomial programs involving box constraints (Q1985290) (← links)
• Convexification techniques for linear complementarity constraints (Q2045009) (← links)
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← 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)
• Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations (Q2638381) (← links)
• Skyport location problem for urban air mobility system (Q2669717) (← links)
• Global optimization for non-convex programs via convex proximal point method (Q2691402) (← links)
• Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming (Q2786313) (← links)
• Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
• Convexification Techniques for Linear Complementarity Constraints (Q3009774) (← links)
• CONDITIONS FOR GLOBAL OPTIMALITY OF QUADRATIC MINIMIZATION PROBLEMS WITH LMI CONSTRAINTS (Q3439884) (← links)
• Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs (Q3503837) (← links)
• Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs (Q5746688) (← links)
• Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems (Q6102175) (← links)
• (Global) optimization: historical notes and recent developments (Q6114910) (← links)