Abstract convergence theorem for quasi-convex optimization problems with applications
From MaRDI portal
Publication:5228820
DOI10.1080/02331934.2018.1455831zbMath1422.90057OpenAlexW2794511463MaRDI QIDQ5228820
Yao-Hua Hu, Siu Kai Choy, Carisa Kwok Wai Yu, Xiao Qi Yang
Publication date: 13 August 2019
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2018.1455831
subgradient methodquasi-convex programmingbasic inequalityabstract convergence theoremCobb-Douglas production efficiency problem
Related Items
Convergence of inexact quasisubgradient methods with extrapolation ⋮ Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces ⋮ Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee ⋮ Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions ⋮ Convergence rates of subgradient methods for quasi-convex optimization problems
Uses Software
Cites Work
- Primal-dual subgradient methods for convex problems
- Handbook of generalized convexity and generalized monotonicity
- Convex analysis and nonlinear optimization. Theory and examples.
- Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities
- Subgradient methods for saddle-point problems
- Generalized concavity
- Conditional subgradient optimization -- theory and applications
- On properties of supporting and quasi-supporting vectors
- The effect of deterministic noise in subgradient methods
- Inexact subgradient methods for quasi-convex optimization problems
- Incremental Subgradient Methods for Nondifferentiable Optimization
- On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications
- Incremental Subgradients for Constrained Convex Optimization: A Unified Framework and New Methods
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- On Projection Algorithms for Solving Convex Feasibility Problems
- Fractional Programming with Homogeneous Functions
- On Convergence Properties of a Subgradient Method
- Convergence Analysis of Deflected Conditional Approximate Subgradient Methods
- Linear convergence of CQ algorithms and applications in gene regulatory network inference
- Normal characterization of the main classes of quasiconvex functions
- Convergence and efficiency of subgradient methods for quasiconvex minimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
