Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userPolyhedrality,Complementarity and Regularity with Applications to Variational Inequalities over Polyhedral Sets
89
0
0.0
(
0
)
Authors
Alexander D. Ioffe
Ask ChatGPT about the research
No Arabic abstract
The regularity theory for variational inequalities over polyhedral sets developed in a series of papers by Robinson, Ralph and Dontchev-Rockafellar in the 90s has long become classics of variational analysis. But in the available proofs of almost all main results, fairly nontrivial as they are, techniques of variational analysis do not play a significant part. In the paper we develop a new approach that allows to obtain some generalizations of the the mentioned results without invoking anything beyond elementary geometry of convex polyhedra and some basic facts of the theory of metric regularity.
rate research
Read More
We develop a data-driven approach to the computation of a-posteriori feasibility certificates to the solution sets of variational inequalities affected by uncertainty. Specifically, we focus on instances of variational inequalities with a deterministic mapping and an uncertain feasibility set, and represent uncertainty by means of scenarios. Building upon recent advances in the scenario approach literature, we quantify the robustness properties of the entire set of solutions of a variational inequality, with feasibility set constructed using the scenario approach, against a new unseen realization of the uncertainty. Our results extend existing results that typically impose an assumption that the solution set is a singleton and require certain non-degeneracy properties, and thereby offer probabilistic feasibility guarantees to any feasible solution. We show that assessing the violation probability of an entire set of solutions, rather than of a singleton, requires enumeration of the support constraints that shape this set. Additionally, we propose a general procedure to enumerate the support constraints that does not require a closed form description of the solution set, which is unlikely to be available. We show that robust game theory problems can be modelling via uncertain variational inequalities, and illustrate our theoretical results through extensive numerical simulations on a case study involving an electric vehicle charging coordination problem.
In this paper, we establish spectral inequalities on measurable sets of positive Lebesgue measure for the Stokes operator, as well as an observability inequalities on space-time measurable sets of positive measure for non-stationary Stokes system. Furthermore, we provide their applications in the theory of shape optimization and time optimal control problems.
In infinite-dimensional Hilbert spaces we device a class of strongly convergent primal-dual schemes for solving variational inequalities defined by a Lipschitz continuous and pseudomonote map. Our novel numerical scheme is based on Tsengs forward-backward-forward scheme, which is known to display weak convergence, unless very strong global monotonicity assumptions are made on the involved operators. We provide a simple augmentation of this algorithm which is computationally cheap and still guarantees strong convergence to a minimal norm solution of the underlying problem. We provide an adaptive extension of the algorithm, freeing us from requiring knowledge of the global Lipschitz constant. We test the performance of the algorithm in the computationally challenging task to find dynamic user equilibria in traffic networks and verify that our scheme is at least competitive to state-of-the-art solvers, and in some case even improve upon them.
It is well-known that the convex and concave envelope of a multilinear polynomial over a box are polyhedral functions. Exponential-sized extended and projected formulations for these envelopes are also known. We consider the convexification question for multilinear polynomials that are symmetric with respect to permutations of variables. Such a permutation-invariant structure naturally implies a quadratic-sized extended formulation for the envelopes through the use of disjunctive programming. The optimization and separation problems are answered directly without using this extension. The problem symmetry allows the optimization and separation problems to be answered directly without using any extension. It also implies that permuting the coefficients of a core set of facets generates all the facets. We provide some necessary conditions and some sufficient conditions for a valid inequality to be a core facet. These conditions are applied to obtain envelopes for two classes: symmetric supermodular functions and multilinear monomials with reflection symmetry, thereby yielding alternate proofs to the literature. Furthermore, we use constructs from the reformulation-linearization-technique to completely characterize the set of points lying on each facet.
The aim of this paper is to establish an abstract theory based on the so-called fractional-maximal distribution functions (FMDs). From the rough ideas introduced in~cite{AM2007}, we develop and prove some abstract results related to the level-set inequalities and norm-comparisons by using the language of such FMDs. Particularly interesting is the applicability of our approach that has been shown in regularity and Calderon-Zygmund type estimates. In this paper, due to our research experience, we will establish global regularity estimates for two types of general quasilinear problems (problems with divergence form and double obstacles), via fractional-maximal operators and FMDs. The range of applications of these abstract results is large. Apart from these two examples of the regularity theory for elliptic equations discussed, it is also promising to indicate further possible applications of our approach for other special topics.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
