Adaptive subgradient method for the split quasi-convex feasibility problems
From MaRDI portal
Publication:2836078
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
- A multiprojection algorithm using Bregman projections in a product space
- A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
- Algorithms for the quasiconvex feasibility problem
- Algorithms with new parameter conditions for split variational inclusion problems in Hilbert spaces with application to split feasibility problem
- Convex feasibility modeling and projection methods for sparse signal recovery
- Cooperative Wireless Sensor Network Positioning via Implicit Convex Feasibility
- Energy-based sensor network source localization via projection onto convex sets
- Inexact subgradient methods for quasi-convex optimization problems
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- On Convergence Properties of a Subgradient Method
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the existence of minimizers of proximity functions for split feasibility problems
- Split hierarchical variational inequality problems and related problems
- The multiple-sets split feasibility problem and its applications for inverse problems
- The relaxed CQ algorithm solving the split feasibility problem
- The split common null point problem and the shrinking projection method in Banach spaces
- Variational Analysis
Cited in
(19)- A subgradient method for equilibrium problems involving quasiconvex bifunctions
- Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems
- A strongly convergent Mann-type inertial algorithm for solving split variational inclusion problems
- Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
- Algorithms for the quasiconvex feasibility problem
- Adaptive subgradient methods for mathematical programming problems with quasiconvex 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
- Convergence of some iterative algorithms for system of generalized set-valued variational inequalities
- A parallel subgradient projection algorithm for quasiconvex equilibrium problems under the intersection of convex sets
- Inertial splitting methods without prior constants for solving variational inclusions of two operators
- On weak subdifferential and augmented normal cone
- \(S\)-derivative of perturbed mapping and solution mapping for parametric vector equilibrium problems
- scientific article; zbMATH DE number 7245926 (Why is no real title available?)
- 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
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)
