We study deterministic and stochastic optimization over the Stiefel manifold, explicitly allowing iterates to deviate from the manifold rather than enforcing feasibility via retraction at each step. We introduce Landom, a Landing-type method that constructs momentum in the relative-gradient direction, maps this update...
Yuxuan Zeng, Qin-Wen Deng, D. Ge et al.· 0 citations
Let $\Delta_u(d,n)$ be the maximum graph diameter of a pointed $d$-dimensional polyhedron with $n$ facets. Using a curved-path encoding of the iterated Kalai--Kleitman recurrence, we prove, uniformly over $n\geq d\geq 4$, \[ \Delta_u(d,n) \leq (n-d)^{\log_2 G_d},\qquad G_d = (4\ln 2+o(1))\frac{d}{(\ln d)^2}, \] where t...
In this study, we examine a scenario where each customer strategically selects their arrival time at a queue, aiming to minimize their total costs, which include waiting, tardiness, and earliness costs. Building on the mixed strategy framework studied by Moshe Haviv, which provides a closed-form arrival time distribu...
Xiang-Jie Zhao, Yi-Chuan Ding, Dong-Dong Ge et al.· Production and operations ma...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.