Search results

Create the page "Convex Optimisation" on this wiki! See also the search results found.

• Convex
  ...|(X,\mathbb{K})}} a [[subset of]] {{M|X}}, say {{M|C\in\mathcal{P}(X)}} is convex if * [[Convex function]] - we call a [[function]] convex in this case
  532 B (92 words) - 14:50, 9 February 2017
• Convex function
  : See ''[[convex]]'' for other uses of the word (eg a ''[[convex set]]'') ...t {{M|f:S\rightarrow\mathbb{R} }} be a [[function]]. We say {{M|f}} is a ''convex function'' if both of the following hold{{rAFCIRAPM}}:
  1 KB (224 words) - 10:54, 10 February 2017
• Epigraph
  ...unction is convex if and only if its domain is convex and its epigraph are convex sets]]'' ...alysis|Functional Analysis|Real Analysis|Convex Optimisation|Combinatorial Optimisation}}
  674 B (114 words) - 11:04, 10 February 2017
• Convex hull
  ...ean n-space|{{M|\mathbb{R}^n}}]] - that is [[not empty]] - we define the ''convex hull'', {{M|H}} as follows: ...in\text{Convex}(S;\mathbb{R}^n)}C}} - the [[intersection]] of all {{plural|convex set|s}} in {{M|\mathbb{R}^n}} containing {{M|S}}
  822 B (134 words) - 15:54, 12 February 2017