**Are you an EPFL student looking for a semester project?**

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

Lecture# Convex Optimization: Convex Functions

Description

This lecture covers the concept of convex functions, including convex sets, hyperplanes, and halfspaces. It delves into the properties of convex functions and their applications in optimization problems. The lecture also discusses the convexity of bivariate functions, the sum of inverse eigenvalues, and support functions of sets.

Official source

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

In course

Related concepts (46)

MGT-418: Convex optimization

This course introduces the theory and application of modern convex optimization from an engineering perspective.

Instructor

Linear algebra

Linear algebra is the branch of mathematics concerning linear equations such as: linear maps such as: and their representations in vector spaces and through matrices. Linear algebra is central to almost all areas of mathematics. For instance, linear algebra is fundamental in modern presentations of geometry, including for defining basic objects such as lines, planes and rotations. Also, functional analysis, a branch of mathematical analysis, may be viewed as the application of linear algebra to spaces of functions.

Kernel (linear algebra)

In mathematics, the kernel of a linear map, also known as the null space or nullspace, is the linear subspace of the domain of the map which is mapped to the zero vector. That is, given a linear map L : V → W between two vector spaces V and W, the kernel of L is the vector space of all elements v of V such that L(v) = 0, where 0 denotes the zero vector in W, or more symbolically: The kernel of L is a linear subspace of the domain V.

Linear subspace

In mathematics, and more specifically in linear algebra, a linear subspace or vector subspace is a vector space that is a subset of some larger vector space. A linear subspace is usually simply called a subspace when the context serves to distinguish it from other types of subspaces. If V is a vector space over a field K and if W is a subset of V, then W is a linear subspace of V if under the operations of V, W is a vector space over K.

Linear map

In mathematics, and more specifically in linear algebra, a linear map (also called a linear mapping, linear transformation, vector space homomorphism, or in some contexts linear function) is a mapping between two vector spaces that preserves the operations of vector addition and scalar multiplication. The same names and the same definition are also used for the more general case of modules over a ring; see Module homomorphism. If a linear map is a bijection then it is called a .

Timekeeping on Mars

Though no standard exists, numerous calendars and other timekeeping approaches have been proposed for the planet Mars. The most commonly seen in the scientific literature denotes the time of year as the number of degrees on its orbit from the northward equinox, and increasingly there is use of numbering the Martian years beginning at the equinox that occurred April 11, 1955. Mars has an axial tilt and a rotation period similar to those of Earth. Thus, it experiences seasons of spring, summer, autumn and winter much like Earth.

Related lectures (95)

Linear Algebra: Matrices and Orthogonal DecompositionMATH-111(a): Linear Algebra

Covers topics in linear algebra such as orthogonal matrices and diagonalization.

Linear Algebra: Orthogonal ProjectionsMATH-111(a): Linear Algebra

Explores orthogonal projections in linear algebra, covering vector projections onto subspaces and least squares solutions.

Convex FunctionsMATH-329: Continuous optimization

Covers the properties and operations of convex functions.

Optimal Transport: Rockafellar TheoremMATH-476: Optimal transport

Explores the Rockafellar Theorem in optimal transport, focusing on c-cyclical monotonicity and convex functions.

Linear Algebra: Bases and DimensionMATH-111(a): Linear Algebra

Covers bases, dimensions, vector spaces, list generators, solution spaces, subspaces, and matrix properties.