Non-convex split Feasibility problems: models, algorithms and theory
From MaRDI portal
Publication:2165583
DOI10.5802/ojmo.1zbMath1497.90153arXiv2010.04504OpenAlexW3094415535MaRDI QIDQ2165583
Sergey Voldman, Shoham Sabach, Aviv Gibali
Publication date: 20 August 2022
Published in: OJMO. Open Journal of Mathematical Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.04504
convergence analysisnon-convex minimizationconstrained minimizationsplit feasibility problemsCQ algorithm
Related Items
A semi-alternating algorithm for solving nonconvex split equality problems, Shrinking approximants for fixed point problem and generalized split null point problem in Hilbert spaces, Two inertial-type algorithms for solving the split feasibility problem, Alternated inertial algorithms for split feasibility problems
Cites Work
- An MM Algorithm for Split Feasibility Problems
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Cyclic algorithms for split feasibility problems in Hilbert spaces
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- On gradients of functions definable in o-minimal structures
- A multiprojection algorithm using Bregman projections in a product space
- Note on the modified relaxation CQ algorithm for the split feasibility problem
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems
- Lagrangian methods for composite optimization
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
- First-Order Methods in Optimization
- A general algorithm for multiple-sets split feasibility problem involving resolvents and Bregman mappings
- Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
- Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings
- Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Convex analysis and monotone operator theory in Hilbert spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
