Non-convex split Feasibility problems: models, algorithms and theory
From MaRDI portal
Publication:2165583
Abstract: In this paper, we propose a catalog of iterative methods for solving the Split Feasibility Problem in the non-convex setting. We study four different optimization formulations of the problem, where each model has advantageous in different settings of the problem. For each model, we study relevant iterative algorithms, some of which are well-known in this area and some are new. All the studied methods, including the well-known CQ Algorithm, are proven to have global convergence guarantees in the non-convex setting under mild conditions on the problem's data.
Recommendations
- A semi-alternating algorithm for solving nonconvex split equality problems
- A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection
- Inexact averaged projection algorithm for nonconvex multiple-set split feasibility problems
- A new iterative method for the split feasibility problem
- Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems
Cites work
- A general algorithm for multiple-sets split feasibility problem involving resolvents and Bregman mappings
- A multiprojection algorithm using Bregman projections in a product space
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- A note on the multiple-set split convex feasibility problem in Hilbert space
- A smoothing alternating minimization-based algorithm for clustering with sum-min of duclidean norms
- A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- An MM Algorithm for Split Feasibility Problems
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convex analysis and monotone operator theory in Hilbert spaces
- Cyclic algorithms for split feasibility problems in Hilbert spaces
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- First-order methods in optimization
- Gradient-based algorithms with applications to signal-recovery problems
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- scientific article; zbMATH DE number 3371284 (Why is no real title available?)
- Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems
- Iterative oblique projection onto convex sets and the split feasibility problem
- Lagrangian methods for composite optimization
- Nonconvex Lagrangian-based optimization: monitoring schemes and global convergence
- Note on the modified relaxation CQ algorithm for the split feasibility problem
- On gradients of functions definable in o-minimal structures
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings
- Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
- Successive linear programming approach for solving the nonlinear split feasibility problem
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
Cited in
(15)- Shrinking approximants for fixed point problem and generalized split null point problem in Hilbert spaces
- Optimization for Inconsistent Split Feasibility Problems
- A semi-alternating algorithm for solving nonconvex split equality problems
- scientific article; zbMATH DE number 6285844 (Why is no real title available?)
- Two inertial-type algorithms for solving the split feasibility problem
- S-subgradient projection algorithms with Armijo line search for nonconvex split feasibility problems
- Alternated inertial algorithms for split feasibility problems
- A projection algorithm for non-convex split feasibility problem
- Convergence theorem for fixed point and split generalized variational inclusion problems with multiple output sets in Banach spaces
- Strongly convergent inertial projection and contraction methods for split variational inequality problem
- Modified general splitting method for the split feasibility problem
- An inertial hyperplane projection method for split feasibility problems and applications
- Inertial forward-reflected-backward splitting method with linesearch for nonconvex split feasibility problem
- CQ-like algorithm for nonconvex split feasibility problem with multiple output sets
- Inertial Bregman proximal alternating linearized minimization method with line search for non-convex split feasibility problem
This page was built for publication: Non-convex split Feasibility problems: models, algorithms and theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2165583)
