Quasi-convex feasibility problems: subgradient methods and convergence rates
From MaRDI portal
Publication:2076909
Recommendations
- Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems
- Multiple-sets split quasi-convex feasibility problems: adaptive subgradient methods with convergence guarantee
- Convergence rates of subgradient methods for quasi-convex optimization problems
- Abstract convergence theorem for quasi-convex optimization problems with applications
- Convergence and efficiency of subgradient methods for quasiconvex minimization
Cites work
- scientific article; zbMATH DE number 1095224 (Why is no real title available?)
- scientific article; zbMATH DE number 3435272 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (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
- A linear scalarization proximal point method for quasiconvex multiobjective minimization
- Algorithms for the quasiconvex feasibility problem
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant
- An inexact proximal method for quasiconvex minimization
- Analysis of the convergence rate for the cyclic projection algorithm applied to basic semialgebraic convex sets
- Approximate solutions of common fixed-point problems
- Convergence and efficiency of subgradient methods for quasiconvex minimization
- Convergence rates of subgradient methods for quasi-convex optimization problems
- Convex optimization algorithms
- Cyclic subgradient projections
- Error bounds in mathematical programming
- Extension of Hoffman’s Error Bound to Polynomial Systems
- Fixed point quasiconvex subgradient method
- Fractional Programming with Homogeneous Functions
- Generalized concavity
- Global error bounds with fractional exponents
- Handbook of generalized convexity and generalized monotonicity
- Incremental subgradient methods for nondifferentiable optimization
- Inexact subgradient methods for quasi-convex optimization problems
- Limiting normal operator in quasiconvex analysis
- Linear convergence of CQ algorithms and applications in gene regulatory network inference
- New iterative methods for linear inequalities
- Nonlinear error bounds for quasiconvex inequality systems
- 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
- Optimization methods for large-scale machine learning
- Random algorithms for solving convex inequalities
- Stochastic first-order methods with random constraint projection
- Universal gradient methods for convex optimization problems
Cited in
(14)- Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems
- scientific article; zbMATH DE number 1383164 (Why is no real title available?)
- Quasi-subgradient methods with Bregman distance for quasi-convex feasibility problems
- Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
- Algorithms for the quasiconvex feasibility problem
- Joint sparse optimization: lower-order regularization method and application in cell fate conversion
- Multiple-sets split quasi-convex feasibility problems: adaptive subgradient methods with convergence guarantee
- Adaptive subgradient method for the split quasi-convex feasibility problems
- Convergence and efficiency of subgradient methods for quasiconvex minimization
- Fixed point quasiconvex subgradient method
- Abstract convergence theorem for quasi-convex optimization problems with applications
- Convergence rates of subgradient methods for quasi-convex optimization problems
- Efficiency of inexact fixed point quasiconvex subgradient method
- Implementable feasible quasi-nonexpansive operators
This page was built for publication: Quasi-convex feasibility problems: subgradient methods and convergence rates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2076909)
