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

Randomized Experiments01:13

Randomized Experiments

6.3K
The randomization process involves assigning study participants randomly to experimental or control groups based on their probability of being equally assigned. Randomization is meant to eliminate selection bias and balance known and unknown confounding factors so that the control group is similar to the treatment group as much as possible. A computer program and a random number generator can be used to assign participants to groups in a way that minimizes bias.
Simple randomization
Simple...
6.3K
Methods of Medium Optimization01:28

Methods of Medium Optimization

69
Optimizing growth media enhances microbial proliferation and maximizes product yield. Statistical experimental design methodologies provide structured and reproducible approaches, offering progressively higher levels of robustness and efficiency.The One-Factor-at-a-Time (OFAT) MethodThe One-Factor-at-a-Time (OFAT) method involves adjusting a single variable while keeping all others constant. However, it cannot detect interactions between variables, often leading to suboptimal outcomes when...
69
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

437
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...
437
Sequence Networks of Rotating Machines01:24

Sequence Networks of Rotating Machines

590
A Y-connected synchronous generator, grounded through a neutral impedance, is designed to produce balanced internal phase voltages with only positive-sequence components. The generator's sequence networks include a source voltage that is exclusively in the positive-sequence network. The sequence components of line-to-ground voltages at the generator terminals illustrate this configuration.
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...
590
Multi-input and Multi-variable systems01:22

Multi-input and Multi-variable systems

540
Cruise control systems in cars are designed as multi-input systems to maintain a driver's desired speed while compensating for external disturbances such as changes in terrain. The block diagram for a cruise control system typically includes two main inputs: the desired speed set by the driver and any external disturbances, such as the incline of the road. By adjusting the engine throttle, the system maintains the vehicle's speed as close to the desired value as possible.
In the absence of...
540
Implicit Differentiation: Problem Solving01:29

Implicit Differentiation: Problem Solving

183
Curves defined implicitly, where variables cannot be separated algebraically, require specialized techniques for analysis. The conchoid of Nicomedes exemplifies such a case. Its equation links x and y in a way that prevents isolation of one variable, making implicit differentiation essential to determine the slope and behavior at any point on the curve.The implicit form of the conchoid can be expressed as:To differentiate this equation, y is treated as a function of x, and the chain rule is...
183

You might also read

Related Articles

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

Sort by
Same author

Learning-based minimum cost strategies for set reachability of Boolean control networks under data injection attacks.

Neural networks : the official journal of the International Neural Network Society·2025
Same author

Optimal Strategies in Multiplayer Reach-Avoid Games With Different Speed Ratios.

IEEE transactions on cybernetics·2025
Same author

On General Linear Encoding-Decoding Pairs for Quantized Iterative Learning Control.

IEEE transactions on cybernetics·2025
Same author

Decentralized Online Optimization With Compressed Communication Over Directed Graphs.

IEEE transactions on neural networks and learning systems·2025
Same author

Event-Triggered Consensus Tracking for Multiagent Systems With Unknown Time-Varying Control Directions and Input Delays.

IEEE transactions on cybernetics·2025
Same author

Dynamic Regret of Quantized Distributed Online Bandit Optimization in Zero-Sum Games.

IEEE transactions on cybernetics·2025
Same journal

Hidden Data Recovery and Forecasting via Next-Generation Reservoir Computing With Multiscale Delay Selection.

IEEE transactions on neural networks and learning systems·2026
Same journal

CAFF-CIL: Causality-Aware Freedom Forgetting Approach for Class-Incremental Learning.

IEEE transactions on neural networks and learning systems·2026
Same journal

Harmonic Autoencoding Framework for Multiple Tasks in Magnetic Particle Imaging Reconstruction.

IEEE transactions on neural networks and learning systems·2026
Same journal

A Survey on Human-Centric Voice-Face Multimodal Learning.

IEEE transactions on neural networks and learning systems·2026
Same journal

Vision-Assisted Foundation Model for Solving Multitask Vehicle Routing Problems.

IEEE transactions on neural networks and learning systems·2026
Same journal

FP3O: Enabling Proximal Policy Optimization in Multiagent Cooperation With Parameter-Sharing Versatility.

IEEE transactions on neural networks and learning systems·2026
See all related articles

Related Experiment Videos

Randomized gradient-free method for multiagent optimization over time-varying networks.

Deming Yuan, Daniel W C Ho

    IEEE Transactions on Neural Networks and Learning Systems
    |August 8, 2014
    PubMed
    Summary
    This summary is machine-generated.

    This study introduces a novel randomized derivative-free method for multiagent optimization problems with time-varying networks. The approach avoids subgradient computations, enabling convergence to approximate solutions for complex, nonsmooth functions.

    Related Experiment Videos

    Area of Science:

    • Optimization
    • Network Science
    • Algorithm Design

    Background:

    • Multiagent optimization problems often involve complex, nonsmooth functions.
    • Existing methods frequently require subgradient computations, limiting applicability.
    • Network topologies can be dynamic and time-varying.

    Purpose of the Study:

    • To develop a derivative-free optimization method for multiagent systems.
    • To address problems with nonsmooth, Lipschitz continuous functions and time-varying networks.
    • To eliminate the need for subgradient calculations by agents.

    Main Methods:

    • A randomized derivative-free optimization algorithm is proposed.
    • The method utilizes random gradient-free oracles for updates.
    • Convergence is analyzed for time-varying network topologies and convex state constraints.

    Main Results:

    • The proposed method converges to an approximate solution for the multiagent optimization problem.
    • Convergence error depends on the smoothing parameter and Lipschitz constants.
    • A numerical example validates the method's effectiveness.

    Conclusions:

    • The derivative-free approach offers a viable alternative for multiagent optimization.
    • This method expands the applicability to systems where subgradients are inaccessible.
    • The study demonstrates practical utility through numerical validation.