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

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

Application of Linearization and Approximation

129
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...
129
Linearization and Approximation01:26

Linearization and Approximation

144
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...
144
Application of Nonlinear Inequalities01:29

Application of Nonlinear Inequalities

286
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...
286
Implicit Differentiation: Problem Solving01:29

Implicit Differentiation: Problem Solving

97
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...
97
Multi-input and Multi-variable systems01:22

Multi-input and Multi-variable systems

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

You might also read

Related Articles

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

Sort by
Same author

Blinded two-phase evaluation of large language models in complex cardiac surgery: task-specific performance and human-AI collaboration.

Frontiers in digital health·2026
Same author

Uniportal Endoscopic Versus Microscopic Unilateral Laminotomy for Bilateral Decompression in the Treatment of Lumbar Spinal Stenosis: A Meta-Analysis.

Neurology India·2026
Same author

Machine Learning-Driven Prediction of Intensive Care Units Mortality and Length of Stay: A 11-Year Retrospective Study in Hong Kong Public Hospitals.

Journal of medical systems·2026
Same author

Impact of Catheter Configuration on the Mapping of Atrial Fibrillation.

Circulation. Arrhythmia and electrophysiology·2026
Same author

A High-Accuracy Probabilistic-Based Sigmoid Approximator Incorporating Memory-Saving and Time-Efficient Strategies.

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

Tibial periosteal distraction for ischemic leg ulcers: animal and clinical cohort study.

BMC medicine·2025
Same journal

Intervention Feasible Region and Driver Risk Capacity Aware Human-Machine Collaborative Safe Trajectory Planning.

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

A Unified Differential Denoising Learning Framework With a Pre-Trained Model and Fuzzy Graph Networks for Drug-Drug Interaction Prediction.

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

Self-Supervised Continuous Dynamic Graph Representation Learning via Hawkes Processes.

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

cPU: Consistent Risk Estimator for Positive-Unlabeled Learning.

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

Tuning-Free Latent Diffusion Models for Ultrahigh-Resolution Image Editing.

IEEE transactions on neural networks and learning systems·2026
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
See all related articles

Related Experiment Video

Updated: Mar 17, 2026

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

Lagrange Programming Neural Network for Nondifferentiable Optimization Problems in Sparse Approximation.

Ruibin Feng, Chi-Sing Leung, Anthony G Constantinides

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

    This study introduces a novel Lagrange programming neural network (LPNN) formulation for sparse approximation, overcoming limitations of previous methods. The new approach effectively solves constrained optimization problems like basis pursuit (BP) and constrained BP denoise (CBPDN).

    Related Experiment Videos

    Last Updated: Mar 17, 2026

    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:

    • Signal Processing
    • Machine Learning
    • Optimization

    Background:

    • Traditional Lagrange programming neural networks (LPNNs) are limited by the requirement for twice-differentiable objective functions and constraints.
    • Sparse approximation, crucial for signal recovery, often involves non-differentiable functions, rendering standard LPNNs unsuitable.
    • Existing locally competitive algorithm (LCA) approaches are restricted to unconstrained optimization problems.

    Purpose of the Study:

    • To develop a new LPNN formulation capable of handling constrained optimization problems in sparse approximation.
    • To address the limitations of existing LPNN and LCA methods for sparse signal recovery.
    • To introduce novel LPNN models for basis pursuit (BP) and constrained basis pursuit denoise (CBPDN).

    Main Methods:

    • A novel LPNN formulation is proposed, integrating concepts from the locally competitive algorithm (LCA).
    • Two specific models, BP-LPNN and CBPDN-LPNN, are developed to solve basis pursuit and constrained basis pursuit denoise problems, respectively.
    • The theoretical convergence and stability of the proposed models are analyzed, demonstrating that equilibrium points correspond to optimal solutions.

    Main Results:

    • The proposed LPNN models successfully solve constrained optimization problems inherent in sparse approximation.
    • Equilibrium points of the BP-LPNN and CBPDN-LPNN models are proven to be the optimal solutions for their respective problems.
    • Simulations confirm the effectiveness and stability of the developed BP-LPNN and CBPDN-LPNN models in sparse approximation tasks.

    Conclusions:

    • The new LPNN formulation effectively extends LPNN capabilities to constrained optimization problems.
    • The proposed BP-LPNN and CBPDN-LPNN models offer a stable and effective solution for sparse approximation tasks.
    • This research advances LPNN applications in signal processing and machine learning by enabling the handling of non-differentiable constraints.