Multiple-sets split quasi-convex feasibility problems: adaptive subgradient methods with convergence guarantee
From MaRDI portal
Recommendations
- Adaptive subgradient method for the split quasi-convex feasibility problems
- Quasi-convex feasibility problems: subgradient methods and convergence rates
- Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems
- Algorithms for the quasiconvex feasibility problem
- Self-adaptive projection methods for the multiple-sets split feasibility problem
Cites work
- A cyclic and simultaneous iterative method for solving the multiple-sets split feasibility problem
- A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property
- A family of projection gradient methods for solving the multiple-sets split feasibility problem
- A multiprojection algorithm using Bregman projections in a product space
- A self-adaptive projection method for solving the multiple-sets split feasibility problem
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Abstract convergence theorem for quasi-convex optimization problems with applications
- Adaptive subgradient method for the split quasi-convex feasibility problems
- Algorithms for the quasiconvex feasibility problem
- Analysis of the convergence rate for the cyclic projection algorithm applied to basic semialgebraic convex sets
- Conditional subgradient methods for constrained quasi-convex optimization problems
- Convergence and efficiency of subgradient methods for quasiconvex minimization
- Convergence rates of subgradient methods for quasi-convex optimization problems
- Convex optimization algorithms
- Error bounds in mathematical programming
- Extension of Hoffman’s Error Bound to Polynomial Systems
- From error bounds to the complexity of first-order descent methods for convex functions
- Global error bounds with fractional exponents
- Group sparse optimization via \(\ell_{p,q}\) regularization
- Handbook of generalized convexity and generalized monotonicity
- scientific article; zbMATH DE number 1321699 (Why is no real title available?)
- scientific article; zbMATH DE number 1095224 (Why is no real title available?)
- scientific article; zbMATH DE number 3435272 (Why is no real title available?)
- Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
- Inexact subgradient methods for quasi-convex optimization problems
- Iterative oblique projection onto convex sets and the split feasibility problem
- Limiting normal operator in quasiconvex analysis
- Linear convergence of CQ algorithms and applications in gene regulatory network inference
- Nonlinear error bounds for quasiconvex inequality systems
- On Convergence Properties of a Subgradient Method
- On convergence rates of linearized proximal algorithms for convex composite optimization with applications
- On Projection Algorithms for Solving Convex Feasibility Problems
- Optimization methods for large-scale machine learning
- Polyak's gradient method for split feasibility problem constrained by level sets
- Quasi-convex feasibility problems: subgradient methods and convergence rates
- Random algorithms for convex minimization problems
- Reflection Methods for Inverse Problems with Applications to Protein Conformation Determination
- Self-adaptive projection methods for the multiple-sets split feasibility problem
- Stochastic first-order methods with random constraint projection
- Stochastic subgradient method for quasi-convex optimization problems
- Subgradient methods for saddle point problems of quasiconvex optimization
- The linearized Bregman method via split feasibility problems: analysis and generalizations
- The multiple-sets split feasibility problem and its applications for inverse problems
Cited in
(4)- Quasi-convex feasibility problems: subgradient methods and convergence rates
- Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems
- Adaptive subgradient method for the split quasi-convex feasibility problems
- A simultaneous quasi-subgradient method for minimizing convex function with quasi-convex functional constraints
This page was built for publication: Multiple-sets split quasi-convex feasibility problems: adaptive subgradient methods with convergence guarantee
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088832)
