A result due to D. Luenberger on the existence of multipliers in a quasiconvex programming problem is extended to the case of constraints given by an arbitrary convex cone under a constraint qualification condition more general than Slater’s condition. The existence of solutions is not assumed. We point out links with even convexity in the sense of Fenchel, quasisubdifferentiability in the sens...

Since detecting race conditions in a multithreaded or multiprocess program is an NP-hard problem, there is no efficient algorithm that can help detect race conditions in a program. As such, there are no easy-touse pedagogical tools. Most operating systems and concurrent programming textbooks only provide a formal definition and some trivial examples. This is insufficient for students to learn h...

This paper is devoted to the analysis of a special kind of regularity of multifunction which we call metric pseudo-(sub)regularity, when the multifunction is not metrically (sub)regular at a given point but is metrically (sub)regular at certain points in a neighborhood with moduli possibly tending to infinity with a certain order. By using advanced techniques of generalized differentiation we d...

A new duality theory is developed for a class of stochastic programs in which the probability distribution is not necessarily discrete. This provides a new framework for problems which are not necessarily bounded, are not required to have relatively complete recourse, and do not satisfy the typical Slater condition of strict feasibility. These problems instead satisfy a different constraint qua...

We consider systems governed by a nonlinear parabolic equation, with a distributed control and a disturbance in the initial condition. We prove the existence of solutions to a corresponding minimax problem, and we obtain necessary optimality conditions in the form of Pontryagin’s principles.

1 The " convex " KKT theorem: a recapitulation We recall the Karush-Kuhn-Tucker theorem for convex programming, as treated in the previous lecture (see Corollary 3.5 of [OSC]).

After a brief summary of Tauberian conditions for ordinary sequences of numbers, we consider summability of double sequences of real or complex numbers by weighted meanmethods which are not necessarily products of related weighted mean methods in one variable. Our goal is to obtain Tauberian conditions under which convergence of a double sequence follows from its summability, where convergence ...