15 citations · 54 across the 38 of their papers we have counts for
4 papers · 1 filter
Speeding up the Goemans-Williamson randomized procedure by difference-of-convex optimization
Hadi Salloum, Roland Hildebrand, Nhat Trung Nguyen +4
We present a novel approach to accelerate the Goemans-Williamson (GW) randomized rounding procedure for quadratic unconstrained binary optimization (QUBO) problems. Instead of solv…
Lipschitz-Free Mirror Descent Methods for Non-Smooth Optimization Problems
Bowen Yuan, Mohammad S. Alkousa
The part of the analysis of the convergence rate of the mirror descent method that is connected with the adaptive time-varying step size rules due to Alkousa et al. (MOTOR 2024, pp…
On Solving Minimization and Min-Max Problems by First-Order Methods with Relative Error in Gradients
Artem Vasin, Valery Krivchenko, Dmitry Kovalev +6
First-order methods for minimization and saddle point (min-max) problems are widely used for solving large-scale problems, in particular arising in machine learning. The majority o…
Mirror Descent Methods with Weighting Scheme for Outputs for Constrained Variational Inequality Problems
Mohammad S. Alkousa, Belal A. Alashqar, Fedor S. Stonyakin +2
This paper is devoted to the variational inequality problems. We consider two classes of problems, the first is classical constrained variational inequality and the second is the s…