- Full text PDF available (10)
This paper pursues a twofold goal. First to derive new results on generalized differentiation in variational analysis focusing mainly on a broad class of intrinsically nondifferentiable marginal/value functions. Then the results established in this direction apply to deriving necessary optimality conditions for the optimistic version of bilevel programs… (More)
This paper contains selected applications of the new tangential extremal principles and related results developed in  to calculus rules for infinite intersections of sets and optimality conditions for problems of semi-infinite programming and multiobjective optimization with countable constraints.
In this paper we develop new extremal principles in variational analysis that deal with finite and infinite systems of convex and nonconvex sets. The results obtained, unified under the name of tangential extremal principles, combine primal and dual approaches to the study of variational systems being in fact first extremal principles applied to infinite… (More)
Hepatocellular carcinoma (HCC) is the fifth most common cancer and it is the third leading cause of cancer-related deaths worldwide. Once diagnosed with the disease, only 30-40% of patients are deemed eligible for curative intention with treatment modalities including surgical resection, liver transplantation, and chemoembolization. Eventually, most… (More)
The Douglas–Rachford splitting algorithm is a classical optimization method that has found many applications. When specialized to two normal cone operators, it yields an algorithm for finding a point in the intersection of two convex sets. This method for solving feasibility problems has attracted a lot of attention due to its good performance even in… (More)
In this paper we introduce new notions of local extremality for finite and infinite systems of closed sets and establish the corresponding extremal principles for them called here rated extremal principles. These developments are in the core geometric theory of variational analysis. We present their applications to calculus and optimality conditions for… (More)
The problem of finding a vector with the fewest nonzero elements that satisfies an underdeter-mined system of linear equations is an NP-complete problem that is typically solved numerically via convex heuristics or nicely-behaved nonconvex relaxations. In this paper we consider the elementary method of alternating projections (MAP) for solving the sparsity… (More)