Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Optimization in Engineering

In course

PHYS-324: Classical electrodynamics

The goal of this course is the study of the physical and conceptual consequences of Maxwell equations. ...

Description

This lecture covers the application of optimization techniques in engineering, focusing on solving complex problems efficiently. Topics include mathematical modeling, constraint handling, and algorithm selection. The instructor discusses various optimization methods such as gradient descent, genetic algorithms, and simulated annealing.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructor

Victor Gorbenko

Official source

Related concepts (32)

Genetic algorithm

In computer science and operations research, a genetic algorithm (GA) is a metaheuristic inspired by the process of natural selection that belongs to the larger class of evolutionary algorithms (EA). Genetic algorithms are commonly used to generate high-quality solutions to optimization and search problems by relying on biologically inspired operators such as mutation, crossover and selection. Some examples of GA applications include optimizing decision trees for better performance, solving sudoku puzzles, hyperparameter optimization, causal inference, etc.

Engineering

Engineering is the practice of using natural science, mathematics, and the engineering design process to solve problems, increase efficiency and productivity, and improve systems. Modern engineering comprises many subfields which include designing and creating infrastructure, machinery, vehicles, electronics, materials, and energy. The discipline of engineering encompasses a broad range of more specialized fields of engineering, each with a more specific emphasis on particular areas of applied mathematics, applied science, and types of application.

Simulated annealing

Simulated annealing (SA) is a probabilistic technique for approximating the global optimum of a given function. Specifically, it is a metaheuristic to approximate global optimization in a large search space for an optimization problem. For large numbers of local optima, SA can find the global optima. It is often used when the search space is discrete (for example the traveling salesman problem, the boolean satisfiability problem, protein structure prediction, and job-shop scheduling).

Chromosome (genetic algorithm)

In genetic algorithms (GA), or more general, evolutionary algorithms (EA), a chromosome (also sometimes called a genotype) is a set of parameters which define a proposed solution of the problem that the evolutionary algorithm is trying to solve. The set of all solutions, also called individuals according to the biological model, is known as the population. The genome of an individual consists of one, more rarely of several, chromosomes and corresponds to the genetic representation of the task to be solved.

Memetic algorithm

A memetic algorithm (MA) in computer science and operations research, is an extension of the traditional genetic algorithm (GA) or more general evolutionary algorithm (EA). It may provide a sufficiently good solution to an optimization problem. It uses a suitable heuristic or local search technique to improve the quality of solutions generated by the EA and to reduce the likelihood of premature convergence. Memetic algorithms represent one of the recent growing areas of research in evolutionary computation.

Related lectures (33)

Energy Systems Optimization

Explores energy systems modeling, optimization, and cost analysis for efficient operations.

Energy Systems Optimization

Introduces a course on modeling and optimizing energy systems, emphasizing the importance of informed decision-making and teamwork in addressing energy challenges.

Continuum Mechanics: Fundamentals and Applications

Explores Continuum Mechanics, focusing on the continuum hypothesis and its practical applications in engineering and physical sciences.

Optimization with Constraints: Theory and Applications

Covers the theory and applications of optimization with constraints, including key concepts and numerical methods.

Linear Optimization Techniques: Problem Solving Approaches