Characterization of solution sets of convex optimization problems in Riemannian manifolds

DOI10.1007/s00013-019-01382-xzbMath1434.90130OpenAlexW2979121626WikidataQ115390088 ScholiaQ115390088MaRDI QIDQ2291683

Yanyan Li

Publication date: 31 January 2020

Published in: Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00013-019-01382-x

zbMATH Keywords

convex functionssolution setsRiemannian optimization

Mathematics Subject Classification ID

Convex programming (90C25) Nonsmooth analysis (49J52) Programming in abstract spaces (90C48)

Related Items (3)

Optimality conditions and duality for nonsmooth multiobjective semi-infinite programming problems on Hadamard manifolds ⋮ On the relationship between the Kurdyka-Łojasiewicz property and error bounds on Hadamard manifolds ⋮ Optimality conditions and duality for multiobjective semi-infinite programming on Hadamard manifolds

Cites Work

• Unnamed Item
• Unnamed Item
• \(\varepsilon\)-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds
• Factorizations and geometric means of positive definite matrices
• Convex composite multi-objective nonsmooth programming
• Characterizations of the solution sets of convex programs and variational inequality problems
• A simple characterization of solutions sets of convex programs
• A semidefinite framework for trust region subproblems with applications to large scale minimization
• Smooth nonlinear optimization of \(\mathbb R^n\)
• Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
• Newton's method, zeroes of vector fields, and the Riemannian center of mass
• Projections onto convex sets on the sphere
• Convex- and monotone-transformable mathematical programming problems and a proximal-like point method
• Characterization of solution sets of convex programs
• Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality
• Variational Inequalities for Set-Valued Vector Fields on Riemannian Manifolds: Convexity of the Solution Set and the Proximal Point Algorithm
• Subdifferentials of perturbed distance function in Riemannian manifolds
• On the metric projection onto prox-regular subsets of Riemannian manifolds
• Conic Geometric Optimization on the Manifold of Positive Definite Matrices

This page was built for publication: Characterization of solution sets of convex optimization problems in Riemannian manifolds