paper-with-me

홈 › Papers

Local Convergence of Proximal Splitting Methods for Rank Constrained Problems

2017-10-11 · Christian Grussler, Pontus Giselsson

We analyze the local convergence of proximal splitting algorithms to solve optimization problems that are convex besides a rank constraint. For this, we show conditions under which the proximal operator of a function involving the rank constraint is locally identical to the proximal operator of its convex envelope, hence implying local convergence. The conditions imply that the non-convex algorithms locally converge to a solution whenever a convex relaxation involving the convex envelope can be expected to solve the non-convex problem.

📄 PDF Abstract BibTeX arXiv:1710.04248

Code (2)

LowRankOpt/LRINorm
LowRankOpt/LRIPy

Similar Papers 제목 키워드 기반

Proximal methods for point source localisation

2022-12-06 · Tuomo Valkonen

Point source localisation is generally modelled as a Lasso-type problem on measures. However, optimisation methods in non-Hilbert spaces, such as the space of Radon measures, are much less developed than in Hilbert space…

Anderson Acceleration in Nonsmooth Problems: Local Convergence via Active Manifold Identification

2024-10-12 · Kexin Li, Luwei Bai, Xiao Wang, Hao Wang

Anderson acceleration is an effective technique for enhancing the efficiency of fixed-point iterations; however, analyzing its convergence in nonsmooth settings presents significant challenges. In this paper, we investig…

An Algorithmic Framework of Variable Metric Over-Relaxed Hybrid Proximal Extra-Gradient Method

2018-05-16 · ICML 2018 7 · Li Shen, Peng Sun, Yitong Wang, Wei Liu 외

We propose a novel algorithmic framework of Variable Metric Over-Relaxed Hybrid Proximal Extra-gradient (VMOR-HPE) method with a global convergence guarantee for the maximal monotone operator inclusion problem. Its itera…

Frank-Wolfe Splitting via Augmented Lagrangian Method

2018-04-09 · Gauthier Gidel, Fabian Pedregosa, Simon Lacoste-Julien

Minimizing a function over an intersection of convex sets is an important task in optimization that is often much more challenging than minimizing it over each individual constraint set. While traditional methods such as…

Local and Global Convergence of a General Inertial Proximal Splitting Scheme

2016-02-08 · Patrick R. Johnstone, Pierre Moulin

This paper is concerned with convex composite minimization problems in a Hilbert space. In these problems, the objective is the sum of two closed, proper, and convex functions where one is smooth and the other admits a c…