Projected nonmonotone search methods for optimization with orthogonality constraints

Oscar Susano Dalmau Cedeño, Harry Fernando Oviedo Leon

Research output: Contribution to journalArticlepeer-review

6 Scopus citations


In this paper, we propose two feasible methods based on projections using a curvilinear search for solving optimization problems with orthogonality constraints. In one of them we apply a projected Adams–Moulton-like update scheme. All our algorithms compute the SVD decomposition in each iteration to preserve feasibility. Additionally, we present some convergence results. Finally, we perform numerical experiments with simulated problems; and analyze the performance of the proposed methods compared with state-of-the-art algorithms.

Original languageEnglish
Pages (from-to)3118-3144
Number of pages27
JournalComputational and Applied Mathematics
Issue number3
StatePublished - 1 Jul 2018
Externally publishedYes


  • Constrained optimization
  • Non-monotone algorithm
  • Optimization on manifolds
  • Orthogonality constraints
  • Stiefel manifold


Dive into the research topics of 'Projected nonmonotone search methods for optimization with orthogonality constraints'. Together they form a unique fingerprint.

Cite this