Quasi-convex feasibility problems: subgradient methods and convergence rates
From MaRDI portal
Publication:2076909
DOI10.1016/j.ejor.2021.09.029zbMath1490.90229OpenAlexW3207679231MaRDI QIDQ2076909
Carisa Kwok Wai Yu, Gongnong Li, Tsz-leung Yip, Yao-Hua Hu
Publication date: 22 February 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.09.029
global optimizationsubgradient methodconvergence rateiteration complexityquasi-convex feasibility problem
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52)
Related Items
Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems, Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximate solutions of common fixed-point problems
- An inexact proximal method for quasiconvex minimization
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant
- Universal gradient methods for convex optimization problems
- Handbook of generalized convexity and generalized monotonicity
- Convergence rates of subgradient methods for quasi-convex optimization problems
- Limiting normal operator in quasiconvex analysis
- Generalized concavity
- New iterative methods for linear inequalities
- Error bounds in mathematical programming
- Global error bounds with fractional exponents
- 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
- Fixed point quasiconvex subgradient method
- Nonlinear error bounds for quasiconvex inequality systems
- Algorithms for the quasiconvex feasibility problem
- Inexact subgradient methods for quasi-convex optimization problems
- Incremental Subgradient Methods for Nondifferentiable Optimization
- Stochastic First-Order Methods with Random Constraint Projection
- On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications
- Cyclic subgradient projections
- Extension of Hoffman’s Error Bound to Polynomial Systems
- Optimization Methods for Large-Scale Machine Learning
- On Projection Algorithms for Solving Convex Feasibility Problems
- Fractional Programming with Homogeneous Functions
- On Convergence Properties of a Subgradient Method
- Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets
- Linear convergence of CQ algorithms and applications in gene regulatory network inference
- A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
- Convergence and efficiency of subgradient methods for quasiconvex minimization
