/pdf/convex-analysisnoer-san-nojin-zhan-nituite-5dl2rbmoyr.pdf

Convex Analysisの二,三の進展について

In view of the minimization of a nonsmooth nonconvex function f, we prove an abstract convergence result for descent methods satisfying a sufficient-decrease assumption, and allowing a relative error tolerance. Our result guarantees the convergence of bounded sequences, under the assumption that the function f satisfies the Kurdyka–Łojasiewicz inequality. This assumption allows to cover a wide range of problems, including nonsmooth semi-algebraic (or more generally tame) minimization. The specialization of our result to different kinds of structured problems provides several new convergence results for inexact versions of the gradient method, the proximal method, the forward–backward splitting algorithm, the gradient projection and some proximal regularization of the Gauss–Seidel method in a nonconvex setting. Our results are illustrated through feasibility problems, or iterative thresholding procedures for compressive sensing.

/pdf/convergence-of-descent-methods-for-semi-algebraic-and-tame-sdj1f3ttk2.pdf

Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods

“Multivalued Analysis” is the theory of set-valued maps (called multifonctions) and has important applications in many different areas. Multivalued analysis is a remarkable mixture of many different parts of mathematics such as point-set topology, measure theory and nonlinear functional analysis. It is also closely related to “Nonsmooth Analysis” (Chapter 5) and in fact one of the main motivations behind the development of the theory, was in order to provide necessary analytical tools for the study of problems in nonsmooth analysis. It is not a coincidence that the development of the two fields coincide chronologically and follow parallel paths. Today multivalued analysis is a mature mathematical field with its own methods, techniques and applications that range from social and economic sciences to biological sciences and engineering. There is no doubt that a modern treatise on “Nonlinear Functional Analysis” can not afford the luxury of ignoring multivalued analysis. The omission of the theory of multifunctions will drastically limit the possible applications.

SET-Valued Analysis

Lecture Notes in Economics and Mathematical Systems

This chapter relates the notions of mutations with the concept of graphical derivatives of set-valued maps and more generally links the above results of morphological analysis with some basic facts of set-valued analysis that we shall recall.

Set-valued analysis

The paper presents a general classification scheme of necessary and sufficient criteria for the error bound property incorporating the existing conditions. Several derivative-like objects both from the primal as well as from the dual space are used to characterize the error bound property of extended-real-valued functions on a Banach space.

/pdf/error-bounds-necessary-and-sufficient-conditions-1fsimm39ye.pdf

Error Bounds: Necessary and Sufficient Conditions

The paper continues investigations of stationarity and regularity properties of collections of sets in normed spaces It contains a summary of different characterizations (both primal and dual) of regularity and a list of sufficient conditions for a collection of sets to be regular

/pdf/about-regularity-of-collections-of-sets-3pj9hgj95l.pdf

About Regularity of Collections of Sets

Necessary and sufficient criteria for metric subregularity (or calmness) of set-valued mappings between general metric or Banach spaces are treated in the framework of the theory of error bounds for a special family of extended real-valued functions of two variables. A classification scheme for the general error bound and metric subregularity criteria is presented. The criteria are formulated in terms of several kinds of primal and subdifferential slopes.

Error bounds and metric subregularity

Stationarity and regularity concepts for the three typical for variational analysis classes of objects - real-valued functions, collections of sets, and multifunctions - are investigated. An attempt is maid to present a classification scheme for such concepts and to show that properties introduced for objects from different classes can be treated in a similar way. Furthermore, in many cases the corresponding properties appear to be in a sense equivalent. The properties are defined in terms of certain constants which in the case of regularity properties provide also some quantitative characterizations of these properties. The relations between different constants and properties are discussed.

/pdf/about-stationarity-and-regularity-in-variational-analysis-1v2rm2lo4q.pdf

About stationarity and regularity in variational analysis

We synthesize and unify notions of regularity, both of individual sets and of collections of sets, as they appear in the convergence theory of projection methods for consistent feasibility problems. Several new characterizations of regularities are presented which shed light on the relations between seemingly different ideas and point to possible necessary conditions for local linear convergence of fundamental algorithms.

/pdf/set-regularities-and-feasibility-problems-4x2wioy8q5.pdf

Alexander Y. Kruger

Papers

Error Bounds: Necessary and Sufficient Conditions

About Regularity of Collections of Sets

Error bounds and metric subregularity

About stationarity and regularity in variational analysis

Set regularities and feasibility problems