EURO 2024 Copenhagen
Abstract Submission

EURO-Online login

1218. Constraint qualifications and strong global convergence properties of an augmented Lagrangian method on Riemannian manifolds

Invited abstract in session TB-41: Optimization on Manifolds, stream Optimization on Geodesic Metric Spaces: Smooth and Nonsmooth.

Tuesday, 10:30-12:00
Room: 97 (building: 306)

Authors (first author is the speaker)

1. Orizon P Ferreira
IME-Instituto de Matemática e Estatística, Universidade Federal de Goiás
2. Roberto Andreani
Departament of Applied Mathematics, State University of Campinas
3. Kelvin Couto
Mathematics, Federal Institute of Goias
4. Gabriel Haeser
Department of Applied Mathematics, University of Sao Paulo

Abstract

In the past years, augmented Lagrangian methods have been successfully applied to several classes of non-convex optimization problems, inspiring new developments in both theory and practice. In this paper we bring most of these recent developments from nonlinear programming to the context of optimization on Riemannian manifolds, including equality and inequality constraints. Many research have been conducted on optimization problems on manifolds, however only recently the treatment of the constrained case has been considered. In this paper we propose to bridge this gap with respect to the most recent developments in nonlinear programming. In particular, we formulate several well known constraint qualifications from the Euclidean context which are sufficient for guaranteeing global convergence of augmented Lagrangian methods, without requiring boundedness of the set of Lagrange multipliers. Convergence of the dual sequence can also be assured under a weak constraint qualification. The theory presented is based on so-called sequential optimality conditions, which is a powerful tool used in this context. The paper can also be read with the Euclidean context in mind, serving as a review of the most relevant constraint qualifications and global convergence theory of state-of-the-art augmented Lagrangian methods for nonlinear programming.

Keywords

Status: accepted

Back to the list of papers