Localization for solving noisy multi-objective optimization problems

Lam T Bui1, Hussein A Abbass, Daryl Essam

  • 1The Artificial Life and Adaptive Robotics Laboratory, School of ITEE, University of New South Wales, ADFA Campus, Canberra, 2600, Australia. lam.bui07@gmail.com

Evolutionary Computation
|August 28, 2009
PubMed

Related Concept Videos

Lagrange Multipliers: Two Constraints01:28

Lagrange Multipliers: Two Constraints

The method of Lagrange multipliers with two constraints is used to optimize a function subject to two independent constraints. In many applications, the objective function represents a quantity to be maximized or minimized, such as cost, area, distance, or energy. The two constraints represent requirements that the solution must satisfy, such as fixed volume, limited resources, or prescribed dimensions.For a function of three variables, each constraint forms a surface in three-dimensional space.
Lagrange Multipliers: Problem Solving01:30

Lagrange Multipliers: Problem Solving

A silo with a cylindrical base, flat bottom, and hemispherical roof is a common design in agricultural and industrial storage due to its structural efficiency and ease of construction. Optimizing its dimensions to maximize storage capacity for a given amount of material—i.e., a fixed surface area—is a classic problem in applied calculus and engineering design. The key parameters are the radius r of the base and the height h of the cylindrical section.The total volume of the silo is obtained by...
Optimization Problems01:26

Optimization Problems

Optimization problems often involve identifying maximum or minimum values under specific constraints. A well-known example is determining the longest horizontal pipe that can be moved around a right-angled corner, where a 3-meter-wide hallway meets a 2-meter-wide hallway. This scenario, common in architectural design and industrial transport, can be understood conceptually through geometric and trigonometric reasoning.To visualize the problem, consider the pipe as a straight line that touches...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Lagrange Multipliers: One Constraint01:29

Lagrange Multipliers: One Constraint

In constrained optimization, the objective is to maximize or minimize a quantity while satisfying a fixed condition. A standard example is a rectangular pen built against a barn wall using 100 meters of fencing. Because the wall provides one side of the enclosure, only the other three sides require fencing. The problem is to find the dimensions that produce the greatest possible area.Let L represent the length parallel to the wall and W the width perpendicular to it. The area of the pen is A =...
Local Maximum and Minimum Values01:31

Local Maximum and Minimum Values

In multivariable calculus, a function of two variables can exhibit local maximum or minimum values at certain points on its surface. A local maximum occurs when the function's value at a point is greater than at all nearby points, while a local minimum occurs when the function’s value is less than at all nearby locations. These points are referred to as local extrema and are of central importance in optimization problems.Local extrema are found at critical points, where the surface becomes...