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

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...
Lagrange Multipliers: Problem Solving01:30

Lagrange Multipliers: Problem Solving

A silo with a cylindrical base, flat bottom, and hemispherical roof is a common design in agricultural and industrial storage due to its structural efficiency and ease of construction. Optimizing its dimensions to maximize storage capacity for a given amount of material—i.e., a fixed surface area—is a classic problem in applied calculus and engineering design. The key parameters are the radius r of the base and the height h of the cylindrical section.The total volume of the silo is obtained by...
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...
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...
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.
Quadratic Models01:23

Quadratic Models

Quadratic models are mathematical representations used to describe relationships in which the rate of change changes at a constant rate. These models appear in a wide variety of natural and engineered systems, especially those involving motion, forces, and optimization. One common application is analyzing the vertical motion of objects influenced by gravity, such as a ball thrown into the air.In such scenarios, the object's height changes over time in a curved pattern, rising to a maximum point...

You might also read

Related Articles

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

Sort by
Same author

Precise Measurement of the Chromoelectric Dipole Moment of the Charm Quark.

Physical review letters·2026
Same author

First Measurement of the D_{s}^{+}→K^{0}μ^{+}ν_{μ} Decay.

Physical review letters·2026
Same author

Observation of the Electromagnetic Radiative Decays of the Λ(1520) and Λ(1690) to γΣ^{0}.

Physical review letters·2026
Same author

Study of the Magnetic Dipole Transition of J/ψ→γη_{c} via η_{c}→pp[over ¯].

Physical review letters·2026
Same author

Observation of the Singly Cabibbo Suppressed Decay D^{0}→b_{1}(1235)^{-}e^{+}ν_{e} and Evidence for D^{+}→b_{1}(1235)^{0}e^{+}ν_{e}.

Physical review letters·2026
Same author

Unraveling the Structure of Λ Hyperons with Polarized ΛΛ[over ¯] Pairs.

Physical review letters·2025

Related Experiment Video

Updated: Jul 7, 2026

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

Deep Neural Networks for Image-Based Dietary Assessment

Published on: March 13, 2021

A new gradient-based neural network for solving linear and quadratic programming problems.

Y Leung1, K Z Chen, Y C Jiao

  • 1Department of Geography and Resource Management, Centre for Environmental Policy and Resource Management, and Joint Laboratory for Geoinformation Science, The Chinese University of Hong Kong, Hong Kong. yeeleung@cuhk.edu.hk

IEEE Transactions on Neural Networks
|February 6, 2008
PubMed
Summary

A novel gradient-based neural network efficiently solves linear and quadratic programming problems by incorporating convex analysis and stability theories. This new approach guarantees convergence to optimal solutions for all initial conditions.

Related Experiment Videos

Last Updated: Jul 7, 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:

  • Computational Mathematics
  • Artificial Intelligence
  • Operations Research

Background:

  • Linear and quadratic programming (LP/QP) are fundamental optimization problems.
  • Existing neural network approaches often struggle with efficiency and handling inequality constraints.

Purpose of the Study:

  • To develop a novel gradient-based neural network for solving LP and QP problems.
  • To enhance network efficiency and robustness by introducing a new function into the energy function.

Main Methods:

  • Construction of a gradient-based neural network integrating duality theory, optimization theory, convex analysis, Lyapunov stability, and LaSalle invariance principle.
  • Introduction of a new function F(x, y) into the energy function E(x, y) to ensure convexity and differentiability.
  • Handling of inequality constraints without resorting to penalty or Lagrange methods.

Main Results:

  • The proposed network incorporates all necessary and sufficient optimality conditions for convex QP problems.
  • Strict proofs demonstrate convergence of network trajectories to optimal solutions for both primal and dual problems, regardless of the initial point.
  • Simulation results validate the feasibility and efficiency of the proposed neural network.

Conclusions:

  • The novel neural network provides an effective and efficient method for solving linear and quadratic programming problems.
  • The approach offers advantages over existing methods, particularly in handling inequality constraints.
  • The theoretical guarantees and simulation results support the practical applicability of this new network architecture.