activity
20192022
most citedDynamic pricing under nested logit demand

3 citations · 4 across the 6 of their papers we have counts for

collaborators

9 papers

math.OC2022

On local uniqueness of normalized Nash equilibria

Vladimir Shikhman

For generalized Nash equilibrium problems (GNEP) with shared constraints we focus on the notion of normalized Nash equilibrium in the nonconvex setting. The property of nondegenera…

math.OC2021

Network manipulation algorithm based on inexact alternating minimization

David Müller, Vladimir Shikhman

In this paper, we present a network manipulation algorithm based on an alternating minimization scheme from (Nesterov 2020). In our context, the latter mimics the natural behavior…

math.OC2021

Regularized quasi-monotone method for stochastic optimization

Vyacheslav Kungurtsev, Vladimir Shikhman

We adapt the quasi-monotone method from [2] for composite convex minimization in the stochastic setting. For the proposed numerical scheme we derive the optimal convergence rate in…

math.OC20211 cited

Cardinality-constrained optimization problems in general position and beyond

Vladimir Shikhman, Sebastian Lämmel

We study cardinality-constrained optimization problems (CCOP) in general position, i. e. those optimization-related properties that are fulfilled for a dense and open subset of the…

math.OC20213 cited

Dynamic pricing under nested logit demand

David Müller, Yurii Nesterov, Vladimir Shikhman

Recently, there is growing interest and need for dynamic pricing algorithms, especially, in the field of online marketplaces by offering smart pricing options for big online stores…

math.OC2020

Topological approach to mathematicalprograms with switching constraints

Vladimir Shikhman

We study mathematical programs with switching constraints (MPSC)from the topological perspective. Two basic theorems from Morse theory are proved. Outside the W-stationary point se…