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

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

Application of Linearization and Approximation

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

Linearization and Approximation

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

Application of Nonlinear Inequalities

357
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...
357
Linear Approximation in Time Domain01:21

Linear Approximation in Time Domain

460
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,...
460
Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

502
Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....
502

You might also read

Related Articles

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

Sort by
Same author

Ectopic ureter opening into the vagina in an adult with duplex kidney: a case report and literature review.

Frontiers in surgery·2026
Same author

A dual-response near-infrared fluorescent probe for hypochlorite and viscosity detection in ferroptosis and rheumatoid arthritis model.

Talanta·2026
Same author

Thermodynamics and Kinetics Study on the Reactive Crystallization Process of Cerium Oxalate.

ACS omega·2026
Same author

Preclinical efficacy of engineered CircRNA-GDF15@LNP for sustained weight loss and metabolic regulation in diet-induced obese mice.

Journal of controlled release : official journal of the Controlled Release Society·2026
Same author

The SIRT1-p53 axis drives a ferro-aging-like program and aggravates trophoblast dysfunction in preeclampsia.

Frontiers in aging·2026
Same author

Specific inhibition of NLRP3 inflammasome by a Smurf1 inhibitor <i>in vitro</i> and <i>in vivo</i>.

Open medicine (Warsaw, Poland)·2026

Related Experiment Video

Updated: Apr 30, 2026

Deep Neural Networks for Image-Based Dietary Assessment
13:19

Deep Neural Networks for Image-Based Dietary Assessment

Published on: March 13, 2021

11.0K

Neural network for nonsmooth, nonconvex constrained minimization via smooth approximation.

Wei Bian, Xiaojun Chen

    IEEE Transactions on Neural Networks and Learning Systems
    |May 9, 2014
    PubMed
    Summary

    A novel neural network solves nonsmooth, nonconvex optimization problems. This method finds Clarke stationary points efficiently without requiring feasible starting points or exact penalty parameters.

    Related Experiment Videos

    Last Updated: Apr 30, 2026

    Deep Neural Networks for Image-Based Dietary Assessment
    13:19

    Deep Neural Networks for Image-Based Dietary Assessment

    Published on: March 13, 2021

    11.0K

    Area of Science:

    • Optimization Theory
    • Computational Mathematics
    • Artificial Intelligence

    Background:

    • Nonsmooth and nonconvex constrained optimization problems present significant computational challenges.
    • Existing algorithms often require feasible initial points or precise parameter tuning.

    Purpose of the Study:

    • To introduce a neural network approach for solving a specific class of nonsmooth, nonconvex constrained optimization problems.
    • To demonstrate the global convergence properties and practical efficiency of the proposed method.

    Main Methods:

    • A neural network based on smoothing approximation is employed.
    • The method follows a continuous path defined by an ordinary differential equation to find a Clarke stationary point.
    • Global convergence is guaranteed under specific conditions (bounded feasible set or level bounded objective function).

    Main Results:

    • The proposed neural network successfully finds Clarke stationary points for the target optimization problems.
    • It avoids common limitations such as requiring feasible initial points or exact penalty parameters.
    • Numerical experiments confirm the method's efficiency compared to existing algorithms.

    Conclusions:

    • The presented neural network offers an effective and robust solution for nonsmooth, nonconvex constrained optimization.
    • This approach simplifies the solution process by removing stringent initial requirements and parameter sensitivity.
    • The findings highlight the potential of neural networks in addressing complex optimization challenges.