Nonmonotone algorithm for minimization on closed sets with applications to minimization on Stiefel manifolds

DOI10.1016/j.cam.2012.01.014zbMath1239.65035OpenAlexW2137504134MaRDI QIDQ408215

Juliano B. Francisco, Fermin S. Viloche Bazán

Publication date: 29 March 2012

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2012.01.014

zbMATH Keywords

global convergenceregularizationLevenberg-Marquardt methodStiefel manifoldsclosed setsnonmonotone algorithmorthogonality constraintstrust-region rulesweighted orthogonal Procrustes problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51)

Related Items (9)

On high-order model regularization for multiobjective optimization ⋮ Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem ⋮ Nonmonotone inexact restoration approach for minimization with orthogonality constraints ⋮ Space-dependent perfusion coefficient estimation in a 2D bioheat transfer problem ⋮ Non-monotone inexact restoration method for nonlinear programming ⋮ Nonmonotone feasible arc search algorithm for minimization on Stiefel manifold ⋮ On High-order Model Regularization for Constrained Optimization ⋮ Chebyshev pseudospectral method in the reconstruction of orthotropic conductivity ⋮ An efficient optimization approach for a cardinality-constrained index tracking problem

Cites Work

• Unnamed Item
• Unnamed Item
• A feasible method for optimization with orthogonality constraints
• Global convergence of nonmonotone descent methods for unconstrained optimization problems
• Successive projection method for solving the unbalanced Procrustes problem
• The symmetric Procrustes problem
• A Procrustes problem on the Stiefel manifold
• On minimization on Stiefel manifolds
• A nonmonotone trust-region algorithm with nonmonotone penalty parameters for constrained optimization
• Nonmonotone trust region method for solving optimization problems
• Two-Point Step Size Gradient Methods
• The Geometry of Algorithms with Orthogonality Constraints
• Recursive Calculation of Dominant Singular Subspaces
• Inexact spectral projected gradient methods on convex sets
• The Procrustes Problem for Orthogonal Stiefel Matrices
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• A Nonmonotone Line Search Technique for Newton’s Method
• An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
• On the nonmonotone line search

This page was built for publication: Nonmonotone algorithm for minimization on closed sets with applications to minimization on Stiefel manifolds