Adaptive subgradient method for the split quasi-convex feasibility problems
From MaRDI portal
Publication:2836078
DOI10.1080/02331934.2016.1189551zbMATH Open1358.90099OpenAlexW2508017267MaRDI QIDQ2836078FDOQ2836078
Authors: Nimit Nimana, Narin Petrot, A. 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
Recommendations
- Multiple-sets split quasi-convex feasibility problems: adaptive subgradient methods with convergence guarantee
- Algorithms for the quasiconvex feasibility problem
- On split feasibility problems with zero-convex representations
- Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems
- Quasi-convex feasibility problems: subgradient methods and convergence rates
Cites Work
- Variational Analysis
- On Projection Algorithms for Solving Convex Feasibility Problems
- A multiprojection algorithm using Bregman projections in a product space
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- The multiple-sets split feasibility problem and its applications for inverse problems
- Iterative oblique projection onto convex sets and the split feasibility problem
- Split hierarchical variational inequality problems and related problems
- The relaxed CQ algorithm solving the split feasibility problem
- Inexact subgradient methods for quasi-convex optimization problems
- A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
- Convex feasibility modeling and projection methods for sparse signal recovery
- Energy-based sensor network source localization via projection onto convex sets
- Algorithms for the quasiconvex feasibility problem
- On the existence of minimizers of proximity functions for split feasibility problems
- The split common null point problem and the shrinking projection method in Banach spaces
- On Convergence Properties of a Subgradient Method
- Cooperative Wireless Sensor Network Positioning via Implicit Convex Feasibility
- Algorithms with new parameter conditions for split variational inclusion problems in Hilbert spaces with application to split feasibility problem
Cited In (19)
- Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems
- A strongly convergent Mann-type inertial algorithm for solving split variational inclusion problems
- Adaptive subgradient methods for mathematical programming problems with quasiconvex functions
- Algorithms for the quasiconvex feasibility problem
- Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
- Subgradient algorithm for split hierarchical optimization problems
- Multiple-sets split quasi-convex feasibility problems: adaptive subgradient methods with convergence guarantee
- A proximal point algorithm for finding a common zero of a finite family of maximal monotone operators
- On split feasibility problems with zero-convex representations
- A parallel subgradient projection algorithm for quasiconvex equilibrium problems under the intersection of convex sets
- Convergence of some iterative algorithms for system of generalized set-valued variational inequalities
- On weak subdifferential and augmented normal cone
- Inertial splitting methods without prior constants for solving variational inclusions of two operators
- \(S\)-derivative of perturbed mapping and solution mapping for parametric vector equilibrium problems
- Title not available (Why is that?)
- The convergence results for an AK-generalized nonexpansive mapping in Hilbert spaces
- Splitting proximal algorithms for convex optimizations over metric spaces with curvature bounded above
- 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
This page was built for publication: Adaptive subgradient method for the split quasi-convex feasibility problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2836078)