Algorithmic problems on convex sets
id:
algorithmic-problems-on-convex-sets-306-2127570
title:
Algorithmic problems on convex sets
text:
Many problems in mathematical programming can be formulated as problems on convex sets or convex bodies. Six kinds of problems are particularly important: optimization, violation, validity, separation, membership and emptiness. Each of these problems has a strong (exact) variant, and a weak (approximate) variant. In all problem descriptions, K denotes a compact and convex set in Rn.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Algorithmic_problems_on_convex_sets
date created:
date modified:
2024-04-04T19:23:17Z
main entity:
{"identifier":"Q124505712","url":"https://www.wikidata.org/entity/Q124505712"}
image:
fields total:
13
integrity:
13