KIT-Bibliothek
suchen
KIT-Bibliothek
KIT-Bibliothek Medienportal
FAQ Audio-/Videodatei publizieren

Global Optimization II, Section 3.6 (Branch-and-bound for box-constrained problems), part 1

Diese Audio- bzw. Video-Datei ist urheberrechtlich geschützt. Der Zugriff ist nur über Rechner des Karlsruher Instituts für Technologie (KIT) erlaubt.

Autor

Oliver Stein

Beteiligtes Institut

Fakultät für Wirtschaftswissenschaften (WIWI)
Institut für Operations Research (IOR)

Genre

Vorlesung

Beschreibung

Lectures on nonconvex global optimization at Karlsruhe Institute of Technology

Laufzeit (hh:mm:ss)

00:27:35

Serie

Global Optimization II

Publiziert am

23.03.2022

Fachgebiet

Wirtschaftswissenschaften

Lizenz

KITopen-Lizenz

Auflösung 1280 x 720 Pixel
Seitenverhältnis 16:9
Audiobitrate 129938 bps
Audio Kanäle 2
Audio Codec aac
Audio Abtastrate 48000 Hz
Gesamtbitrate 936239 bps
Farbraum yuv420p
Container mov,mp4,m4a,3gp,3g2,mj2
Medientyp video/mp4
Dauer 1655 s
Dateiname DIVA-2022-98_hd.mp4
Dateigröße 193.684.579 byte
Bildwiederholfrequenz 25
Videobitrate 800361 bps
Video Codec h264

Embed-Code

Global Optimization II Folgen 1-29 von 29
Global Optimization II, Section 3.9.3 (A variation of Alg. 3.5)
Global Optimization II, Section 3.9.3 (A variation of Alg. 3.5)
Global Optimization II, Section 3.9.2 (Direct application to Alg. 3.5)
Global Optimization II, Section 3.9.2 (Direct application to Alg. 3.5)
Global Optimization II, Section 3.9.1 (Properties of Lipschitz continuous functions), part 2
Global Optimization II, Section 3.9.1 (Properties of Lipschitz continuous functions), part 2
Global Optimization II, Section 3.9.1 (Properties of Lipschitz continuous functions), part 1
Global Optimization II, Section 3.9.1 (Properties of Lipschitz continuous functions), part 1
Global Optimization II, Section 3.8 (Branch-and-bound for nonconvex problems)
Global Optimization II, Section 3.8 (Branch-and-bound for nonconvex problems)
Global Optimization II, Section 3.7 (Branch-and-bound for convexly constrained problems)
Global Optimization II, Section 3.7 (Branch-and-bound for convexly constrained problems)
Global Optimization II, Section 3.6 (Branch-and-bound for box-constrained problems), part 4
Global Optimization II, Section 3.6 (Branch-and-bound for box-constrained problems), part 4
Global Optimization II, Section 3.6 (Branch-and-bound for box-constrained problems), part 3
Global Optimization II, Section 3.6 (Branch-and-bound for box-constrained problems), part 3
Global Optimization II, Section 3.6 (Branch-and-bound for box-constrained problems), part 2
Global Optimization II, Section 3.6 (Branch-and-bound for box-constrained problems), part 2
Global Optimization II, Section 3.6 (Branch-and-bound for box-constrained problems), part 1
Global Optimization II, Section 3.6 (Branch-and-bound for box-constrained problems), part 1
Global Optimization II, Section 3.5 (Uniformly refined grids), part 3
Global Optimization II, Section 3.5 (Uniformly refined grids), part 3
Global Optimization II, Section 3.5 (Uniformly refined grids), part 2
Global Optimization II, Section 3.5 (Uniformly refined grids), part 2
Global Optimization II, Section 3.5 (Uniformly refined grids), part 1
Global Optimization II, Section 3.5 (Uniformly refined grids), part 1
Global Optimization II, Section 3.4 (Convex relaxation for the alphaBB method), part 5
Global Optimization II, Section 3.4 (Convex relaxation for the alphaBB method), part 5
Global Optimization II, Section 3.4 (Convex relaxation for the alphaBB method), part 4
Global Optimization II, Section 3.4 (Convex relaxation for the alphaBB method), part 4
Global Optimization II, Section 3.4 (Convex relaxation for the alphaBB method), part 3
Global Optimization II, Section 3.4 (Convex relaxation for the alphaBB method), part 3
Global Optimization II, Section 3.4 (Convex relaxation for the alphaBB method), part 2
Global Optimization II, Section 3.4 (Convex relaxation for the alphaBB method), part 2
Global Optimization II, Section 3.4 (Convex relaxation for the alphaBB method), part 1
Global Optimization II, Section 3.4 (Convex relaxation for the alphaBB method), part 1
Global Optimization II, Section 3.3.7 (Further terminology)
Global Optimization II, Section 3.3.7 (Further terminology)
Global Optimization II, Section 3.3.6 (Taylor models)
Global Optimization II, Section 3.3.6 (Taylor models)
Global Optimization II, Section 3.3.5 (Inclusion property)
Global Optimization II, Section 3.3.5 (Inclusion property)
Global Optimization II, Section 3.3.4 (Dependency effect)
Global Optimization II, Section 3.3.4 (Dependency effect)
Global Optimization II, Section 3.3.3 (Natural interval extension)
Global Optimization II, Section 3.3.3 (Natural interval extension)
Global Optimization II, Section 3.3.2 (Basic arithmetic for intervals)
Global Optimization II, Section 3.3.2 (Basic arithmetic for intervals)
Global Optimization II, Section 3.3.1 (Motivation and applications of interval arithmetic)
Global Optimization II, Section 3.3.1 (Motivation and applications of interval arithmetic)
Global Optimization II, Section 3.2 (Convex relaxation), part 3
Global Optimization II, Section 3.2 (Convex relaxation), part 3
Global Optimization II, Section 3.2 (Convex relaxation), part 2
Global Optimization II, Section 3.2 (Convex relaxation), part 2
Global Optimization II, Section 3.2 (Convex relaxation), part 1
Global Optimization II, Section 3.2 (Convex relaxation), part 1
Global Optimization II, Section 3.1 (Examples and a conceptual algorithm)
Global Optimization II, Section 3.1 (Examples and a conceptual algorithm)