Lecture

Convex Concave Configuration

Related lectures (19)

Explores convex polyhedra, linear programs, and their optimization importance.

Separating Hyperplanes: Theory and Applications

Explores separating hyperplanes for two sets X and Y, discussing conditions for separation and implications of convexity.

Faces, Facets and Vertices

Covers the concepts of faces, facets, and vertices in polyhedra, exploring minimal faces and inequalities.

Shadows: Proper and Cast Shadows in Descriptive Geometry

Covers proper and cast shadows in descriptive geometry with practical examples and exercises.

2D Case: Polynomial Encroaching

Covers the 2D case of polynomial encroaching and vertices of polyhedra.

Symmetries of Regular Polyhedra

Explores the historical background and significance of symmetries in regular polyhedra, shedding new light on Euclid's Elements.

Polygons & Polyhedra: Regular & Starred

Explores polygons, polyhedra, regularity, and starred configurations in Euclidean geometry, highlighting historical context and limitations.

Regular Polyhedra: Definitions and Symmetries

Explores the definitions and symmetries of regular polyhedra, focusing on the five known convex regular polyhedra from ancient times.

Regular Polyhedra: Definitions and Symmetries

Explores the definitions and symmetries of regular polyhedra, shedding light on ancient geometry and modern mathematical formalization.

Harmonic Ratio in Geometry

Explores harmonic ratio in geometry, covering bisectors, harmonic segments, polyhedra, spatial curves, and historical perspectives.

Basic Solutions and Polyhedra

Explores extreme points, vertices, and basic feasible solutions in polyhedra, emphasizing their properties and construction.

Cellular Approximation Theorem

Focuses on proving the Cellular Approximation Theorem, introducing polyhedra and piecewise linear maps.

Symmetry in Geometry

Explores symmetry in modern geometry, emphasizing reflections, rotations, and practical applications in computer-aided design.

Convex Optimization: Epigraphs

Explores epigraphs, convexity of bivariate functions, and log-sum-exp functions in convex optimization.

Linear constraints, Feasible directions

Explores feasible directions in optimization algorithms and how to determine them.

Convex Optimization: Introduction and Sets

Covers the fundamentals of convex optimization, including mathematical problems, minimizers, and solution concepts, with an emphasis on efficient methods and practical applications.

Linear and Integer Programming

Covers the theory of linear and integer programming, focusing on the integer hull and rational polyhedra.

From STL to SLI and CLI

Explores the transformation process from .STL to .SLI and .CLI formats.

Convex Optimization

Covers an overview of convex optimization, affine sets, polyhedra, ellipsoids, and convex functions.