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

Lagrange Multipliers: Two Constraints01:28

Lagrange Multipliers: Two Constraints

The method of Lagrange multipliers with two constraints is used to optimize a function subject to two independent constraints. In many applications, the objective function represents a quantity to be maximized or minimized, such as cost, area, distance, or energy. The two constraints represent requirements that the solution must satisfy, such as fixed volume, limited resources, or prescribed dimensions.For a function of three variables, each constraint forms a surface in three-dimensional space.
Application of Nonlinear Inequalities01:29

Application of Nonlinear Inequalities

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 key values are 3...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

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...
Maximizing the Directional Derivative01:25

Maximizing the Directional Derivative

The directional derivative is a central concept in multivariable calculus that describes how a function changes at a given point when moving in a specified direction. This direction is represented by a unit vector, ensuring that only the orientation influences the rate of change. By varying the direction, different rates of change can be observed, demonstrating that the directional derivative depends strongly on the chosen direction.The directional derivative is computed using the gradient...
Gradient Vectors and Their Applications01:19

Gradient Vectors and Their Applications

Every point on a topographical map corresponds to a particular elevation, so the landscape can be modeled as a surface whose height depends on horizontal position. From any given location, a hiker may face infinitely many directions, but only one direction produces the fastest possible increase in elevation. This unique route is called the direction of steepest ascent, and in multivariable calculus, it is represented by the gradient vector of the elevation function.The gradient vector points...
Implicit Differentiation: Problem Solving01:29

Implicit Differentiation: Problem Solving

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

You might also read

Related Articles

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

Sort by
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
Same author

Preparation of Fe<sub>2</sub>O<sub>3</sub>/GCN/ICG/DHA Nanocomplexes and Their Multifunctional Combined Antitumor Properties.

International journal of nanomedicine·2026
Same author

Multi-omics integration reveals tumor and microenvironmental heterogeneity in malignant pleural mesothelioma.

Discover oncology·2026
Same author

T-cell lymphoblastic lymphoma of the breast: A retrospective observational study and literature review.

Medicine·2026
Same journal

Universal perceptron and DNA-like learning algorithm for binary neural networks: LSBF and PBF implementations.

IEEE transactions on neural networks·2013
Same journal

Guest editorial: special section on white box nonlinear prediction models.

IEEE transactions on neural networks·2011
Same journal

Data-based fault-tolerant control of high-speed trains with traction/braking notch nonlinearities and actuator failures.

IEEE transactions on neural networks·2011
Same journal

Guest editorial: special section on data-based control, modeling, and optimization.

IEEE transactions on neural networks·2011
Same journal

Neural network-based multiple robot simultaneous localization and mapping.

IEEE transactions on neural networks·2011
Same journal

Data-driven model-free adaptive control for a class of MIMO nonlinear discrete-time systems.

IEEE transactions on neural networks·2011
See all related articles

Related Experiment Video

Updated: Jun 23, 2026

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

Deep Neural Networks for Image-Based Dietary Assessment

Published on: March 13, 2021

Subgradient-based neural networks for nonsmooth nonconvex optimization problems.

Wei Bian1, Xiaoping Xue

  • 1Department of Mathematics, Harbin Institute of Technology, Harbin 150001, China. bianweilvse520@163.com

IEEE Transactions on Neural Networks
|May 22, 2009
PubMed
Summary
This summary is machine-generated.

This study introduces a novel subgradient-based neural network for solving complex nonsmooth, nonconvex optimization problems. The network demonstrates finite-time convergence to feasible solutions and equilibrium points, showcasing its effectiveness.

Related Experiment Videos

Last Updated: Jun 23, 2026

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

Deep Neural Networks for Image-Based Dietary Assessment

Published on: March 13, 2021

Area of Science:

  • Optimization Theory
  • Neural Networks
  • Nonsmooth Analysis

Background:

  • Nonsmooth nonconvex optimization problems are challenging due to their complex objective functions and constraints.
  • Existing methods often struggle with convergence guarantees for such problems.

Purpose of the Study:

  • To develop and analyze a subgradient-based neural network for solving nonsmooth nonconvex optimization problems.
  • To establish theoretical convergence properties of the proposed neural network model.

Main Methods:

  • Modeling the neural network using a differential inclusion.
  • Applying subgradient methods to handle nonsmoothness.
  • Analyzing convergence properties under specific assumptions on the objective function and constraint set.

Main Results:

  • Proving the existence of a unique global solution for the neural network with a sufficiently large penalty parameter.
  • Demonstrating finite-time reachability of the feasible region by the network's trajectory.
  • Establishing convergence of the network's trajectory to equilibrium points, coinciding with critical points in the feasible region.

Conclusions:

  • The proposed subgradient-based neural network effectively solves nonsmooth nonconvex optimization problems.
  • Theoretical results guarantee finite-time convergence and stability of the network's solutions.
  • The model shows good performance, validated by three illustrative examples.