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

Cites work

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

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)