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

Cites Work

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

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)