Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems

DOI10.1007/s00245-017-9417-1zbMath1492.47089OpenAlexW2610855031MaRDI QIDQ1630420

Jen-Chih Yao, Chong Li, Xiaopeng Zhao, Ng Kung-fu

Publication date: 10 December 2018

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00245-017-9417-1

zbMATH Keywords

projection algorithmconvex feasibility problemlinear regularity

Mathematics Subject Classification ID

Convex programming (90C25) General theory of numerical analysis in abstract spaces (65J05) Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)

Related Items

Relaxed inertial methods for solving the split monotone variational inclusion problem beyond co-coerciveness, The combination projection method for solving convex feasibility problems, A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference, On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery, Strong convergence of an extragradient-like algorithm involving pseudo-monotone mappings, A monotone Bregan projection algorithm for fixed point and equilibrium problems in a reflexive Banach space, A modified PRP-type conjugate gradient algorithm with complexity analysis and its application to image restoration problems, Relative regularity conditions and linear regularity properties for split feasibility problems in normed linear spaces, Cayley approximation operator with an application to a system of set-valued Cayley type inclusions, On general implicit hybrid iteration method for triple hierarchical variational inequalities with hierarchical variational inequality constraints, Global error bounds for mixed Quasi-Hemivariational inequality problems on Hadamard manifolds, A subgradient extragradient algorithm with inertial effects for solving strongly pseudomonotone variational inequalities, Linear convergence rates for extrapolated fixed point algorithms, Unnamed Item, Finitely convergent iterative methods with overrelaxations revisited, Linear convergence of gradient projection algorithm for split equality problems, Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy, A family of projection gradient methods for solving the multiple-sets split feasibility problem, On the generalized Bregman projection operator in reflexive Banach spaces, An iterative method and weak sharp solutions for multitime-type variational inequalities, Nesterov perturbations and projection methods applied to IMRT, Common solution for a finite family of minimization problem and fixed point problem for a pair of demicontractive mappings in Hadamard spaces, Parallel proximal point methods for systems of vector optimization problems on Hadamard manifolds without convexity, Tikhonov type regularization methods for inverse mixed variational inequalities, A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems, Linear convergence of the relaxed gradient projection algorithm for solving the split equality problems in Hilbert spaces, Convergence analysis of a variable metric forward-backward splitting algorithm with applications, Parallel hybrid viscosity method for fixed point problems, variational inequality problems and split generalized equilibrium problems, A regularized alternating direction method of multipliers for a class of nonconvex problems, On iterative solutions of a split feasibility problem with nonexpansive mappings, A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration, Composite inertial subgradient extragradient methods for variational inequalities and fixed point problems, Composite extragradient implicit rule for solving a hierarchical variational inequality with constraints of variational inclusion and fixed point problems, Iterative methods for fixed points and zero points of nonlinear mappings with applications, Hybrid inertial subgradient extragradient methods for variational inequalities and fixed point problems involving asymptotically nonexpansive mappings, The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces, A modified hybrid algorithm for solving a composite minimization problem in Banach spaces, Weak and strong convergence of inertial Tseng's extragradient algorithms for solving variational inequality problems, Two inertial subgradient extragradient algorithms for variational inequalities with fixed-point constraints, Convergence Analysis for Variational Inclusion Problems Equilibrium Problems and Fixed Point in Hadamard Manifolds, ON THE STRONG CONVERGENCE OF A PROJECTION-BASED ALGORITHM IN HILBERT SPACES, Composite steepest-descent method for the triple hierarchical variational inequalities, Variational inequalities, variational inclusions and common fixed point problems in Banach spaces, Linear convergence of a nonmonotone projected gradient method for multiobjective optimization

Cites Work

• Hilbertian convex feasibility problem: Convergence of projection methods
• Strong convergence of projection-like methods in Hilbert spaces
• Constrained best approximation in Hilbert space. II
• On the convergence of von Neumann's alternating projection algorithm for two sets
• A dual approach to constrained interpolation from a convex subset of Hilbert space
• Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
• Constrained best approximation in Hilbert space
• Regularities and their relations to error bounds
• Extrapolation algorithm for affine-convex feasibility problems
• On rings of operators. Reduction theory
• On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications
• The Dual Normal CHIP and Linear Regularity for Infinite Systems of Convex Sets in Banach Spaces
• The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
• Optimization and nonsmooth analysis
• Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings
• On Projection Algorithms for Solving Convex Feasibility Problems
• A Norm Convergence Result on Random Products of Relaxed Projections in Hilbert Space
• Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets
• Linear convergence of CQ algorithms and applications in gene regulatory network inference
• Strong CHIP, normality, and linear regularity of convex sets
• Strong CHIP for Infinite System of Closed Convex Sets in Normed Linear Spaces
• The method of projections for finding the common point of convex sets
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item