Abstract convergence theorem for quasi-convex optimization problems with applications
From MaRDI portal
Recommendations
- Convergence rates of subgradient methods for quasi-convex optimization problems
- Stochastic subgradient method for quasi-convex optimization problems
- Inexact subgradient methods for quasi-convex optimization problems
- Quasi-convex feasibility problems: subgradient methods and convergence rates
- Convergence and efficiency of subgradient methods for quasiconvex minimization
Cites work
- Adaptive subgradient methods for online learning and stochastic optimization
- Conditional subgradient methods for constrained quasi-convex optimization problems
- Conditional subgradient optimization -- theory and applications
- Convergence analysis of deflected conditional approximate subgradient methods
- Convergence and efficiency of subgradient methods for quasiconvex minimization
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Convex analysis and nonlinear optimization. Theory and examples.
- Fractional Programming with Homogeneous 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 3271087 (Why is no real title available?)
- scientific article; zbMATH DE number 3282977 (Why is no real title available?)
- Incremental subgradient methods for nondifferentiable optimization
- Incremental subgradients for constrained convex optimization: A unified framework and new methods
- Inexact subgradient methods for quasi-convex optimization problems
- Linear convergence of CQ algorithms and applications in gene regulatory network inference
- Normal characterization of the main classes of quasiconvex functions
- On Convergence Properties of a Subgradient Method
- On convergence rates of linearized proximal algorithms for convex composite optimization with applications
- On Projection Algorithms for Solving Convex Feasibility Problems
- On properties of supporting and quasi-supporting vectors
- Primal-dual subgradient methods for convex problems
- Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities
- Stochastic subgradient method for quasi-convex optimization problems
- Subgradient methods for saddle point problems of quasiconvex optimization
- Subgradient methods for saddle-point problems
- The effect of deterministic noise in subgradient methods
Cited in
(18)- Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
- Quasi-convex feasibility problems: subgradient methods and convergence rates
- Convergence of inexact quasisubgradient methods with extrapolation
- Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces
- Inexact subgradient methods for quasi-convex optimization problems
- Stochastic subgradient method for quasi-convex optimization problems
- Conditional subgradient methods for constrained quasi-convex optimization problems
- scientific article; zbMATH DE number 4170626 (Why is no real title available?)
- scientific article; zbMATH DE number 5653514 (Why is no real title available?)
- Rates of Convergence for Quasi-Additive Smooth Euclidean Functionals and Application to Combinatorial Optimization Problems
- Multiple-sets split quasi-convex feasibility problems: adaptive subgradient methods with convergence guarantee
- Subgradient methods for saddle point problems of quasiconvex optimization
- Quasi-subgradient methods with Bregman distance for quasi-convex feasibility problems
- Self-adaptive algorithms for quasiconvex programming and applications to machine learning
- A subgradient projection method for quasiconvex minimization
- Strongly convergent two-step inertial subgradient extragradient methods for solving quasi-monotone variational inequalities with applications
- Inexact quantized quasi-subgradient method for quasi-convex optimization problems
- Convergence rates of subgradient methods for quasi-convex optimization problems
This page was built for publication: Abstract convergence theorem for quasi-convex optimization problems with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5228820)
