Pages that link to "Item:Q2812260"

The following pages link to Stochastic subgradient method for quasi-convex optimization problems (Q2812260):

Displaying 27 items.

• Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization (Q721146) (← links)
• A ranking-based adaptive artificial bee colony algorithm for global numerical optimization (Q778450) (← links)
• Convergence rates of subgradient methods for quasi-convex optimization problems (Q782917) (← links)
• Optimal and suboptimal solutions to stochastically uncertain problems of quintile optimization (Q927485) (← links)
• Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions (Q2010105) (← links)
• A stochastic subspace approach to gradient-free optimization in high dimensions (Q2044475) (← links)
• Inexact stochastic subgradient projection method for stochastic equilibrium problems with nonmonotone bifunctions: application to expected risk minimization in machine learning (Q2045021) (← links)
• Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems (Q2129140) (← links)
• Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces (Q2141725) (← links)
• A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization (Q2149551) (← links)
• A stochastic subgradient method for distributionally robust non-convex and non-smooth learning (Q2159458) (← links)
• Fixed point quasiconvex subgradient method (Q2282530) (← links)
• Stochastic subgradient method converges on tame functions (Q2291732) (← links)
• A nonrandom variational approach to stochastic linear quadratic Gaussian optimization involving fractional noises (FLQG) (Q2574323) (← links)
• Inexact subgradient methods for quasi-convex optimization problems (Q2629635) (← links)
• Stochastic intermediate gradient method for convex optimization problems (Q2631196) (← links)
• (Q4732307) (← links)
• A Stochastic Subgradient Method for Nonsmooth Nonconvex Multilevel Composition Optimization (Q4995000) (← links)
• A Variable Sample-Size Stochastic Quasi-Newton Method for Smooth and Nonsmooth Stochastic Convex Optimization (Q5076721) (← links)
• Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee (Q5088832) (← links)
• (Q5205499) (← links)
• Abstract convergence theorem for quasi-convex optimization problems with applications (Q5228820) (← links)
• (Q5432767) (← links)
• Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization (Q5737735) (← links)
• A Markovian Incremental Stochastic Subgradient Algorithm (Q6137490) (← links)
• Regularized quasi-monotone method for stochastic optimization (Q6155646) (← links)
• Quasi-subgradient methods with Bregman distance for quasi-convex feasibility problems (Q6561482) (← links)