Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...

We formulate two new criteria of amenability of discrete equivalence relations: in terms of asymptotically invariant families of leafwise probability measures and in terms of isoperimetric properties of leafwise graph structures. These criteria lead to a geometric proof of the Connes{Feldman{Weiss theorem on coincidence of amenability and hyperrniteness for equivalence relations. Nous consid er...

In recent years, sequential optimality conditions are frequently used for convergence of iterative methods to solve nonlinear constrained optimization problems. The sequential optimality conditions do not require any of the constraint qualications. In this paper, We present the necessary sequential complementary approximate Karush Kuhn Tucker (CAKKT) condition for a point to be a solution of a ...

We consider when certain Banach sequence algebras A on the set N are approximately amenable. Some general results are obtained, and we resolve the special cases where A = ` p for 1 ≤ p < ∞, showing that these algebras are not approximately amenable. The same result holds for the weighted algebras ` (ω).

Almost forty years ago, Connes, Feldman and Weiss proved that for measurable equivalence relations the notions of amenability hyperfiniteness coincide. In this paper we define uniform version graphed bounded vertex degrees prove these two coincide as well. Roughly speaking, a measured graph $\mathcal {G}$ is uniformly hyperfinite if any ${\varepsilon }>0$ there exists $K\geq 1$ such not only {G...