Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

407
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...
407
Application of Linearization and Approximation01:29

Application of Linearization and Approximation

181
A drone flying through complex terrain often relies on more than one sensing method to estimate small changes in altitude. Along with direct measurements, air pressure provides a useful indirect indicator of vertical movement. Atmospheric pressure decreases as altitude increases, and this relationship is commonly described using an exponential model. Although accurate, converting pressure measurements into altitude values requires calculations that are too complex to perform repeatedly during...
181
Linearization and Approximation01:26

Linearization and Approximation

194
Linearization is a mathematical technique used to approximate complex, nonlinear functions with simpler linear models in the vicinity of a chosen reference point. The method is based on the idea that, although a function may be difficult to evaluate exactly, its behavior near a specific input value can often be closely approximated by the tangent line at that point. This approach is particularly useful when small deviations from a known value are involved.Consider the square root function, for...
194
Linear Approximation in Time Domain01:21

Linear Approximation in Time Domain

420
Nonlinear systems often require sophisticated approaches for accurate modeling and analysis, with state-space representation being particularly effective. This method is especially useful for systems where variables and parameters vary with time or operating conditions, such as in a simple pendulum or a translational mechanical system with nonlinear springs.
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
420
Application of Nonlinear Inequalities01:29

Application of Nonlinear Inequalities

314
A nonlinear inequality describes a comparison involving an expression that curves or behaves more complexly than a straight line. These inequalities often appear in forms that include squares, products, or variables in the denominator.To solve such an inequality, one starts by rewriting it so that zero appears on one side. For example, the inequality:  can be factored as: This form makes it easier to identify the values that cause the expression to equal zero. In this case, the...
314
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation01:24

One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation

1.4K
This lesson introduces two critical methods in pharmacokinetics, the Wagner-Nelson and Loo-Riegelman methods, used for estimating the absorption rate constant (ka) for drugs administered via non-intravenous routes. The Wagner-Nelson method relates ka to the plasma concentration derived from the slope of a semilog percent unabsorbed time plot. However, it is limited to drugs with one-compartment kinetics and can be impacted by factors like gastrointestinal motility or enzymatic degradation.
On...
1.4K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Using Well-Understood Single-Objective Functions in Multiobjective Black-Box Optimization Test Suites.

Evolutionary computation·2021
Same author

Benchmarking of continuous black box optimization algorithms.

Evolutionary computation·2012
Same author

Covariance matrix adaptation for multi-objective optimization.

Evolutionary computation·2007
Same author

R-leaping: accelerating the stochastic simulation algorithm by reaction leaps.

The Journal of chemical physics·2006
Same author

An analysis of mutative sigma-self-adaptation on linear fitness functions.

Evolutionary computation·2006
Same author

Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES).

Evolutionary computation·2003
Same journal

Computing Optimal Populations for Binary Problems using Logic Minimization.

Evolutionary computation·2026
Same journal

Enhancing Generalization and Scalability for Multi-Objective Optimization with Population Pre-Training.

Evolutionary computation·2026
Same journal

XCS for Sequential Perceptual Aliasing in Multi-Step Decision Making.

Evolutionary computation·2026
Same journal

A dynamic multi-objective evolutionary algorithm using dual-space prediction and surrogate-based sampling.

Evolutionary computation·2026
Same journal

Adapting MOEA/D to CMA-ES for Dealing with Ill-conditioned Multiobjective Problems.

Evolutionary computation·2026
Same journal

Editorial of the Special Issue: Parallel Problem Solving from Nature PPSN 2024 Extended Versions of Best Paper Candidates.

Evolutionary computation·2026
See all related articles

Related Experiment Video

Updated: Apr 3, 2026

Influence of Step-Width Manipulation on Running Biomechanics
06:53

Influence of Step-Width Manipulation on Running Biomechanics

Published on: February 28, 2025

1.1K

Markov Chain Analysis of Cumulative Step-Size Adaptation on a Linear Constrained Problem.

Alexandre Chotard1, Anne Auger2, Nikolaus Hansen3

  • 1Univ. Paris-Sud, LRI, Rue Noetzlin, Bat 660, 91405 Orsay Cedex France chotard@lri.fr.

Evolutionary Computation
|September 26, 2015
PubMed
Summary
This summary is machine-generated.

This study analyzes a (1, λ)-Evolution Strategy for constrained optimization. Researchers proved algorithm divergence in the constant step-size case, advancing adaptive search understanding.

Keywords:
CMA-ESContinuous optimizationconstrained problemcumulative step-size adaptationevolution strategies

More Related Videos

Design and Application of a Fault Detection Method Based on Adaptive Filters and Rotational Speed Estimation for an Electro-Hydrostatic Actuator
06:45

Design and Application of a Fault Detection Method Based on Adaptive Filters and Rotational Speed Estimation for an Electro-Hydrostatic Actuator

Published on: October 28, 2022

2.2K

Related Experiment Videos

Last Updated: Apr 3, 2026

Influence of Step-Width Manipulation on Running Biomechanics
06:53

Influence of Step-Width Manipulation on Running Biomechanics

Published on: February 28, 2025

1.1K
Design and Application of a Fault Detection Method Based on Adaptive Filters and Rotational Speed Estimation for an Electro-Hydrostatic Actuator
06:45

Design and Application of a Fault Detection Method Based on Adaptive Filters and Rotational Speed Estimation for an Electro-Hydrostatic Actuator

Published on: October 28, 2022

2.2K

Area of Science:

  • Optimization Algorithms
  • Computational Mathematics
  • Evolutionary Computation

Background:

  • Evolution Strategies (ES) are powerful randomized search algorithms.
  • Handling linear constraints in ES is crucial for practical applications.
  • Previous studies often assumed algorithm stability, limiting theoretical insights.

Purpose of the Study:

  • Analyze the behavior of a (1, λ)-Evolution Strategy with linear constraints.
  • Investigate the impact of constant versus adaptive step-sizes on algorithm performance.
  • Provide theoretical guarantees for algorithm convergence or divergence.

Main Methods:

  • Modeling the (1, λ)-Evolution Strategy using Markov chains.
  • Analyzing the stability of the derived Markov chains.
  • Applying the law of large numbers to deduce convergence/divergence properties.

Main Results:

  • Proved algorithm divergence for the constant step-size case.
  • Established Markov chain stability for cumulative step-size adaptation with a parameter of 1.
  • Identified key parameters influencing divergence/convergence rates.

Conclusions:

  • The study provides theoretical validation for the divergence of (1, λ)-Evolution Strategies under specific conditions.
  • Results offer a deeper understanding of constrained optimization using adaptive search.
  • The work complements existing literature by not assuming stability upfront.