Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex
From MaRDI portal
Publication:2954391
DOI10.1137/140976637zbMath1378.90060OpenAlexW2069313882MaRDI QIDQ2954391
Publication date: 13 January 2017
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/140976637
Related Items (4)
Convex envelopes of separable functions over regions defined by separable functions of the same type ⋮ Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex ⋮ A new branch-and-bound algorithm for standard quadratic programming problems ⋮ Convex envelopes of bivariate functions through the solution of KKT systems
Cites Work
- Unnamed Item
- Convex envelopes of products of convex and component-wise concave functions
- Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- Existence and sum decomposition of vertex polyhedral convex envelopes
- A clique algorithm for standard quadratic programming
- On standard quadratic optimization problems
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- A convex envelope formula for multilinear functions
- On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals
- Convex envelopes for edge-concave functions
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- On convex relaxations for quadratically constrained quadratic programming
- Convex envelopes generated from finitely many compact convex sets
- Explicit convex and concave envelopes through polyhedral subdivisions
- An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes
- Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program
- On convex envelopes for bivariate functions over polytopes
- D.C. versus copositive bounds for standard QP
- Computable representations for convex hulls of low-dimensional quadratic forms
- Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex
- The Convex Envelope of (n–1)-Convex Functions
- Jointly Constrained Biconvex Programming
- An algorithm for nonconvex programming problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Maxima for Graphs and a New Proof of a Theorem of Turán
- On copositive programming and standard quadratic optimization problems
- Semidefinite relaxations of fractional programs via novel convexification techniques
This page was built for publication: Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex
