Related Experiment Video
Updated: May 29, 2026

Digital Inline Holographic Microscopy (DIHM) of Weakly-scattering Subjects
Published on: February 8, 2014
A gradient projection algorithm for relaxation methods
J L Mohammed1, R A Hummel, S W Zucker
1Artificial Intelligence Laboratory, Fair-child Central Research and Development, Palo Alto, CA 94304.
Abstract:
We consider a particular problem which arises when apply-ing the method of gradient projection for solving constrained optimiza-tion and finite dimensional variational inequalities on the convex set formed by the convex hull of the standard basis unit vectors. The method is especially important for relaxation labeling techniques applied to problems in artificial intelligence. Zoutendijk's method for finding feasible directions, which is relatively complicated in general situations, yields a very simple finite algorithm for this problem. We present an extremely simple algorithm for performing the gradient projection and an independent verification of its correctness.
Related Concept Videos
Gradient and Del Operator
Relaxation of Skeletal Muscles
When an action potential reaches the axon terminal, it depolarizes the membrane and opens voltage-gated sodium channels. Sodium ions enter the cell, further depolarizing the presynaptic membrane. This depolarization causes voltage-gated calcium channels to open.
Fischer Projections
Methods of Obtaining Topography
What is an Electrochemical Gradient?
The chemical gradient relies on differences in the abundance of a substance on the outside versus the inside of a cell and flows from areas of high to low ion concentration. In contrast, the electrical gradient revolves around an ion’s...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
