Scribd
Upload
13 views3 pages

Introduction to Local and Global Optima

The document discusses the concepts of local and global optima in mathematical optimization problems. A local optimum is an extrema point within a region that is optimal for that region, but not necessarily for the whole problem. A global optimum is the single best solution when considering the entire input space.

Uploaded by

Abhinaw
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
13 views3 pages

Introduction to Local and Global Optima

The document discusses the concepts of local and global optima in mathematical optimization problems. A local optimum is an extrema point within a region that is optimal for that region, but not necessarily for the whole problem. A global optimum is the single best solution when considering the entire input space.

Uploaded by

Abhinaw
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

In the previous post, I argued that many people unknowingly subscribe to a defunct

management philosophy: that you can improve the overall performance of a system (such
as a company) by individually improving the performance of its parts.
These isolated improvements are known as “local optima.” A local optimum is whatever is
best for the performance of one individual part, whereas the global optimum is what is best
for the performance of the system as a whole.
To put our previous conclusion a different way: adding up a series of local optima does not
automatically lead to a global optimum. In fact, it can lead to the exact opposite.
This is perhaps the most counterintuitive aspect of complex systems: that individually
optimizing the performance of each part results in an overall system that is severely under-
optimized. The more you “improve” each part of a system, the worse overall performance
gets.

1. Overview

Q 1. ಪದಗಳ ಅರ್ಥ ಬರೆಯಿರಿ. Write meanings


1.ವನ forest
2.ವಚನ promise
3.ಕರಗ village festival
4. ಸಲಗ wild elephant

Q II. ಚಿತ್ರಕ್ಕೆ ಸಂಬಂಧಿಸಿದ ಪದ ಗುರುತಿಸಿ

Choose the correct word for the picture.

In this tutorial, we’ll talk about the concepts of local and global optima in an
optimization problem. First, we’ll make an introduction to mathematical optimization.
Then, we’ll define the two terms and briefly present some algorithms for computing them.

2. Prerequisites
First, let’s briefly introduce the basic terms of optimization.
A mathematical optimization problem consists of three basic components:
 The objective function is the value we want to optimize
 The decision variables are the inputs of the objective function we can
control
 The constraints restrict the range of values the decision variables can take

So, the goal is to find the optimal values of the decision variables that satisfy the
constraints and optimize (maximize or minimize) the value of . However, as the
problem becomes more complex, finding the optimal values becomes more difficult. So,
sometimes it is easier to find some values that are not optimal but are good enough for the
problem. In this case, we have a local optimal.

3. Local Optima
A local optimum is an extrema (maximum or minimum) point of the objective
function for a certain region of the input space. More formally, for the minimization
case is a local minimum of the objective function if:

for all values of x in range .

4. Global Optima
A global optimum is the maximum or minimum value the objective function can take
in all the input space. More formally, for the minimization case is a global
minimum of the objective function if:

for all values of x.


In the image below, we can see an example of a local and a global maximum:
We observe that is the global maximum of the function since in , the function takes
the higher value. However, if we consider only the region of negative numbers, is the
maximum in this region. So, is a local maximum.
In case the objective function contains more than one global optima, the optimization
problem is referred to as multimodal. In this case, there are multiple values of the
decision variables that optimize the objective function

Common questions

Powered by AI

Local optima refer to the best performance within a specific subset or region of a system, whereas global optima represent the best performance for the entire system. Pursuing local optima often does not lead to the global optimum and can result in an overall system that is under-optimized . Global optima provide the highest possible optimization for the entire input space of a system .

Decision variables are the elements of the optimization problem we can control and adjust to affect the outcome of the objective function. Constraints are the rules that limit the values decision variables can take, shaping the feasible region of solutions. The goal of mathematical optimization is to find the optimal values of the decision variables that satisfy these constraints while optimizing the objective function .

Accepting a local optimum can be practical due to time, computational resources, or complexity constraints. In some cases, the cost of finding the global optimum may outweigh the benefits, especially when a local optimum provides a sufficiently good solution that meets the immediate needs or constraints of the situation .

The objective function is the value that needs to be optimized, either maximized or minimized, in an optimization problem. Decision variables are inputs to this function; by manipulating these variables, the objective function's value can be changed. Therefore, the objective of optimization is to find the decision variable values that yield the optimal value for the objective function .

Focusing exclusively on local optimizations can lead to neglecting the broader system interactions and dependencies in a company. This narrow focus may result in insufficient resource allocation and missed opportunities for synergy, ultimately hindering the potential for overall performance improvements and competitiveness .

The pursuit of local optima is misleading because it may suggest improvement without contributing to the best configuration for the entire system. By focusing on local improvements, managers may neglect interdependencies and the overall strategy required for the system to reach a global optimum, potentially resulting in a less effective system overall .

Optimizing individual parts of a system can lead to suboptimal overall performance because such improvements may not align with what is best for the entire system. The attempt to achieve local optima can detract from achieving a global optimum, as the improvements do not necessarily add up to better system-wide performance and can even interfere with each other .

The presence of multiple local optima requires careful strategy selection in mathematical optimization to avoid getting stuck at suboptimal solutions. Techniques such as global search algorithms or metaheuristic approaches like simulated annealing or genetic algorithms may be employed to explore a wider area of the solution space, increasing the chance of finding a global optimum .

Global optima computation is more challenging because it requires evaluating the entire input space to find the absolute best solution. In contrast, finding local optima involves only a subset of the input space. In complex systems with many variables and constraints, calculating global optima is difficult, leading practitioners to settle for local optima, which are easier to compute though potentially suboptimal for the overall system .

A multimodal optimization problem has more than one global optimum, meaning there are multiple sets of decision variables that achieve the highest possible value of the objective function. This complexity requires more sophisticated algorithms to identify all possible optima rather than a single solution, making the search process more intricate .

You might also like