Pages that link to "Item:Q1925792"

The following pages link to On convex relaxations for quadratically constrained quadratic programming (Q1925792):

Displaying 33 items.

• Non polyhedral convex envelopes for 1-convex functions (Q312465) (← links)
• On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
• A model for clustering data from heterogeneous dissimilarities (Q323236) (← links)
• RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (Q340017) (← links)
• Representing quadratically constrained quadratic programs as generalized copositive programs (Q439919) (← links)
• Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes (Q524905) (← links)
• Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (Q1621692) (← links)
• Strong formulations for quadratic optimization with M-matrices and indicator variables (Q1650773) (← links)
• On linear programming relaxations for solving polynomial programming problems (Q1654348) (← links)
• Convex and concave envelopes: revisited and new perspectives (Q1728297) (← links)
• Convex envelopes of bivariate functions through the solution of KKT systems (Q1756774) (← links)
• On the efficient Gerschgorin inclusion usage in the global optimization \(\alpha\)BB method (Q2018467) (← links)
• Is a finite intersection of balls covered by a finite union of balls in Euclidean spaces? (Q2025288) (← links)
• On tackling reverse convex constraints for non-overlapping of unequal circles (Q2045013) (← links)
• An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs (Q2070358) (← links)
• A time-triggered dimension reduction algorithm for the task assignment problem (Q2095343) (← links)
• Ideal formulations for constrained convex optimization problems with indicator variables (Q2118117) (← links)
• A technique to derive the analytical form of convex envelopes for some bivariate functions (Q2250092) (← links)
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
• On the problem of packing spheres in a cube (Q2263331) (← links)
• Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming (Q2274889) (← links)
• A binarisation heuristic for non-convex quadratic programming with box constraints (Q2294229) (← links)
• Lifted polymatroid inequalities for mean-risk optimization with indicator variables (Q2423781) (← links)
• Facets of a mixed-integer bilinear covering set with bounds on variables (Q2423814) (← links)
• Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program (Q2450669) (← links)
• On convex envelopes for bivariate functions over polytopes (Q2452372) (← links)
• Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
• Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex (Q2954391) (← links)
• A guide to conic optimisation and its applications (Q4634309) (← links)
• Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective (Q5057987) (← links)
• Submodularity in Conic Quadratic Mixed 0–1 Optimization (Q5131480) (← links)
• Optimization under uncertainty and risk: quadratic and copositive approaches (Q6113346) (← links)
• (Global) optimization: historical notes and recent developments (Q6114910) (← links)