On split feasibility problems with zero-convex representations

MaRDI QIDQ2821648zbMATH OpenFDO

Authors Nimit Nimana, Narin Petrot

Publication date 22 September 2016

Published in Linear and Nonlinear Analysis (Search for Journal in Brave)

Full work available at URL http://www.yokohamapublishers.jp/online2/oplna/vol2/p113.html

zbMATH Keywords

convergencefeasibility problemzero-convex function

Mathematics Subject Classification ID

Convexity of real functions in one variable, generalizations (26A51) Nonconvex programming, global optimization (90C26)

Recommendations

• Adaptive subgradient method for the split quasi-convex feasibility problems
• Splitting methods for a convex feasibility problem in Hilbert spaces
• A note on the multiple-set split convex feasibility problem in Hilbert space
• The relaxed CQ algorithm solving the split feasibility problem
• Weak convergence theorems for split feasibility problems on zeros of the sum of monotone operators and fixed point sets in Hilbert spaces

Cited in

(3)

• An approach for the convex feasibility problem via monotropic programming
• Adaptive subgradient method for the split quasi-convex feasibility problems
• Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods

This page was built for publication: On split feasibility problems with zero-convex representations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2821648)