Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex
From MaRDI portal
Recommendations
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- scientific article; zbMATH DE number 1130737
- On convex envelopes for bivariate functions over polytopes
- On the Composition of Convex Envelopes for Quadrilinear Terms
- Exact and approximate results for convex envelopes of special structured functions over simplices
- scientific article; zbMATH DE number 2217308
- Convex envelope of bivariate cubic functions over rectangular regions
- An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes
- scientific article; zbMATH DE number 3945886
Cites work
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- A clique algorithm for standard quadratic programming
- A convex envelope formula for multilinear functions
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- An algorithm for nonconvex programming problems
- An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computable representations for convex hulls of low-dimensional quadratic forms
- Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program
- Convex envelopes for edge-concave functions
- Convex envelopes generated from finitely many compact convex sets
- Convex envelopes of products of convex and component-wise concave functions
- Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex
- D.C. versus copositive bounds for standard QP
- Existence and sum decomposition of vertex polyhedral convex envelopes
- Explicit convex and concave envelopes through polyhedral subdivisions
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- scientific article; zbMATH DE number 2068080 (Why is no real title available?)
- Jointly Constrained Biconvex Programming
- Maxima for Graphs and a New Proof of a Theorem of Turán
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- On convex envelopes for bivariate functions over polytopes
- On convex relaxations for quadratically constrained quadratic programming
- On copositive programming and standard quadratic optimization problems
- On standard quadratic optimization problems
- On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals
- Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes
- Semidefinite relaxations of fractional programs via novel convexification techniques
- The Convex Envelope of (n–1)-Convex Functions
Cited in
(7)- Convex envelopes of separable functions over regions defined by separable functions of the same type
- Convex envelopes of bivariate functions through the solution of KKT systems
- Exact and approximate results for convex envelopes of special structured functions over simplices
- On convex envelopes for bivariate functions over polytopes
- Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex
- A new branch-and-bound algorithm for standard quadratic programming problems
- On the Composition of Convex Envelopes for Quadrilinear Terms
This page was built for publication: Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2954391)
