Pages that link to "Item:Q2638381"

The following pages link to Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations (Q2638381):

Displaying 42 items.

• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• A model for clustering data from heterogeneous dissimilarities (Q323236) (← links)
• A computational study for bilevel quadratic programs using semidefinite relaxations (Q323274) (← links)
• Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
• GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
• Semidefinite relaxations for non-convex quadratic mixed-integer programming (Q378112) (← links)
• An integer linear programming approach for bilinear integer programming (Q435736) (← links)
• On linear programs with linear complementarity constraints (Q452341) (← links)
• Strong-branching inequalities for convex mixed integer nonlinear programs (Q480939) (← links)
• Optimal rank-sparsity decomposition (Q486401) (← links)
• An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160) (← links)
• Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations (Q652290) (← links)
• Extensions on ellipsoid bounds for quadratic integer programming (Q721161) (← links)
• A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743) (← links)
• Global optimization of MIQCPs with dynamic piecewise relaxations (Q1668791) (← links)
• On global optimization with indefinite quadratics (Q1707078) (← 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)
• Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
• An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation (Q2044572) (← links)
• Convexification of bilinear forms through non-symmetric lifting (Q2045010) (← links)
• SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs (Q2164703) (← links)
• Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
• Valid inequalities for quadratic optimisation with domain constraints (Q2234747) (← links)
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
• The split closure of a strictly convex body (Q2275578) (← links)
• Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem (Q2311115) (← links)
• On the separation of split inequalities for non-convex quadratic integer programming (Q2339844) (← links)
• Conic approximation to quadratic optimization with linear complementarity constraints (Q2397094) (← links)
• Unbounded convex sets for non-convex mixed-integer quadratic programming (Q2436643) (← links)
• Second order optimality conditions and reformulations for nonconvex quadratically constrained quadratic programming problems (Q2438409) (← links)
• Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds (Q2630836) (← links)
• A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming (Q2633541) (← 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)
• Linear programing relaxations for a strategic pricing problem in electricity markets (Q2968496) (← links)
• Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints (Q3454970) (← links)
• Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties (Q4995064) (← links)
• Intersection Disjunctions for Reverse Convex Sets (Q5076701) (← links)
• Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
• On the Composition of Convex Envelopes for Quadrilinear Terms (Q5244679) (← links)
• An effective global algorithm for worst-case linear optimization under polyhedral uncertainty (Q6166102) (← links)