Pages that link to "Item:Q782917"
From MaRDI portal
The following pages link to Convergence rates of subgradient methods for quasi-convex optimization problems (Q782917):
Displaying 14 items.
- Quasi-convex feasibility problems: subgradient methods and convergence rates (Q2076909) (← links)
- Convergence rate of a rectangular subdivision-based optimization algorithm for smooth multivariate functions (Q2128765) (← links)
- Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems (Q2129140) (← links)
- Convergence of inexact quasisubgradient methods with extrapolation (Q2139278) (← links)
- Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces (Q2141725) (← links)
- Inexact subgradient methods for quasi-convex optimization problems (Q2629635) (← links)
- Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints (Q3629524) (← links)
- Rates of Convergence for Quasi-Additive Smooth Euclidean Functionals and Application to Combinatorial Optimization Problems (Q4027783) (← links)
- Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee (Q5088832) (← links)
- Rate of convergence of the Nesterov accelerated gradient method in the subcritical case <i>α</i> ≤ 3 (Q5107904) (← links)
- Convergence of Random Reshuffling under the Kurdyka–Łojasiewicz Inequality (Q6161313) (← links)
- Quasi-subgradient methods with Bregman distance for quasi-convex feasibility problems (Q6561482) (← links)
- Self-adaptive algorithms for quasiconvex programming and applications to machine learning (Q6563122) (← links)
- A subgradient projection method for quasiconvex minimization (Q6624922) (← links)
