A Globally Convergent Algorithm for Minimizing Over the Rotation Group of Quadratic Forms

Authors:
C. Gurwitz;M. L. Overton
Affiliations:
City Univ. of New York, Brooklyn, NY;New York Univ.
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1989

Citing 4
Cited 0

Sequential quadratic programming methods based on approximating a projected Hessian matrix

Sequential quadratic programming methods based on approximating a projected Hessian matrix
Practical methods of optimization; (2nd ed.)

Practical methods of optimization; (2nd ed.)
Maintaining representations of the environment of a mobile robot

Proceedings of the 4th international symposium on Robotics Research
Some issues in implementing a sequential quadratic programming algorithm

ACM SIGNUM Newsletter

Quantified Score

Hi-index	0.15

Visualization

Abstract

The authors describe a numerical procedure for solving problems involving minimization over the rotation group of quadratic forms which arise in connection with problems of computer vision. The algorithm presented is a sequential quadratic programming method which takes advantage of the special structure of the problem constraints. It is demonstrate that the method is globally convergent.