SearcharxivSearch

arXiv subjects

Kangming Chen

Publications and source records attributed to Kangming Chen.

5 recordsLinked to original sources

Open-Loop Riemannian Frank--Wolfe: Fast Rates under Error Bounds and Scaling Inequalities

We explore fast convergence of the Riemannian Frank--Wolfe method for smooth geodesically convex optimization over compact feasible sets. Hadamard manifolds are the main setting. On general complete manifolds, the analysis accounts for all feasible minimizing geodesics. We consider the open loop step-size $\eta_k=a/(k+a)$, which only uses the iteration index. Under a local H\"olderian error bound and local length-normalized directional scaling, every $a>2$ gives the eventual rate $O(k^{-1/(1-\theta)})$ for $\theta\in(0,1/2]$. An interior-ball condition yields $O(k^{-2})$ for strongly geodesically convex objectives. Under an exact Riemannian scaling inequality and a uniform positive lower bound on the gradient norm, every $a\geq2$ gives $O(k^{-a})$ after an explicit threshold index. The same rate holds for the smallest Frank--Wolfe gap over the most recent half of the iterates. For geodesic balls of radius \(R<\pi/2\) in the unit sphere, we establish the scaling inequality with $\alpha_R=\tfrac12\cot R$, yielding $O(k^{-a})$ primal error and recent-window gap rates. We also analyze the standard gap-feedback short step under the local error-bound conditions, obtaining $O(k^{-1/(1-2\theta)})$ for $\theta<1/2$ and a linear rate for $\theta=1/2$. Numerical experiments illustrate the predicted rates and compare iteration-only and feedback-based step selection.

math.OC

A Proximal Gradient Framework for Composite Multiobjective Optimization on Riemannian Manifolds

This paper proposes a Riemannian Multiobjective Proximal Gradient Method (RMPGM) for composite optimization problems on manifolds. Unlike scalarization-based approaches, the proposed framework directly handles vector-valued objectives and establishes global convergence to Pareto stationary points, together with an $\mathcal{O}(1/k)$ convergence rate. We further develop two variants to enhance practicality and performance: an inexact RMPGM that allows controlled inexactness in solving subproblems, and a trust-region RMPGM that adaptively adjusts the penalty parameter and achieves an $\mathcal{O}(\epsilon^{-2}) $iteration complexity. Numerical experiments demonstrate that the proposed methods are consistently outperform subgradient-based baselines.

math.OC

An inertial iteratively regularized extragradient method for bilevel variational inequality problems

We study a bilevel variational inequality problem where the feasible set is itself the solution set of another variational inequality. Motivated by the difficulty of computing projections onto such sets, we consider a regularized extragradient method, as proposed by Samadi and Yousefian (2025), which operates over a simpler constraint set. Building on this framework, we introduce an inertial variant (called IneIREG) that incorporates momentum through extrapolation steps. We establish iteration-complexity bounds for the general (non-strongly monotone) case under both constant and diminishing regularization, and derive improved results under strong monotonicity assumptions. Our analysis extends and refines the results of the previous work by capturing both inertial and regularization effects within a unified framework. Preliminary numerical experiments are also presented to illustrate the behavior of the proposed method.

math.OC

Riemannian conditional gradient methods for composite optimization problems

In this paper, we propose Riemannian conditional gradient methods for minimizing composite functions, i.e., those that can be expressed as the sum of a smooth function and a retraction-based convex function. We analyze the convergence of the proposed algorithms, utilizing three types of step-size strategies: adaptive, diminishing, and those based on the Armijo condition. We establish the convergence rate of \(\mathcal{O}(1/k)\) for the adaptive and diminishing step sizes, where \(k\) denotes the number of iterations. Additionally, we derive an iteration complexity of \(\mathcal{O}(1/\epsilon^2)\) for the Armijo step-size strategy to achieve \(\epsilon\)-optimality, where \(\epsilon\) is the optimality tolerance. Finally, the effectiveness of our algorithms is validated through some numerical experiments performed on the sphere and Stiefel manifolds.

math.OC

Nonlinear conjugate gradient method for vector optimization on Riemannian manifolds with retraction and vector transport

In this paper, we propose nonlinear conjugate gradient methods for vector optimization on Riemannian manifolds. The concepts of Wolfe and Zoutendjik conditions are extended for Riemannian manifolds. Specifically, we establish the existence of intervals of step sizes that satisfy the Wolfe conditions. The convergence analysis covers the vector extensions of the Fletcher--Reeves, conjugate descent, and Dai--Yuan parameters. Under some assumptions, we prove that the sequence obtained by the algorithm can converge to a Pareto stationary point. Moreover, we also discuss several other choices of the parameter. Numerical experiments illustrating the practical behavior of the methods are presented.

math.OC