KIT Library
suchen
KIT-Bibliothek
KIT Library Media Portal

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

This audio or video file is copyrighted. Access is only allowed via computers of the Karlsruhe Institute of Technology (KIT).

Author

Oliver Stein

Participating institute

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

Genre

Vorlesung

Description

Lectures on nonconvex global optimization at Karlsruhe Institute of Technology

Duration (hh:mm:ss)

00:27:35

Series

Global Optimization II

Published on

23.03.2022

Subject area

Economics

License

KITopen Licence

Resolution 1280 x 720 Pixel
Aspect ratio 16:9
Audio bitrate 129938 bps
Audio channels 2
Audio Codec aac
Audio Sample Rate 48000 Hz
Total Bitrate 936239 bps
Color Space yuv420p
Container mov,mp4,m4a,3gp,3g2,mj2
Media Type video/mp4
Duration 1655 s
Filename DIVA-2022-98_hd.mp4
File Size 193.684.579 byte
Frame Rate 25
Video Bitrate 800361 bps
Video Codec h264

Embed Code

Global Optimization II Episodes 1-29 of 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)