Line Search Algorithms for Locally Lipschitz Functions on Riemannian Manifolds

From MaRDI portal
Publication:4609464

DOI10.1137/16M1108145zbMath1387.49019WikidataQ114978703 ScholiaQ114978703MaRDI QIDQ4609464

No author found.

Publication date: 3 April 2018

Published in: SIAM Journal on Optimization (Search for Journal in Brave)




Related Items (19)

Riemannian proximal gradient methodsRiemannian smoothing gradient type algorithms for nonsmooth optimization problem on compact Riemannian submanifold embedded in Euclidean spaceOptimality conditions and duality for nonsmooth multiobjective semi-infinite programming problems on Hadamard manifoldsA Dynamic Smoothing Technique for a Class of Nonsmooth Optimization Problems on ManifoldsFaster Riemannian Newton-type optimization by subsampling and cubic regularizationA Riemannian Gradient Sampling Algorithm for Nonsmooth Optimization on ManifoldsA hybrid Riemannian conjugate gradient method for nonconvex optimization problemsAn inexact Riemannian proximal gradient methodGeometric Methods on Low-Rank Matrix and Tensor ManifoldsAveraging Symmetric Positive-Definite MatricesA reduced-space line-search method for unconstrained optimization via random descent directionsSimple algorithms for optimization on Riemannian manifolds with constraintsRiemannian conjugate gradient methods with inverse retractionProximal Gradient Method for Nonsmooth Optimization over the Stiefel ManifoldSufficient descent Riemannian conjugate gradient methodsA global Newton method for the nonsmooth vector fields on Riemannian manifoldsA Gradient Sampling Method on Algebraic Varieties and Application to Nonsmooth Low-Rank OptimizationWeakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type MethodsAn Inexact Semismooth Newton Method on Riemannian Manifolds with Application to Duality-Based Total Variation Denoising



Cites Work


This page was built for publication: Line Search Algorithms for Locally Lipschitz Functions on Riemannian Manifolds