Discrete Choice Prox-Functions on the Simplex

DOI10.1287/moor.2021.1136zbMath1492.90129arXiv1909.05591OpenAlexW3183471501MaRDI QIDQ5076710

Vladimir Shikhman, David Müller, Yu. E. Nesterov

Publication date: 17 May 2022

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.05591

zbMATH Keywords

convex programmingdiscrete choicedual averagingadditive random utility modelsconsumption cycleprox-function

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90)

Related Items (1)

Network manipulation algorithm based on inexact alternating minimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Primal-dual subgradient methods for convex problems
• Lectures on convex optimization
• Quasi-monotone subgradient methods for nonsmooth convex minimization
• Persistency Model and Its Applications in Choice Modeling
• Excessive revenue model of competitive markets
• A Discrete Choice Model for Ordered Alternatives
• A Representative Consumer Theory of the Logit Model
• Discrete Choice Methods with Simulation
• On the surjectivity of the mapping between utilities and choice probabilities
• Technical Note—On the Relation Between Several Discrete Choice Models
• A Convex Optimization Approach for Computing Correlated Choice Probabilities With Many Alternatives
• Choice Prediction With Semidefinite Optimization When Utilities are Correlated
• On the Global Convergence of Stochastic Fictitious Play
• Convex Functions on Convex Polytopes

This page was built for publication: Discrete Choice Prox-Functions on the Simplex