Direct search for stochastic optimization in random subspaces with zeroth-, first-, and second-order convergence and expected complexity

Ähnliche Einträge

• Stochastic trust-region algorithm in random subspaces with convergence and expected complexity analyses
  von: Dzahini, Kwassi Joseph, et al.
  Veröffentlicht: (2022)
• Direct-search methods in the year 2025: Theoretical guarantees and algorithmic paradigms
  von: Dzahini, K. J., et al.
  Veröffentlicht: (2024)
• On the irreducibility and convergence of a class of nonsmooth nonlinear state-space models on manifolds and their applications to zeroth-order optimization
  von: Gissler, Armand, et al.
  Veröffentlicht: (2024)
• Subdifferentially polynomially bounded functions and Gaussian smoothing-based zeroth-order optimization
  von: Lei, Ming, et al.
  Veröffentlicht: (2024)
• Computer-aided analyses of stochastic first-order methods, via interpolation conditions for stochastic optimization
  von: Rubbens, Anne, et al.
  Veröffentlicht: (2025)