"convex envelope" meaning in All languages combined

{
  "forms": [
    {
      "form": "convex envelopes",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "convex envelope (plural convex envelopes)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematical analysis",
          "orig": "en:Mathematical analysis",
          "parents": [
            "Mathematics",
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "_dis": "66 34",
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w+disamb"
        },
        {
          "_dis": "67 33",
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w+disamb"
        },
        {
          "_dis": "69 31",
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w+disamb"
        }
      ],
      "coordinate_terms": [
        {
          "_dis1": "62 38",
          "word": "concave envelope"
        }
      ],
      "examples": [
        {
          "text": "1965 [Holt Rinehart & Winston], Robert E. Edwards, Functional Analysis: Theory and Applications, Dover, 1995, Unabridged Corrected Edition, page 561,\nIn E the closed convex envelope of a compact (resp. weakly compact) set is τ(E,E')-complete."
        },
        {
          "text": "1987, H. G. Eggleston, S. Madan (translators), Nicolas Bourbaki, Topological Vector Spaces: Chapters 1–5, [1981, N. Bourbaki, Espaces Vectoriels Topologiques], Springer, page IR-10,\nCorollary 1. — The convex envelope of a subset A of E is identical with the set of linear combinations ∑ᵢλᵢx_i, where (x_i) is any finite family of points in A, the numbers λᵢ>0 for all i and ∑ᵢλᵢ=1."
        },
        {
          "ref": "2010, Marcel Berger, Geometry Revealed: A Jacob's Ladder to Modern Higher Geometry, Springer, page 505:",
          "text": "The polytopes are, by definition, the convex envelopes of finite sets of points of an affine space.",
          "type": "quote"
        }
      ],
      "glosses": [
        "Convex hull."
      ],
      "id": "en-convex_envelope-en-noun-6pFqam6j",
      "links": [
        [
          "mathematical analysis",
          "mathematical analysis"
        ],
        [
          "Convex hull",
          "convex hull"
        ]
      ],
      "raw_glosses": [
        "(mathematical analysis, of a set) Convex hull."
      ],
      "raw_tags": [
        "of a set"
      ],
      "synonyms": [
        {
          "_dis1": "70 30",
          "sense": "optimisation theory",
          "word": "lower convex envelope"
        }
      ],
      "topics": [
        "mathematical-analysis",
        "mathematics",
        "sciences"
      ]
    },
    {
      "categories": [
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "2004, Fabio Tardella, “On the existence of polyhedral convex envelopes”, in Christodoulos A. Floudas, Panos M. Pardalos, editors, Frontiers in Global Optimization, Springer (Kluwer Academic), page 564:",
          "text": "One of the main reasons for the interest in convex envelopes is the fact that the set of global minimum points of f on S is contained in the set of global minimum points of conv_S(f) on S and the two minimum values coincide (see, e.g., [11, 17]). Hence, if the convex envelope were efficiently computable or available in closed form, one could replace the nonconvex problem of minimizing f on S with the convex problem of minimizing f on conv_S(f).",
          "type": "quote"
        },
        {
          "ref": "2004, C. A. Floudas, I. G. Akrotiriankis, S. Caratzoulas, C. A. Meyer, J. Kallrath, “Global Optimization in the 21st Century: Advances and Challenges”, in Ana Paula Barbosa-Póvoa, Henrique Matos, editors, European Symposium on Computer Aided Process Engineering-14: 37th European Symposium of the Working Party, Elsevier, page 25:",
          "text": "Tawarmalani and Sahinidis (2001) developed the convex envelope and concave envelope for x/y over a unit hypercube, compared it to the convex relaxation proposed by Zamora and Grosmmann (1998a), (1998b), (1999), proposed a semidefinite relaxation of x/y, and suggested convex envelopes for functions of the form f(x)y² and f(x)/y.",
          "type": "quote"
        },
        {
          "ref": "2005, Nguyen Van Thoai, “4: General Quadratic Programing”, in Charles Audet, Pierre Hansen, Giles Savard, editors, Essays and Surveys in Global Optimization, Springer, page 120:",
          "text": "The concept of convex envelopes of nonconvex functions is a basic tool in theory and algorithms of global optimization, see e.g., Falk and Hoffman (1976), Horst and Tuy (1996), Horst et al. (2000).",
          "type": "quote"
        },
        {
          "ref": "2012, Petro Bilotti, Sonia Cafieri, Jon Lee, Leo Liberti, Andrew J. Miller, On the Composition of Convex Envelopes for Quadrilinear Terms:",
          "text": "Comparing the use of convex envelopes for bilinear and trilinear forms in building convex approximations for MINLPs motivated the study in [6], and comparisons involving more general functional forms motivate the present article.",
          "type": "quote"
        }
      ],
      "glosses": [
        "For a given set S⊆ℝⁿ and real-valued function f defined on the convex hull conv(S), the highest-valued convex function that underestimates or equals f over S."
      ],
      "id": "en-convex_envelope-en-noun-Dey~lDuE",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "convex hull",
          "convex hull"
        ],
        [
          "convex function",
          "convex function"
        ],
        [
          "underestimate",
          "underestimate"
        ]
      ],
      "qualifier": "optimisation theory",
      "raw_glosses": [
        "(mathematics, optimisation theory, of a function on a set) For a given set S⊆ℝⁿ and real-valued function f defined on the convex hull conv(S), the highest-valued convex function that underestimates or equals f over S."
      ],
      "raw_tags": [
        "of a function on a set"
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "convex envelope"
}

{
  "categories": [
    "English countable nouns",
    "English entries with incorrect language header",
    "English lemmas",
    "English multiword terms",
    "English nouns",
    "Pages with 1 entry",
    "Pages with entries"
  ],
  "coordinate_terms": [
    {
      "word": "concave envelope"
    }
  ],
  "forms": [
    {
      "form": "convex envelopes",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "convex envelope (plural convex envelopes)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English terms with quotations",
        "en:Mathematical analysis"
      ],
      "examples": [
        {
          "text": "1965 [Holt Rinehart & Winston], Robert E. Edwards, Functional Analysis: Theory and Applications, Dover, 1995, Unabridged Corrected Edition, page 561,\nIn E the closed convex envelope of a compact (resp. weakly compact) set is τ(E,E')-complete."
        },
        {
          "text": "1987, H. G. Eggleston, S. Madan (translators), Nicolas Bourbaki, Topological Vector Spaces: Chapters 1–5, [1981, N. Bourbaki, Espaces Vectoriels Topologiques], Springer, page IR-10,\nCorollary 1. — The convex envelope of a subset A of E is identical with the set of linear combinations ∑ᵢλᵢx_i, where (x_i) is any finite family of points in A, the numbers λᵢ>0 for all i and ∑ᵢλᵢ=1."
        },
        {
          "ref": "2010, Marcel Berger, Geometry Revealed: A Jacob's Ladder to Modern Higher Geometry, Springer, page 505:",
          "text": "The polytopes are, by definition, the convex envelopes of finite sets of points of an affine space.",
          "type": "quote"
        }
      ],
      "glosses": [
        "Convex hull."
      ],
      "links": [
        [
          "mathematical analysis",
          "mathematical analysis"
        ],
        [
          "Convex hull",
          "convex hull"
        ]
      ],
      "raw_glosses": [
        "(mathematical analysis, of a set) Convex hull."
      ],
      "raw_tags": [
        "of a set"
      ],
      "topics": [
        "mathematical-analysis",
        "mathematics",
        "sciences"
      ]
    },
    {
      "categories": [
        "English terms with quotations",
        "Quotation templates to be cleaned",
        "en:Mathematics"
      ],
      "examples": [
        {
          "ref": "2004, Fabio Tardella, “On the existence of polyhedral convex envelopes”, in Christodoulos A. Floudas, Panos M. Pardalos, editors, Frontiers in Global Optimization, Springer (Kluwer Academic), page 564:",
          "text": "One of the main reasons for the interest in convex envelopes is the fact that the set of global minimum points of f on S is contained in the set of global minimum points of conv_S(f) on S and the two minimum values coincide (see, e.g., [11, 17]). Hence, if the convex envelope were efficiently computable or available in closed form, one could replace the nonconvex problem of minimizing f on S with the convex problem of minimizing f on conv_S(f).",
          "type": "quote"
        },
        {
          "ref": "2004, C. A. Floudas, I. G. Akrotiriankis, S. Caratzoulas, C. A. Meyer, J. Kallrath, “Global Optimization in the 21st Century: Advances and Challenges”, in Ana Paula Barbosa-Póvoa, Henrique Matos, editors, European Symposium on Computer Aided Process Engineering-14: 37th European Symposium of the Working Party, Elsevier, page 25:",
          "text": "Tawarmalani and Sahinidis (2001) developed the convex envelope and concave envelope for x/y over a unit hypercube, compared it to the convex relaxation proposed by Zamora and Grosmmann (1998a), (1998b), (1999), proposed a semidefinite relaxation of x/y, and suggested convex envelopes for functions of the form f(x)y² and f(x)/y.",
          "type": "quote"
        },
        {
          "ref": "2005, Nguyen Van Thoai, “4: General Quadratic Programing”, in Charles Audet, Pierre Hansen, Giles Savard, editors, Essays and Surveys in Global Optimization, Springer, page 120:",
          "text": "The concept of convex envelopes of nonconvex functions is a basic tool in theory and algorithms of global optimization, see e.g., Falk and Hoffman (1976), Horst and Tuy (1996), Horst et al. (2000).",
          "type": "quote"
        },
        {
          "ref": "2012, Petro Bilotti, Sonia Cafieri, Jon Lee, Leo Liberti, Andrew J. Miller, On the Composition of Convex Envelopes for Quadrilinear Terms:",
          "text": "Comparing the use of convex envelopes for bilinear and trilinear forms in building convex approximations for MINLPs motivated the study in [6], and comparisons involving more general functional forms motivate the present article.",
          "type": "quote"
        }
      ],
      "glosses": [
        "For a given set S⊆ℝⁿ and real-valued function f defined on the convex hull conv(S), the highest-valued convex function that underestimates or equals f over S."
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "convex hull",
          "convex hull"
        ],
        [
          "convex function",
          "convex function"
        ],
        [
          "underestimate",
          "underestimate"
        ]
      ],
      "qualifier": "optimisation theory",
      "raw_glosses": [
        "(mathematics, optimisation theory, of a function on a set) For a given set S⊆ℝⁿ and real-valued function f defined on the convex hull conv(S), the highest-valued convex function that underestimates or equals f over S."
      ],
      "raw_tags": [
        "of a function on a set"
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "synonyms": [
    {
      "sense": "optimisation theory",
      "word": "lower convex envelope"
    }
  ],
  "word": "convex envelope"
}