A Gradient Projection Algorithm for Relaxation Methods

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

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on pattern analysis and machine intelligence 1983-05, Vol.PAMI-5 (3), p.330-332
Main Authors: Mohammed, John L., Hummel, Robert A., Zucker, Steven W.
Format: Article
Language:English
Subjects:
Artificial intelligence
Computer vision
Constraint optimization
Gradient projection
Labeling
Laboratories
Optimization methods
Projection algorithms
projection operator
relaxation labeling
Relaxation methods
Research and development
Robot vision systems
updating formula
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0162-8828
1939-3539
DOI:10.1109/TPAMI.1983.4767394