The convex feasibility problem aims to find a common point of two or more closed convex sets whose intersection is nonempty. Projection methods such as the method of alternating projections (MAP) and Douglas–Rachford (DR) are standard, but their performance depends strongly on the local geometry of the sets. In particular, for two subspaces the DR fixed-point sequence will spiral, making its convergence speed slower than that of MAP. Motivated by this behavior, we introduce the composed alternating relaxed projection algorithm, which combines the DR operator with a projection-reflection operator, together with a non-stationary variant. We prove weak convergence of both schemes under explicit parameter conditions. For two subspaces, we characterize and optimize the relevant subdominant spectral factors, while distinguishing them from attained linear rates when active eigenvalues are defective. Numerical experiments on subspaces, tangent line-ball feasibility, sparse recovery, and low-rank matrix completion illustrate the geometry-dependent behavior of the methods.
We study a class of weakly convex optimization problems in which the objective is the sum of a smooth convex term and a weakly convex term that may be non-smooth. To exploit this structure, we develop a splitting technique based on the alternating direction method of multipliers (ADMM), which decouples the minimization...
Sheng-Han Mei, Cheng-Yu Ke, Yifei Lou et al.· Frontiers in Applied Mathema...· 0 citations
Four groups of subspace methods for nonlinear monotone equations, with applications to large-scale machine learning problems, using Jacobian-free subspace directions of conjugate-gradient type combined with either fixed step sizes or variable step sizes generated by the projected method of Solodov and Svaiter are intro...
M. Kimiaei, Shima Shabani, Michael Breuß· 0 citations
We introduce two derivative-free spectral projection methods for large-scale monotone equations with convex constraints. The first, SOPP (Spectral Optimal-Perry Projection), selects its Perry parameter by minimizing the condition number of a symmetrized Perry matrix over its positive definite range, in place of the eig...
Kabenge Hamiss, M. Alshahrani, M. Syed· Mathematics· 0 citations
We investigate the optimization problem of minimizing a nonsmooth function that satisfies a nonsmooth version of the descent lemma over a nonempty and closed but not necessarily convex set. The objective function belongs to the class of upper-$\mathcal{C}^2$ functions, whereas the constraints may promote a sparse or lo...
Christian Kanzow, Jannis Krüger, Leo Lehmann· 0 citations
We introduce Envelopt, a globally convergent iterative framework for a broad class of structured optimization problems where a smooth objective is augmented by a nonsmooth convex regularizer composed with a smooth mapping, and the variables are subject to general smooth constraints. All smooth functions may be nonconve...
Alberto De Marchi, Dominique Orban· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.