Перевод: с немецкого на все языки

Subdifferential

Ничего не найдено.

Попробуйте поискать во всех возможных языках

или измените свой поисковый запрос.

См. также в других словарях:

  • Subdifferential — Das Subdifferential ist eine Verallgemeinerung des Gradienten. Inhaltsverzeichnis 1 Definition 2 Beispiel 3 Beschränktheit 3.1 Beweis …   Deutsch Wikipedia

  • Subderivative — In mathematics, the concepts of subderivative, subgradient, and subdifferential arise in convex analysis, that is, in the study of convex functions, often in connection to convex optimization. Let f : I →R be a real valued convex function defined …   Wikipedia

  • Jensen's inequality — In mathematics, Jensen s inequality, named after the Danish mathematician Johan Jensen, relates the value of a convex function of an integral to the integral of the convex function. It was proved by Jensen in 1906 [Jensen, J. Sur les fonctions… …   Wikipedia

  • Subgradient — Das Subdifferential ist eine Verallgemeinerung des Gradienten. Für eine Funktion ist das Subdifferential im Punkt gegeben durch für alle Die Elemente heißen …   Deutsch Wikipedia

  • Danskin's theorem — In convex analysis, Danskin s theorem is a theorem which provides information about the derivatives of a function of the form The theorem has applications in optimization, where it sometimes is used to solve minimax problems. Statement The… …   Wikipedia

  • List of convexity topics — This is a list of convexity topics, by Wikipedia page. Alpha blending Barycentric coordinates Borsuk s conjecture Bond convexity Carathéodory s theorem (convex hull) Choquet theory Closed convex function Concavity Convex analysis Convex… …   Wikipedia

  • Viscosity solution — In mathematics, the viscosity solution concept was introduced in the early 1980s by Pierre Louis Lions and Michael Crandall as a generalization of the classical concept of what is meant by a solution to a partial differential equation (PDE). It… …   Wikipedia

  • Subgradient method — Subgradient methods are algorithms for solving convex optimization problems. Originally developed by Naum Z. Shor and others in the 1960s and 1970s, subgradient methods can be used with a non differentiable objective function. When the objective… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»