Please use this identifier to cite or link to this item:
Scopus Web of Science® Altmetric
Type: Conference paper
Title: Efficient optimization for L∞-problems using pseudoconvexity
Other Titles: Efficient optimization for L infinity-problems using pseudoconvexity
Author: Olsson, C.
Eriksson, A.
Kahl, F.
Citation: 11th IEEE International Conference on Computer Vision, Rio de Janeiro, Brazil, October 14-20, 2007
Publisher: IEEE
Publisher Place: United States
Issue Date: 2007
ISBN: 9781424416301
Conference Name: IEEE International Conference on Computer Vision (11th : 2007 : Rio de Janeiro, Brazil)
Statement of
Carl Olsson, Anders P. Eriksson and Fredrik Kahl
Abstract: In this paper we consider the problem of solving geometric reconstruction problems with the L ∞-norm. Previous work has shown that globally optimal solutions can be computed reliably for a series of such problems. The methods for computing the solutions have relied on the property of quasiconvexity. For quasiconvex problems, checking if there exists a solution below a certain objective value can be posed as a convex feasibility problem. To solve the L ∞problem one typically employs a bisection algorithm, generating a sequence of convex problems. In this paper we present more efficient ways of computing the solutions. We derive necessary and sufficient conditions for a global optimum. A key property is that of pseudoconvexity, which is a stronger condition than quasiconvexity. The results open up the possibility of using local optimization methods for more efficient computations. We present two such algorithms. The first one is an interior point method that uses the KKT conditions and the second one is similar to the bisection method in the sense it solves a sequence of SOCP problems. Results are presented and compared to the standard bisection algorithm on real data for various problems and scenarios with improved performance..
RMID: 0020095411
DOI: 10.1109/ICCV.2007.4409087
Appears in Collections:Computer Science publications

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.