Optimal Power Flow and Chebyshev Introduction

This lecture covers topics related to Optimal Power Flow (OPF) solutions, including Semidefinite Programming (SDP), Non-convex problems, and Gradient Descent methods. It also introduces Chebyshev's inequality and its applications in probability distributions and Concentration Inequalities. The instructor, Bahar Taskesen, discusses the optimization of probability distributions using SDP and the derivation of Chebyshev's inequality. The lecture concludes with a numerical example demonstrating the estimation of system safety probabilities and the use of SDP for probability bounding.

About this result

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.

Related lectures (32)

Related concepts (36)

MGT-418: Convex optimization

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

Numerical analysis

Numerical analysis is the study of algorithms that use numerical approximation (as opposed to symbolic manipulations) for the problems of mathematical analysis (as distinguished from discrete mathematics). It is the study of numerical methods that attempt at finding approximate solutions of problems rather than the exact ones. Numerical analysis finds application in all fields of engineering and the physical sciences, and in the 21st century also the life and social sciences, medicine, business and even the arts.

Numerical stability

In the mathematical subfield of numerical analysis, numerical stability is a generally desirable property of numerical algorithms. The precise definition of stability depends on the context. One is numerical linear algebra and the other is algorithms for solving ordinary and partial differential equations by discrete approximation. In numerical linear algebra, the principal concern is instabilities caused by proximity to singularities of various kinds, such as very small or nearly colliding eigenvalues.

Numerical integration

In analysis, numerical integration comprises a broad family of algorithms for calculating the numerical value of a definite integral, and by extension, the term is also sometimes used to describe the numerical solution of differential equations. This article focuses on calculation of definite integrals. The term numerical quadrature (often abbreviated to quadrature) is more or less a synonym for numerical integration, especially as applied to one-dimensional integrals.

Power-flow study

In power engineering, the power-flow study, or load-flow study, is a numerical analysis of the flow of electric power in an interconnected system. A power-flow study usually uses simplified notations such as a one-line diagram and per-unit system, and focuses on various aspects of AC power parameters, such as voltages, voltage angles, real power and reactive power. It analyzes the power systems in normal steady-state operation. Power-flow or load-flow studies are important for planning future expansion of power systems as well as in determining the best operation of existing systems.

Power system simulation

Electrical power system simulation involves power system modeling and network simulation in order to analyze electrical power systems using design/offline or real-time data. Power system simulation software's are a class of computer simulation programs that focus on the operation of electrical power systems. These types of computer programs are used in a wide range of planning and operational situations for electric power systems.

Newton Method: Convergence and Quadratic Care MATH-351: Advanced numerical analysis

Covers the Newton method and its convergence properties near the optimal point.

Trade-offs in Data and Time EE-556: Mathematics of data: from theory to computation

Explores trade-offs between data and time in computational problems, emphasizing diminishing returns and continuous trade-offs.

Probability Theory: Midterm Solutions MATH-232: Probability and statistics

Covers the solutions to the midterm exam of a Probability Theory course, including calculations of probabilities and expectations.

Unsupervised Learning: PCA & K-means ME-390: Foundations of artificial intelligence

Covers unsupervised learning with PCA and K-means for dimensionality reduction and data clustering.

Variational Problems: Convexity and Coercivity MATH-604: Some Aspects of Calculus of Variations

Explores variational problems, emphasizing convexity and coercivity conditions in functionals with integral side constraints.