zbMATH — the first resource for mathematics

Examples
 Geometry Search for the term Geometry in any field. Queries are case-independent. Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact. "Topological group" Phrases (multi-words) should be set in "straight quotation marks". au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted. Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff. "Quasi* map*" py: 1989 The resulting documents have publication year 1989. so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14. "Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic. dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles. py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses). la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
 a & b logic and a | b logic or !ab logic not abc* right wildcard "ab c" phrase (ab c) parentheses
Fields
 any anywhere an internal document identifier au author, editor ai internal author identifier ti title la language so source ab review, abstract py publication year rv reviewer cc MSC code ut uncontrolled term dt document type (j: journal article; b: book; a: book article)
Convex expected residual models for stochastic affine variational inequality problems and its application to the traffic equilibrium problem. (English) Zbl 1193.65107

The authors consider the expected residual (ER) method which makes use of a residual function for the affine variational inequality problem (AVIP): Find $x\in S$ such that $〈Mx+q,y-x〉\ge 0$ $\forall y\in S$, where $S=\left\{y\in {ℝ}^{n}|Ay=b,y\ge 0\right\}$ with $A\in {ℝ}^{m×n}$ and $b\in {ℝ}^{m}$, and $M\subset {ℝ}^{n×n},q\in {ℝ}^{n}$. The AVIP is a wide class of problems which includes the quadratic programming problem and the linear complementarity problem. The ER method solves the optimization problem: $minE\left(\left[r\left(x,\omega \right)\right]$ s.t. $x\in X$, where $r\left(·,\omega \right):{ℝ}^{n}\to {ℝ}_{+}$ is a residual function for the variational inequality problem, $E$ denotes the expectation. The ER model for the stochastic affine variational problem (SAVIP) based on the regularized gap function and the D-gap function for the AVIP is considered.

Main result: The authors establish convexity of both the regularized gap function and the D-gap function and show that the resulting ER models with the proposed residual functions are convex. One of the ER models proposed here, the ER-D model, is then applied to the traffic equilibrium problem under uncertainty. In the numerical experiment, the ER-D model is compared with the MCP formulation-based ER model with the Fischer-Burmeister function.

The numerical results show that when the demand $D\left(\omega \right)$ is fixed (200) for all $\omega \in {\Omega }$ (the sample space of factors contributing to the uncertainty in the traffic network, such as weather and accidents, $D\left(\omega \right):$ vector with components ${D}_{W}\left(\omega \right)$ – travel demand under uncertainty for OD-pair $w\in W$ – the set of origin-destination pairs in a network $𝒢$), the proposed ER-D model with large $\alpha$ (the regularized gap function ${f}_{\alpha }$) can obtain more reasonable solutions since the obtained route flows tend to satisfy the demand condition. Moreover, the demand condition is not greatly affected by the increase in the variance of $\omega$, that is, in the change in $\delta$, as compared to the ER-FB model (the effect of $\delta$, which defines the interval ${\Omega }=\left[\frac{1}{2}-\delta ,\frac{1}{2}+\delta \right]$, on the feasibility of the solutions obtained by the two ER methods).

MSC:
 65K15 Numerical methods for variational inequalities and related problems 90C15 Stochastic programming 90B20 Traffic problems 49J40 Variational methods including variational inequalities 49J55 Optimal stochastic control (existence)