Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality
نویسندگان
چکیده
منابع مشابه
Convergence results for projected line-search methods on varieties of low-rank matrices via Łojasiewicz inequality
The aim of this paper is to derive convergence results for projected line-search methods on the real-algebraic variety M≤k of real m× n matrices of rank at most k. Such methods extend Riemannian optimization methods, which are successfully used on the smooth manifold Mk of rank-k matrices, to its closure by taking steps along gradient-related directions in the tangent cone, and afterwards proje...
متن کاملConvergence results for projected line-search methods on varieties of low-rank matrices via \L{}ojasiewicz inequality
As an intial step towards low-rank optimization algorithms using hierarchical tensors, the aim of this paper is to derive convergence results for projected line-search methods on the real-algebraic variety M≤k of real m × n matrices of rank at most k. Such methods extend successfully used Riemannian optimization methods on the smooth manifold Mk of rank-k matrices to its closure by taking steps...
متن کاملQuadratic Optimization with Orthogonality Constraints: Explicit Łojasiewicz Exponent and Linear Convergence of Line-Search Methods
A fundamental class of matrix optimization problems that arise in many areas of science and engineering is that of quadratic optimization with orthogonality constraints. Such problems can be solved using line-search methods on the Stiefel manifold, which are known to converge globally under mild conditions. To determine the convergence rates of these methods, we give an explicit estimate of the...
متن کاملLow-rank Iterative Methods for Projected Generalized Lyapunov Equations
LOW-RANK ITERATIVE METHODS FOR PROJECTED GENERALIZED LYAPUNOV EQUATIONS TATJANA STYKEL Abstract. We generalize an alternating direction implicit method and the Smith method for large-scale projected generalized Lyapunov equations. Such equations arise in model reduction of descriptor systems. Low-rank versions of these methods are also presented, which can be used to compute low-rank approximat...
متن کاملConvergence of Non-smooth Descent Methods Using the Kurdyka-Łojasiewicz Inequality
We investigate the convergence of subgradient-oriented descent methods in non-smooth non-convex optimization. We prove convergence in the sense of subsequences for functions with a strict standard model, and we show that convergence to a single critical point may be guaranteed if the Kurdyka–Łojasiewicz inequality is satisfied. We show, by way of an example, that the Kurdyka–Łojasiewicz inequal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2015
ISSN: 1052-6234,1095-7189
DOI: 10.1137/140957822