Adaptive subgradient method for the split quasi-convex feasibility problems
From MaRDI portal
Publication:2836078
DOI10.1080/02331934.2016.1189551zbMath1358.90099OpenAlexW2508017267MaRDI QIDQ2836078
Narin Petrot, Nimit Nimana, A. P. Farajzadeh
Publication date: 7 December 2016
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2016.1189551
Related Items
A parallel subgradient projection algorithm for quasiconvex equilibrium problems under the intersection of convex sets ⋮ A Proximal Point Algorithm for Finding a Common Zero of a Finite Family of Maximal Monotone Operators ⋮ The extension of the linear inequality method for generalized rational Chebyshev approximation to approximation by general quasilinear functions ⋮ A subgradient method for equilibrium problems involving quasiconvex bifunctions ⋮ Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee ⋮ Inertial splitting methods without prior constants for solving variational inclusions of two operators ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A strongly convergent Mann-type inertial algorithm for solving split variational inclusion problems ⋮ Unnamed Item ⋮ Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions ⋮ Convergence of some iterative algorithms for system of generalized set-valued variational inequalities ⋮ Unnamed Item ⋮ \(S\)-derivative of perturbed mapping and solution mapping for parametric vector equilibrium problems
Cites Work
- Convex feasibility modeling and projection methods for sparse signal recovery
- On the existence of minimizers of proximity functions for split feasibility problems
- A multiprojection algorithm using Bregman projections in a product space
- Split hierarchical variational inequality problems and related problems
- Algorithms for the quasiconvex feasibility problem
- Inexact subgradient methods for quasi-convex optimization problems
- The split common null point problem and the shrinking projection method in Banach spaces
- A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
- Algorithms with new parameter conditions for split variational inclusion problems in Hilbert spaces with application to split feasibility problem
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- The multiple-sets split feasibility problem and its applications for inverse problems
- Variational Analysis
- Iterative oblique projection onto convex sets and the split feasibility problem
- Cooperative Wireless Sensor Network Positioning via Implicit Convex Feasibility
- Energy-based sensor network source localization via projection onto convex sets
- On Projection Algorithms for Solving Convex Feasibility Problems
- On Convergence Properties of a Subgradient Method
- The relaxed CQ algorithm solving the split feasibility problem
