Pages that link to "Item:Q2638365"
From MaRDI portal
The following pages link to Computable representations for convex hulls of low-dimensional quadratic forms (Q2638365):
Displaying 50 items.
- Non polyhedral convex envelopes for 1-convex functions (Q312465) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets (Q360522) (← links)
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- Copositivity and constrained fractional quadratic problems (Q403649) (← links)
- Copositive optimization -- recent developments and applications (Q421783) (← links)
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
- Extended formulations for convex envelopes (Q486393) (← links)
- A nonlinear semidefinite optimization relaxation for the worst-case linear optimization under uncertainties (Q494344) (← links)
- How to convexify the intersection of a second order cone and a nonconvex quadratic (Q517311) (← links)
- Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes (Q524905) (← links)
- Burer's key assumption for semidefinite and doubly nonnegative relaxations (Q691396) (← links)
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743) (← links)
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (Q1621692) (← links)
- Deriving convex hulls through lifting and projection (Q1646568) (← links)
- Quadratic programs with hollows (Q1659682) (← links)
- A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables (Q1675255) (← links)
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods (Q1730782) (← links)
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
- A survey of adjustable robust optimization (Q1740490) (← links)
- Convex envelopes of bivariate functions through the solution of KKT systems (Q1756774) (← links)
- Building a completely positive factorization (Q1787912) (← 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)
- Separating doubly nonnegative and completely positive matrices (Q1942269) (← 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)
- Quadratic optimization with switching variables: the convex hull for \(n=2\) (Q2044962) (← links)
- Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks (Q2045011) (← links)
- Convex hull representations for bounded products of variables (Q2046306) (← links)
- Convex envelopes for ray-concave functions (Q2080818) (← links)
- A survey of hidden convex optimization (Q2176821) (← links)
- Exploiting partial correlations in distributionally robust optimization (Q2227536) (← links)
- Valid inequalities for quadratic optimisation with domain constraints (Q2234747) (← links)
- A new framework to relax composite functions in nonlinear programs (Q2235154) (← links)
- A technique to derive the analytical form of convex envelopes for some bivariate functions (Q2250092) (← links)
- A binarisation heuristic for non-convex quadratic programming with box constraints (Q2294229) (← links)
- A gentle, geometric introduction to copositive optimization (Q2349118) (← links)
- Tightening a copositive relaxation for standard quadratic optimization problems (Q2376121) (← links)
- On the copositive representation of binary and continuous nonconvex quadratic programs (Q2391001) (← links)
- Unbounded convex sets for non-convex mixed-integer quadratic programming (Q2436643) (← 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)
- New approximations for the cone of copositive matrices and its dual (Q2452380) (← links)
- Interplay of non-convex quadratically constrained problems with adjustable robust optimization (Q2661757) (← links)
- New bounds for nonconvex quadratically constrained quadratic programming (Q2689857) (← links)
- Copositive Programming (Q2802526) (← 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)
