Quasi-convex feasibility problems: subgradient methods and convergence rates
type: Item
instance of: scholarly article
title: Quasi-convex feasibility problems: subgradient methods and convergence rates
zbMATH Open document ID: 1490.90229
author: Gongnong Li
author: Carisa Kwok Wai Yu
author: Yaohua Hu
author: T. L. Yip
published in: European Journal of Operational Research
publication date: 2022-02-22T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 49J52
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 7478881
zbMATH Keywords: global optimization
zbMATH Keywords: quasi-convex feasibility problem
zbMATH Keywords: subgradient method
zbMATH Keywords: iteration complexity
zbMATH Keywords: convergence rate
describes a project that uses: NESUN
MaRDI profile type: Publication
full work available at URL: j.ejor.2021.09.029
OpenAlex ID: W3207679231
cites work: Limiting normal operator in quasiconvex analysis
cites work: Generalized concavity
cites work: On Projection Algorithms for Solving Convex Feasibility Problems
cites work: Q3452586
cites work: Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets
cites work: Optimization Methods for Large-Scale Machine Learning
cites work: Fractional Programming with Homogeneous Functions
cites work: Q5745537
cites work: Cyclic subgradient projections
cites work: Algorithms for the quasiconvex feasibility problem
cites work: Q4401741
cites work: Handbook of generalized convexity and generalized monotonicity
cites work: Fixed point quasiconvex subgradient method
cites work: On convergence rates of linearized proximal algorithms for convex composite optimization with applications
cites work: Convergence rates of subgradient methods for quasi-convex optimization problems
cites work: Inexact subgradient methods for quasi-convex optimization problems
cites work: A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
cites work: Convergence and efficiency of subgradient methods for quasiconvex minimization
cites work: On Convergence Properties of a Subgradient Method
cites work: Extension of Hoffman’s Error Bound to Polynomial Systems
cites work: Incremental subgradient methods for nondifferentiable optimization
cites work: Universal gradient methods for convex optimization problems
cites work: Global error bounds with fractional exponents
cites work: Error bounds in mathematical programming
cites work: A linear scalarization proximal point method for quasiconvex multiobjective minimization
cites work: An extension of proximal methods for quasiconvex minimization on the nonnegative orthant
cites work: An inexact proximal method for quasiconvex minimization
cites work: Random algorithms for solving convex inequalities
cites work: Q5187067
cites work: Q4368736
cites work: Nonlinear error bounds for quasiconvex inequality systems
cites work: Linear convergence of CQ algorithms and applications in gene regulatory network inference
cites work: Stochastic first-order methods with random constraint projection
cites work: New iterative methods for linear inequalities
cites work: A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property
cites work: Approximate solutions of common fixed-point problems
DOI: 10.1016/J.EJOR.2021.09.029
description: scientific article; zbMATH DE number 7478881