Convex combination
flowchart AA["Associated Authors (0)"] C[Convex combination] BC["Broader Concepts (1)"] NC["Narrower Concepts (19)"] C== skos:broader ==>BC NC== skos:broader ==>C AA== dcterms:relation ==>C click BC "#broader-concepts" click NC "#narrower-concepts" click AA "#associated-authors" NI["add incoming edge"] NO["add outgoing edge"] NI-- ? -->C C-- ? -->NO click NI "#add-incoming-edge" click NO "#add-outgoing-edge" style NI stroke-width:2px,stroke-dasharray: 5 5 style NO stroke-width:2px,stroke-dasharray: 5 5
- Wikidata
- https://www.wikidata.org/wiki/Q2627315
- OpenAlex ID
- https://openalex.org/C111110010 (API record)
- OpenAlex Description
- linear combination of points whose coefficients are non-negative and sum to one
- OpenAlex Level [?]
- 4
Broader Concepts
Narrower Concepts
- Absolutely convex set
- Choquet theory
- Conic optimization
- Convex cone
- Convex conjugate
- Convex curve
- Effective domain
- Ellipsoid method
- Krein–Milman theorem
- Logarithmically convex function
- Mixed volume
- Orthogonal convex hull
- Output-sensitive algorithm
- Proper convex function
- Proximal gradient methods for learning
- Pseudoconvex function
- Quasiconvex function
- Strictly convex space
- Support function
Associated Authors
Add Incoming Edge
Login via ORCiD to contribute.
Add Outgoing Edge
Login via ORCiD to contribute.