Globally convergent algorithm for minimizing over the rotation group of quadratic forms

Chaya Gurwitz, Michael L. Overton

Research output: Contribution to journalArticle

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 demonstrated that the method is globally convergent.

Original languageEnglish (US)
Pages (from-to)1228-1232
Number of pages5
JournalIEEE Transactions on Pattern Analysis and Machine Intelligence
Volume11
Issue number11
DOIs
StatePublished - Nov 1989

Fingerprint

Rotation Group
Quadratic programming
Quadratic form
Computer vision
Numerical Procedure
Quadratic Programming
Computer Vision
Minimization Problem

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Vision and Pattern Recognition
  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Globally convergent algorithm for minimizing over the rotation group of quadratic forms. / Gurwitz, Chaya; Overton, Michael L.

In: IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 11, No. 11, 11.1989, p. 1228-1232.

Research output: Contribution to journalArticle

@article{bab8d125591044738b65c5090fbc289f,
title = "Globally convergent algorithm for minimizing over the rotation group of quadratic forms",
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 demonstrated that the method is globally convergent.",
author = "Chaya Gurwitz and Overton, {Michael L.}",
year = "1989",
month = "11",
doi = "10.1109/34.42863",
language = "English (US)",
volume = "11",
pages = "1228--1232",
journal = "IEEE Transactions on Pattern Analysis and Machine Intelligence",
issn = "0162-8828",
publisher = "IEEE Computer Society",
number = "11",

}

TY - JOUR

T1 - Globally convergent algorithm for minimizing over the rotation group of quadratic forms

AU - Gurwitz, Chaya

AU - Overton, Michael L.

PY - 1989/11

Y1 - 1989/11

N2 - 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 demonstrated that the method is globally convergent.

AB - 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 demonstrated that the method is globally convergent.

UR - http://www.scopus.com/inward/record.url?scp=0024765227&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024765227&partnerID=8YFLogxK

U2 - 10.1109/34.42863

DO - 10.1109/34.42863

M3 - Article

AN - SCOPUS:0024765227

VL - 11

SP - 1228

EP - 1232

JO - IEEE Transactions on Pattern Analysis and Machine Intelligence

JF - IEEE Transactions on Pattern Analysis and Machine Intelligence

SN - 0162-8828

IS - 11

ER -