Inexact quantized quasi-subgradient method for quasi-convex optimization problems

DOI10.23952/COT.2025.12MaRDI QIDQ7008020zbMATH OpenFDO

Authors Carisa Kwok Wai Yu, Yaohua Hu

Publication date 24 March 2025

Published in Communications in Optimization Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.23952/COT.2025.12

zbMATH Keywords

noisequantization operatorquasi-convex optimizationsubgradient methodweak sharp minima

Mathematics Subject Classification ID

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

Cites work

• Abstract convergence theorem for quasi-convex optimization problems with applications
• Conditional subgradient methods for constrained quasi-convex optimization problems
• Convergence and efficiency of subgradient methods for quasiconvex minimization
• Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
• Convergence rates of subgradient methods for quasi-convex optimization problems
• Convex optimization algorithms
• Distributed Average Consensus With Dithered Quantization
• From error bounds to the complexity of first-order descent methods for convex functions
• Generalized concavity
• Handbook of generalized convexity and generalized monotonicity
• scientific article; zbMATH DE number 1818892 (Why is no real title available?)
• 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 3282977 (Why is no real title available?)
• Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
• Inexact subgradient methods for quasi-convex optimization problems
• Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization
• Linear convergence of CQ algorithms and applications in gene regulatory network inference
• Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems
• Normal characterization of the main classes of quasiconvex functions
• On convergence rates of linearized proximal algorithms for convex composite optimization with applications
• Quantized consensus
• Quasi-convex feasibility problems: subgradient methods and convergence rates
• The effect of deterministic noise in subgradient methods
• The projected subgradient algorithm in convex optimization
• Weak Sharp Minima in Mathematical Programming

Cited in

(1)

• The extragradient algorithm for variational inequalities with nonsummable computational errors

This page was built for publication: Inexact quantized quasi-subgradient method for quasi-convex optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7008020)