On convex envelopes for bivariate functions over polytopes (Q2452372): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-012-0616-x / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-012-0616-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2102102359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jointly Constrained Biconvex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable representations for convex hulls of low-dimensional quadratic forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convex relaxations for quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex envelopes for edge-concave functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization of rational functions and the nearest GCDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convex envelope formula for multilinear functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of bounds for multilinear functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxations of fractional programs via novel convexification techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral branch-and-cut approach to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence and sum decomposition of vertex polyhedral convex envelopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-012-0616-X / rank
 
Normal rank

Latest revision as of 17:42, 18 December 2024

scientific article
Language Label Description Also known as
English
On convex envelopes for bivariate functions over polytopes
scientific article

    Statements

    On convex envelopes for bivariate functions over polytopes (English)
    0 references
    2 June 2014
    0 references
    The concept of convex envelope of a lower semi-continuous function at a point \(x \in P\), where \(P\) is a given polytope in \(\mathbb{R}^n\) is introduced. The paper studies the convex envelope of bi-variate functions over polytopes in \(\mathbb{R}^2\). It is assumed that the Hessian of the functions is indefinite in the interior of \(P\) and the restriction of the functions along each edge of \(P\) is either concave or strictly convex. A method for the computation of the value of the convex envelope over a general two-dimensional polytope at a given point \(x\) is proposed. Further it is shown that the same results can be obtained for quadratic, some polynomial and some rational functions. It is shown that the computations can be carried out by solving a single semi-definite problem. The results can be directly applied to some advanced Branch-and-Bound techniques. The theoretical results are demonstrated on a small numerical example in the Appendix.
    0 references
    convex envelopes
    0 references
    semi-definite programming, quadratic problems, non-convex programming, global optimization
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references