KIT
|
KIT-Bibliothek
|
Impressum
|
Datenschutz
Repository KITopen
Serie: Convex Analysis
Genre
Vorlesung
Beschreibung
Lectures on convex analysis at Karlsruhe Institute of Technology
Fachgebiete
Wirtschaftswissenschaften (wirt) (DDC 330)
Reichweite
Veröffentlichung nur im Campusnetz des KIT
Folgen 1 - 38
Convex Analysis, Section 5.6 (A choice of the parameter r)
Convex Analysis, Section 5.5 (Monotonicity of the convex subdifferential)
Convex Analysis, Section 5.4 (Computation of global Lipschitz constants)
Convex Analysis, Section 5.2 (A mean value theorem for convex functions), Section 5.3 (Existence of global Lipschitz constants)
Convex Analysis, Section 5.1 (Safety distance in the set approximation example)
Convex Analysis, Section 4.5 (The Theorem of Lewis and Pang for g_0 under the Slater condition)
Convex Analysis, Section 4.4 (The Theorem of Lewis and Pang for general convex functions under the Slater condition)
Convex Analysis, Section 4.3 (Sudifferential and normal cone)
Convex Analysis, Section 4.2 (One-sided directional derivative and first order cones)
Convex Analysis, Section 4.1 (Convex subdifferential), part 7 (Computation of one-sided directional derivatives, rules of computation)
Convex Analysis, Section 4.1 (Convex subdifferential), part 6 (Semi-continuity properties)
Convex Analysis, Section 4.1 (Convex subdifferential), part 5 (Constraint Qualifications, continued)
Convex Analysis, Section 4.1 (Convex subdifferential), part 4 (Constraint Qualifications)
Convex Analysis, Section 4.1 (Convex subdifferential), part 3 (Computation)
Convex Analysis, Section 4.1 (Convex subdifferential), part 2 (Critical points)
Convex Analysis, Section 4.1 (Convex subdifferential), part 1 (Examples)
Convex Analysis, Section 3.4 (A concretion of the Theorem of Lewis and Pang)
Convex Analysis, Section 3.3 (The Theorem of Lewis and Pang for general convex functions)
Convex Analysis, Section 3.2 (One-sided directional differentiability of convex functions)
Convex Analysis, Section 3 (Smoothness properties of convex functions); Section 3.1 (Local Lipschitz continuity of convex functions)
Convex Analysis, Section 2.5 (Best-possible Hoffman constants in the smooth case), part 2
Convex Analysis, Section 2.5 (Best-possible Hoffman constants in the smooth case), part 1
Convex Analysis, Section 2.4 (Supporting hyperplanes)
Convex Analysis, Section 2.3 (Normal cones), part 3
Convex Analysis, Section 2.3 (Normal cones), part 2
Convex Analysis, Section 2.3 (Normal cones), part 1
Convex Analysis, Section 2.2 (Existence of global error bounds)
Convex Analysis, Section 2.1 (Maximal distance in obstacle smoothing)
Convex Analysis, Section 1.7 (Optimality conditions for smooth convex problems)
Convex Analysis, Section 1.6 (Constraint qualifications)
Convex Analysis, Section 1.5 (Convexity of entropic smoothing)
Convex Analysis, Section 1.4 (Smooth convex functions)
Convex Analysis, Section 1.3 (Convexity), part 2
Convex Analysis, Section 1.3 (Convexity), part 1
Convex Analysis, Section 1.2 (Entropic smoothing)
Convex Analysis, Section 1.1 (The set approximation example), part 2
Convex Analysis, Section 1.1 (The set approximation example), part 1
Convex Analysis, Introduction
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft
KITopen Series Landing Page