Quasi-subgradient methods with Bregman distance for quasi-convex feasibility problems

Cites Work

On Projection Algorithms for Solving Convex Feasibility Problems
Mirror descent and nonlinear projected subgradient methods for convex optimization.
The ordered subsets mirror descent optimization method with applications to tomography
Title not available (Why is that?)
The multiple-sets split feasibility problem and its applications for inverse problems
Adjusted Sublevel Sets, Normal Operator, and Quasi-convex Programming
Generalized concavity
Title not available (Why is that?)
Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
Approximate solutions of common fixed-point problems
Inexact proximal point methods for variational inequality problems
Handbook of generalized convexity and generalized monotonicity
Cyclic subgradient projections
Interior Gradient and Proximal Methods for Convex and Conic Optimization
A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
Inexact subgradient methods for quasi-convex optimization problems
Convergence and efficiency of subgradient methods for quasiconvex minimization
Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities
Algorithms for the quasiconvex feasibility problem
Stochastic subgradient method for quasi-convex optimization problems
On convergence rates of linearized proximal algorithms for convex composite optimization with applications
On Convergence Properties of a Subgradient Method
Abstract convergence theorem for quasi-convex optimization problems with applications
Linear convergence of CQ algorithms and applications in gene regulatory network inference
Convergence rates of subgradient methods for quasi-convex optimization problems
Title not available (Why is that?)
Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems
Quasi-convex feasibility problems: subgradient methods and convergence rates
A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property
Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces
Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications

This page was built for publication: Quasi-subgradient methods with Bregman distance for quasi-convex feasibility problems

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