Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Gaussian Elimination: Problem Solving

Gaussian Elimination: Problem Solving

Systems of linear equations in several variables are pivotal in modeling complex scenarios involving multiple unknowns and constraints. Such systems are widely used in various fields to represent relationships where several conditions must be simultaneously satisfied. Each variable in the system corresponds to an unknown quantity, while each equation imposes a linear constraint, leading to a structured approach for analyzing and solving real-world problems.A system of three equations with three...

Partial Fractions

Partial Fractions

A partial fraction is a component of a rational expression represented as the sum of simpler fractions. When a rational function is expressed as a ratio of two polynomials, it can often be decomposed into a sum of fractions whose denominators are simpler polynomials, typically linear or irreducible quadratic factors. This process is called partial fraction decomposition, and it is used to simplify complex expressions for integration, solving equations, or analysis.Partial fraction decomposition...

Compacting Factor test

Compacting Factor test

The compacting factor test is a method used to assess the workability of concrete. It is especially suitable for concrete mixes containing aggregates up to one and a half inches in size. This test involves specialized equipment consisting of two truncated cone-shaped hoppers and a cylinder, all with polished interior surfaces to minimize friction.
The procedure begins by placing concrete into the upper hopper without any compaction. Once filled, the bottom door of this hopper is opened,...

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

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

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...

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

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...

Extraction: Partition and Distribution Coefficients

Extraction: Partition and Distribution Coefficients

The distribution law or Nernst's distribution law is the law that governs the distribution of a solute between two immiscible solvents. This law, also known as the partition law, states that if a solute is added to the mixture of two immiscible solvents at a constant temperature, the solute is distributed between the two solvents in such a way that the ratio of solute concentrations in the solvents remains constant at equilibrium.
For extracting a solute from an aqueous phase into an organic...

You might also read

Related Articles

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

Sort by

Same author

Natural variations in GhNF-YB3 contribute to seed cotton yield by modulating source-to-sink sucrose allocation.

The Plant cell·2026

Same author

FX-Cell: a method for single-cell RNA sequencing on difficult-to-digest and cryopreserved plant samples.

Nature methods·2025

Same author

Linear convergence of proximal gradient method for linear sparse SVM.

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

Same author

Local signal detection on irregular domains with generalized varying coefficient models.

Journal of the American Statistical Association·2025

Same author

A unified cell atlas of vascular plants reveals cell-type foundational genes and accelerates gene discovery.

Cell·2025

Same author

Decentralized Nonconvex Low-rank Matrix Recovery.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2025

Search research articles

Related Experiment Video

Updated: Jul 5, 2026

Application of Unsupervised Multi-Omic Factor Analysis to Uncover Patterns of Variation and Molecular Processes Linked to Cardiovascular Disease

Application of Unsupervised Multi-Omic Factor Analysis to Uncover Patterns of Variation and Molecular Processes Linked to Cardiovascular Disease

Published on: September 20, 2024

Decentralized ADMM for factorization-based Low-rank matrix estimation.

Zihao Song¹, Weihua Zhao¹, Rui Li²

¹School of Mathematics and Statistics, Nantong University, Nantong, China.

Neural Networks : the Official Journal of the International Neural Network Society

|July 3, 2026

Summary

This summary is machine-generated.

This study introduces a new algorithm for distributed low-rank matrix recovery, even with non-convex factorization. The method achieves convergence, demonstrating its effectiveness in numerical tests.

Keywords:

Alternating direction method of multipliers Distributed estimation Factorized gradient descent Linear convergence

Related Experiment Videos

Last Updated: Jul 5, 2026

Application of Unsupervised Multi-Omic Factor Analysis to Uncover Patterns of Variation and Molecular Processes Linked to Cardiovascular Disease

Application of Unsupervised Multi-Omic Factor Analysis to Uncover Patterns of Variation and Molecular Processes Linked to Cardiovascular Disease

Published on: September 20, 2024

Area of Science:

Optimization
Distributed Computing
Machine Learning

Background:

Low-rank matrix recovery is crucial in data analysis.
Distributed settings present unique challenges for optimization.
Non-convex factorization complicates standard recovery methods.

Purpose of the Study:

To develop a method for low-rank matrix recovery in a distributed setting.
To address challenges posed by convex loss and non-convex factorization.
To analyze the convergence properties of the proposed algorithm.

Main Methods:

A linearized and decentralized alternating direction method of multipliers (ADMM) algorithm was employed.
The algorithm computes a consensus solution across distributed nodes.
Convergence analysis was performed for the non-convex optimization problem.

Main Results:

Local linear convergence was established for the ADMM-based method.
Convergence holds up to approximation error when the solution is not perfectly low-rank.
Numerical examples validated the algorithm's performance.

Conclusions:

The proposed linearized and decentralized ADMM is effective for distributed low-rank matrix recovery.
The method demonstrates convergence guarantees despite non-convexity.
This work provides a robust approach for handling complex matrix recovery problems in distributed systems.