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

Vector Algebra: Graphical Method01:10

Vector Algebra: Graphical Method

16.5K
Vectors can be multiplied by scalars, added to other vectors, or subtracted from other vectors. The vector sum of two (or more) vectors is called the resultant vector or, for short, the resultant.
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
16.5K
Graphical Representation of Inequalities01:28

Graphical Representation of Inequalities

133
The graph of the equation where y equals x squared forms a curve known as a parabola. This curve acts as a boundary in the coordinate plane, dividing it into distinct regions based on the relative position of points.When the equality sign in the equation is replaced with an inequality—such as greater than, less than, greater than or equal to, or less than or equal to—the graphical representation changes from a single curve into a broader shaded area that signifies the set of all...
133
Block Diagram Reduction01:22

Block Diagram Reduction

466
The process of deriving the transfer function of a control system often involves reducing its block diagram to a single block. This simplification can be achieved through a series of strategic operations, including relocating branch points and comparators. These operations preserve the overall function of the system while allowing for easier manipulation and combination of blocks.
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
466
Fast Decoupled and DC Powerflow01:24

Fast Decoupled and DC Powerflow

682
The fast decoupled power flow method addresses contingencies in power system operations, such as generator outages or transmission line failures. This method provides quick power flow solutions, essential for real-time system adjustments. Fast decoupled power flow algorithms simplify the Jacobian matrix by neglecting certain elements, leading to two sets of decoupled equations:
682
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

245
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...
245
Area Computation by the Alternative Coordinate Method01:24

Area Computation by the Alternative Coordinate Method

491
The alternative coordinate method, also known as the Shoelace Formula, is a technique for determining the area of a traverse using Cartesian coordinates. This method relies on the sequential arrangement of x and y coordinates for each point of the shape, ensuring accuracy and ease of application.In this approach, each corner's x and y coordinates are listed as fractions, with the x-coordinate as the numerator and the y-coordinate as the denominator. These coordinates are arranged sequentially...
491

You might also read

Related Articles

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

Sort by
Same author

[Study of electroreflectance spectrum and Franz-Keldysh effect at metal-GaAs interfaces].

Guang pu xue yu guang pu fen xi = Guang pu·2008
Same author

[Study on electro-degradation of new conjugated polymer PFO-BT15 light emitting diodes].

Guang pu xue yu guang pu fen xi = Guang pu·2008
Same author

Comparison of the curative effects of video assisted thoracoscopic anterior correction and small incision, thoracotomic anterior correction for idiopathic thoracic scoliosis.

Chinese medical journal·2008
Same author

Distribution and sources of mercury in soils from former industrialized urban areas of Beijing, China.

Environmental monitoring and assessment·2008
Same author

[Main flavonoids from Sophora flavescenes].

Yao xue xue bao = Acta pharmaceutica Sinica·2008
Same author

External validation and prediction employing the predictive squared correlation coefficient test set activity mean vs training set activity mean.

Journal of chemical information and modeling·2008
Same journal

Robust Semiglobal and Global Stabilization for Nonlinear Normal Form Systems by Time-Varying Feedback.

IEEE transactions on cybernetics·2026
Same journal

Adaptive Global Asymptotic Output Stabilization of Uncertain Nonlinear Systems Under Dynamic State/Input Quantization.

IEEE transactions on cybernetics·2026
Same journal

Accelerated Distributed Gradient Tracking for Constrained Aggregative Optimization Over Time-Varying Digraphs.

IEEE transactions on cybernetics·2026
Same journal

Small-Gain-Based Plug-and-Play Distributed Control Framework for DC Microgrids With Decentralized Reconfiguration.

IEEE transactions on cybernetics·2026
Same journal

Prescribed-Time Impulsive Control of High-Order Integrator Systems.

IEEE transactions on cybernetics·2026
Same journal

Relaxed Stability Conditions for Model Predictive Control of Hybrid Dynamical Systems Using Hybrid Recurrent Neural Networks.

IEEE transactions on cybernetics·2026
See all related articles

Related Experiment Video

Updated: Jan 2, 2026

Operation of the Collaborative Composite Manufacturing CCM System
10:09

Operation of the Collaborative Composite Manufacturing CCM System

Published on: October 1, 2019

7.0K

Graph Simplification-Aided ADMM for Decentralized Composite Optimization.

Bin Wang, Jun Fang, Huiping Duan

    IEEE Transactions on Cybernetics
    |December 14, 2019
    PubMed
    Summary
    This summary is machine-generated.

    This study introduces a new decentralized optimization method using simplest bipartite graphs to speed up convergence. It avoids extra terms in alternating direction method of multipliers (ADMM) algorithms for faster results.

    Related Experiment Videos

    Last Updated: Jan 2, 2026

    Operation of the Collaborative Composite Manufacturing CCM System
    10:09

    Operation of the Collaborative Composite Manufacturing CCM System

    Published on: October 1, 2019

    7.0K

    Area of Science:

    • Optimization Theory
    • Distributed Systems
    • Graph Theory

    Background:

    • Decentralized composite optimization problems involve agents with private convex functions communicating over a network.
    • Existing alternating direction method of multipliers (ADMM) algorithms often require proximal terms, which hinder convergence speed.

    Purpose of the Study:

    • To develop a novel decentralized composite optimization algorithm with enhanced convergence speed.
    • To eliminate the need for extra proximal terms in ADMM frameworks for decentralized optimization.

    Main Methods:

    • Introduction of the 'simplest bipartite graph' concept, defined by a minimum number of edges for connectivity.
    • Development of a two-step message passing procedure to identify the simplest bipartite graph.
    • Formulation of a proximal-term-free ADMM leveraging the properties of the simplest bipartite graph.

    Main Results:

    • The simplest bipartite graph possesses unique properties beneficial for decentralized optimization.
    • The proposed ADMM algorithm effectively performs decentralized composite optimization without extra proximal terms.
    • Simulation results demonstrate significantly faster convergence compared to existing state-of-the-art decentralized algorithms.

    Conclusions:

    • The simplest bipartite graph provides a novel structural basis for efficient decentralized optimization.
    • The developed ADMM algorithm offers a faster and more efficient approach to decentralized composite optimization problems.