Pure characteristics demand models and distributionally robust mathematical programs with stochastic complementarity constraints
DOI10.1007/s10107-021-01720-4OpenAlexW3209984519MaRDI QIDQ2693648
Publication date: 24 March 2023
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.04933
regularizationdiscrete approximationstochastic equilibriumdistributionally robustpure characteristics demand
Nonconvex programming, global optimization (90C26) Stochastic programming (90C15) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approximation scheme for a class of risk-averse stochastic equilibrium problems
- Approximating stationary points of stochastic mathematical programs with equilibrium constraints via sample averaging
- Error bounds for nondegenerate monotone linear complementarity problems
- A class of quadratic programs with linear complementarity constraints
- Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization
- Global error bounds for monotone affine variational inequality problems
- On affine scaling algorithms for nonconvex quadratic programming
- New improved error bounds for the linear complementarity problem
- Distributionally robust optimization with matrix moment constraints: Lagrange duality and cutting plane methods
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Notes on some constraint qualifications for mathematical programs with equilibrium constraints
- On distributionally robust chance constrained programs with Wasserstein distance
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Integrals of set-valued functions
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- Quantitative Stability Analysis for Distributionally Robust Optimization with Moment Constraints
- Constrained Optimization Approaches to Estimation of Structural Models
- A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
- Multistage Stochastic Optimization
- Regularized Mathematical Programs with Stochastic Equilibrium Constraints: Estimating Structural Demand Models
- Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
- Nonconvex Games with Side Constraints
- An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints
- A Constructive Approach to Estimating Pure Characteristics Demand Models with Pricing
- Stochastic mathematical programs with equilibrium constraints, modelling and sample average approximation
- Perturbation Bounds of P-Matrix Linear Complementarity Problems
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- Exact penalty for mathematical programs with linear complementarity constraints
- Ambiguous Joint Chance Constraints Under Mean and Dispersion Information
- On Deterministic Reformulations of Distributionally Robust Joint Chance Constrained Optimization Problems
- Error bounds for monotone linear complementarity problems
- Discrete Approximation and Quantification in Distributionally Robust Optimization
- A Social Equilibrium Existence Theorem*
This page was built for publication: Pure characteristics demand models and distributionally robust mathematical programs with stochastic complementarity constraints
