Convergence and efficiency of subgradient methods for quasiconvex minimization

Recommendations

On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
On Convergence Properties of a Subgradient Method
Quasi-convex feasibility problems: subgradient methods and convergence rates
The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
Convergence of a projected gradient method variant for quasiconvex objectives

Cited in

(67)

Asymptotic convergence of an inertial proximal method for unconstrained quasiconvex minimization
Application of the method of conjugate subgradients to minimization of quasiconvex functions
Subgradient method for minimization of convex functionals and some efficiency bounds
Convergence of a simple subgradient level method
On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
Quasi-convex feasibility problems: subgradient methods and convergence rates
Optimal price-threshold control for battery operation with aging phenomenon: a quasiconvex optimization approach
On strongly quasiconvex functions: existence results and proximal point algorithms
Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems
Convergence of inexact quasisubgradient methods with extrapolation
Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces
Some remarks on Greenberg-Pierskalla subdifferentiability of quasiconvex functions
Disciplined quasiconvex programming
Fixed point quasiconvex subgradient method
A subgradient algorithm for a class of nonlinear split feasibility problems: application to jointly constrained Nash equilibrium models
Convergence of the steepest descent method for minimizing quasiconvex functions
Algorithms for the quasiconvex feasibility problem
Inexact subgradient methods for quasi-convex optimization problems
A subgradient method for equilibrium problems involving quasiconvex bifunctions
PELVE: probability equivalent level of VaR and ES
Full convergence of the proximal point method for quasiconvex functions on Hadamard manifolds
Proximal point method for minimizing quasiconvex locally Lipschitz functions on Hadamard manifolds
Effects of dominance on operation policies in a two-stage supply chain in which market demands follow the Bass diffusion model
On Convergence Properties of a Subgradient Method
What is quasiconvex analysis?
Convergence of Min-Sum Message Passing for Quadratic Optimization
Weak subgradient method for solving nonsmooth nonconvex optimization problems
Deep Domain Decomposition Methods: Helmholtz Equation
Sequential subspace optimization for quasar-convex optimization problems with inexact gradient
A parallel subgradient projection algorithm for quasiconvex equilibrium problems under the intersection of convex sets
Multiple-sets split quasi-convex feasibility problems: adaptive subgradient methods with convergence guarantee
Collaborative filtering for massive multinomial data
Subgradient methods for saddle point problems of quasiconvex optimization
Efficiency of inexact fixed point quasiconvex subgradient method
Abstract convergence theorem for quasi-convex optimization problems with applications
``Efficient subgradient methods for general convex optimization
Convergence properties of the modified subgradient method of camerini et al
Incremental quasi-subgradient method for minimizing sum of geodesic quasi-convex functions on Riemannian manifolds with applications
scientific article; zbMATH DE number 7742927 (Why is no real title available?)
An algorithm for quasiconvex equilibrium problems and asymptotically nonexpansive mappings: application to a Walras model with implicit supply-demand
Accelerated methods for weakly-quasi-convex optimization problems
Adaptive subgradient methods for mathematical programming problems with quasiconvex functions
Quantaloidal approach to constraint satisfaction
Quasi-subgradient methods with Bregman distance for quasi-convex feasibility problems
Self-adaptive algorithms for quasiconvex programming and applications to machine learning
Long term dynamics of the subgradient method for Lipschitz path differentiable functions
Karush-Kuhn-Tucker optimality conditions for non-smooth geodesic quasi-convex optimization on Riemannian manifolds
A subgradient projection method for quasiconvex minimization
On a minimization problem of the maximum generalized eigenvalue: properties and algorithms
Convergence analysis of incremental quasi-subgradient method on Riemannian manifolds with lower bounded curvature
A subgradient projection method for quasiconvex multiobjetive optimization
Proximal point type algorithms for solving multiobjective optimization problems beyond convexity
Strongly convergent two-step inertial subgradient extragradient methods for solving quasi-monotone variational inequalities with applications
Prediction of random variables by excursion metric projections
Parallel selected inversion for space-time Gaussian Markov random fields
Parallel algorithms for finding common solutions to split convex feasibility and quasiconvex minimization problems
Gradient projection method for quasiconvex equilibrium problems
Variational analysis of unbounded and discontinuous generalized eigenvalue functions with application to topology optimization
Decomposed quasiconvex optimization with application to generalized cone problems
On quasi-convex smooth optimization problems by a comparison oracle
Inexact quantized quasi-subgradient method for quasi-convex optimization problems
Stochastic quasi-subgradient methods with Bregman projection for stochastic quasi-convex feasibility problems
Projected quasi-subgradient method for Hölder continuous quasi-convex multiobjective optimization
Convergence rates of subgradient methods for quasi-convex optimization problems
A scalarization proximal point method for quasiconvex multiobjective minimization
Convergence of a projected gradient method variant for quasiconvex objectives

This page was built for publication: Convergence and efficiency of subgradient methods for quasiconvex minimization

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