Quasi-convex feasibility problems: subgradient methods and convergence rates

DOI10.1016/J.EJOR.2021.09.029zbMATH Open1490.90229OpenAlexW3207679231MaRDI QIDQ2076909FDOQ2076909

Authors: Gongnong Li, Carisa Kwok Wai Yu, Yaohua Hu, T. L. Yip 

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

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

zbMATH Keywords

global optimizationconvergence rateiteration complexitysubgradient methodquasi-convex feasibility problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52)

Cites Work

• On Projection Algorithms for Solving Convex Feasibility Problems
• Title not available (Why is that?)
• Generalized concavity
• Error bounds in mathematical programming
• Extension of Hoffman’s Error Bound to Polynomial Systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Approximate solutions of common fixed-point problems
• Analysis of the convergence rate for the cyclic projection algorithm applied to basic semialgebraic convex sets
• Handbook of generalized convexity and generalized monotonicity
• Incremental subgradient methods for nondifferentiable optimization
• Cyclic subgradient projections
• Universal gradient methods for convex optimization problems
• A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
• Inexact subgradient methods for quasi-convex optimization problems
• An inexact proximal method for quasiconvex minimization
• An extension of proximal methods for quasiconvex minimization on the nonnegative orthant
• Convergence and efficiency of subgradient methods for quasiconvex minimization
• Random algorithms for solving convex inequalities
• Algorithms for the quasiconvex feasibility problem
• Convex optimization algorithms
• Global error bounds with fractional exponents
• New iterative methods for linear inequalities
• Stochastic first-order methods with random constraint projection
• A linear scalarization proximal point method for quasiconvex multiobjective minimization
• On convergence rates of linearized proximal algorithms for convex composite optimization with applications
• On Convergence Properties of a Subgradient Method
• Linear convergence of CQ algorithms and applications in gene regulatory network inference
• Convergence rates of subgradient methods for quasi-convex optimization problems
• Optimization methods for large-scale machine learning
• Title not available (Why is that?)
• Limiting normal operator in quasiconvex analysis
• Fractional Programming with Homogeneous Functions
• A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property
• Nonlinear error bounds for quasiconvex inequality systems
• Fixed point quasiconvex subgradient method

Cited In (14)

• Quasi-subgradient methods with Bregman distance for quasi-convex feasibility problems
• Title not available (Why is that?)
• Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems
• Joint sparse optimization: lower-order regularization method and application in cell fate conversion
• Algorithms for the quasiconvex feasibility problem
• Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
• 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

Uses Software

• NESUN

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)