Test environment running 7.6.6

Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Self-concordant functions for optimization on smooth manifolds

Loading...
Thumbnail Image

Date

Journal Title

Journal ISSN

Volume Title

Publisher

Access Statement

Research Projects

Organizational Units

Journal Issue

Abstract

This paper discusses self-concordant functions on smooth manifolds. In Euclidean space, this class of functions are utilized extensively in interior-point methods for optimization because of the associated low computational complexity. Here, the self-concordant function is carefully defined on a differential manifold. First, generalizations of the properties of self-concordant functions in Euclidean space are derived. Then, Newton decrement is defined and analyzed on the manifold that we consider. Based on this, a damped Newton algorithm is proposed for optimization of self-concordant functions, which guarantees that the solution falls in any given small neighborhood of the optimal solution, with its existence and uniqueness also proved in this paper, in a finite number of steps. It also ensures quadratic convergence within a neighborhood of the minimal point This neighborhood can be specified by the the norm of Newton decrement The computational complexity bound of the proposed approach is also given explicitly. This complexity bound is O(- ln(∈)), where ∈ is the desired precision. An interesting optimization problem is given to illustrate the proposed concept and algorithm.

Description

Keywords

Citation

Source

Proceedings of the IEEE Conference on Decision and Control

Book Title

Entity type

Publication

Access Statement

License Rights

Restricted until