Pages that link to "Item:Q1780950"

The following pages link to A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs (Q1780950):

Displaying 50 items.

• Global solutions to a class of CEC benchmark constrained optimization problems (Q279808) (← links)
• On structural decompositions of finite frames (Q295388) (← links)
• Exact quadratic convex reformulations of mixed-integer quadratically constrained problems (Q304240) (← links)
• Non polyhedral convex envelopes for 1-convex functions (Q312465) (← links)
• On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
• Copositivity and constrained fractional quadratic problems (Q403649) (← links)
• Representing quadratically constrained quadratic programs as generalized copositive programs (Q439919) (← links)
• An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160) (← links)
• Global optimization algorithm for mixed integer quadratically constrained quadratic program (Q515761) (← links)
• Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes (Q524905) (← links)
• New multi-commodity flow formulations for the pooling problem (Q524906) (← links)
• Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
• Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
• A class of differential quadratic programming problems (Q670795) (← links)
• Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming (Q683728) (← links)
• Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
• DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (Q723488) (← links)
• An accelerating algorithm for globally solving nonconvex quadratic programming (Q824677) (← links)
• A review of recent advances in global optimization (Q842710) (← links)
• Continuous piecewise linear delta-approximations for bivariate and multivariate functions (Q887097) (← links)
• A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming (Q902804) (← links)
• A fair division approach to humanitarian logistics inspired by conditional value-at-risk (Q1640048) (← links)
• A parametric linearizing approach for quadratically inequality constrained quadratic programs (Q1644881) (← links)
• A linearized relaxing algorithm for the specific nonlinear optimization problem (Q1669202) (← links)
• An extension of Yuan's lemma and its applications in optimization (Q1673911) (← links)
• A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables (Q1675255) (← links)
• A novel optimization method for nonconvex quadratically constrained quadratic programs (Q1724769) (← links)
• Convex and concave envelopes: revisited and new perspectives (Q1728297) (← links)
• A distributed continuous-time method for non-convex QCQPs (Q1729053) (← links)
• Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods (Q1730782) (← links)
• Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint (Q1753128) (← links)
• Convex envelopes of bivariate functions through the solution of KKT systems (Q1756774) (← 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)
• Explicit convex and concave envelopes through polyhedral subdivisions (Q1949256) (← links)
• The exact solution of multiparametric quadratically constrained quadratic programming problems (Q2022221) (← links)
• Quadratic optimization with switching variables: the convex hull for \(n=2\) (Q2044962) (← links)
• Convex hull representations for bounded products of variables (Q2046306) (← links)
• A geometric branch and bound method for robust maximization of convex functions (Q2052396) (← links)
• Convex envelopes for ray-concave functions (Q2080818) (← links)
• Active fault diagnosis under hybrid bounded and Gaussian uncertainties (Q2103683) (← links)
• Optimal portfolio deleveraging under market impact and margin restrictions (Q2240011) (← links)
• A technique to derive the analytical form of convex envelopes for some bivariate functions (Q2250092) (← links)
• A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation (Q2251137) (← links)
• Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming (Q2274889) (← links)
• Template polyhedra and bilinear optimization (Q2322312) (← links)
• New SOCP relaxation and branching rule for bipartite bilinear programs (Q2331354) (← links)
• An algorithm for global solution to bi-parametric linear complementarity constrained linear programs (Q2349521) (← links)