Optimization Online


A non-monotone Inexact Restoration approach for minimization with orthogonality constraints

Juliano B. Francisco(juliano***at***mtm.ufsc.br)
Douglas S. Gonçalves(douglas***at***mtm.ufsc.br)
Fermin S. V. Bazán(fermin.bazan***at***ufsc.br)
Lila L. T. Paredes(lilablossom***at***gmail.com)

Abstract: In this work we consider the problem of minimizing a differentiable functional restricted to the set of $n\times p$ matrices with orthonormal columns. This problem appears in several fields such as statistics, signal processing, global positioning system, machine learning, physics, chemistry and others. We present an algorithm based on a recent non-monotone variation of the inexact restoration method for nonlinear programming along with its implementation details. We give a simple characterization of the set of tangent directions (with respect to the orthogonality constraints) and we use it for dealing with the minimization (tangent) phase. For the restoration phase we employ the well-known Cayley transform for bringing the computed point back to the feasible set (i.e., the restoration phase is exact). Under standard assumptions we prove that any limit point of the sequence generated by the algorithm is a stationary point. A numerical comparison with a well established algorithm is also presented on three different classes of the problem.

Keywords: Inexact Restoration; Orthogonality constraints; Stiefel manifold; Cayley transform; Conjugate Gradient

Category 1: Nonlinear Optimization

Citation: Federal University of Santa Catarina, Department of Mathematics. Florianópolis. SC. Brazil. 88040-900

Download: [PDF]

Entry Submitted: 10/16/2018
Entry Accepted: 10/16/2018
Entry Last Modified: 10/16/2018

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society