arXiv subjects

Nguyen H. Thao

Publications and source records attributed to Nguyen H. Thao.

8 recordsLinked to original sources

arXiv2018

Necessary conditions for linear convergence of iterated expansive, set-valued mappings with application to alternating projections

We present necessary conditions for monotonicity, in one form or another, of fixed point iterations of mappings that violate the usual nonexpansive property. We show that most reasonable notions of linear-type monotonicity of fixed point sequences imply {\em metric subregularity}. This is specialized to the alternating projections iteration where the metric subregularity property takes on a distinct geometric characterization of sets at points of intersection called {\em subtransversality}. Our more general results for fixed point iterations are specialized to establish the necessity of subtransversality for consistent feasibility with a number of reasonable types of sequential monotonicity, under varying degrees of assumptions on the regularity of the sets.

math.OC↗

arXiv2017

About subtransversality of collections of sets

We provide dual sufficient conditions for subtransversality of collections of sets in an Asplund space setting. For the convex case, we formulate a necessary and sufficient dual criterion of subtransversality in general Banach spaces. Our more general results suggest an intermediate notion of subtransversality, what we call weak intrinsic subtransversality, which lies between intrinsic transversality and subtransversality in Asplund spaces.

math.OC↗

arXiv2017

Quantitative convergence analysis of iterated expansive, set-valued mappings

We develop a framework for quantitative convergence analysis of Picard iterations of expansive set-valued fixed point mappings. There are two key components of the analysis. The first is a natural generalization of single-valued averaged mappings to expansive, set-valued mappings that characterizes a type of strong calmness of the fixed point mapping. The second component to this analysis is an extension of the well-established notion of metric subregularity -- or inverse calmness -- of the mapping at fixed points. Convergence of expansive fixed point iterations is proved using these two properties, and quantitative estimates are a natural byproduct of the framework. To demonstrate the application of the theory, we prove for the first time a number of results showing local linear convergence of nonconvex cyclic projections for inconsistent (and consistent) feasibility problems, local linear convergence of the forward-backward algorithm for structured optimization without convexity, strong or otherwise, and local linear convergence of the Douglas--Rachford algorithm for structured nonconvex minimization. This theory includes earlier approaches for known results, convex and nonconvex, as special cases.

math.OC↗

arXiv2016

Set Regularities and Feasibility Problems

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.

math.OC↗

arXiv2015

An induction theorem and nonlinear regularity models

A general nonlinear regularity model for a set-valued mapping $F:X\times R_+\rightrightarrows Y$, where $X$ and $Y$ are metric spaces, is considered using special iteration procedures, going back to Banach, Schauder, Lusternik and Graves. Namely, we revise the induction theorem from Khanh, J. Math. Anal. Appl., 118 (1986) and employ it to obtain basic estimates for studying regularity/openness properties. We also show that it can serve as a substitution of the Ekeland variational principle when establishing other regularity criteria. Then, we apply the induction theorem and the mentioned estimates to establish criteria for both global and local versions of regularity/openness properties for our model and demonstrate how the definitions and criteria translate into the conventional setting of a set-valued mapping $F:X\rightrightarrows Y$.

math.OC↗

arXiv2015

Regularity of collections of sets and convergence of inexact alternating projections

We study the usage of regularity properties of collections of sets in convergence analysis of alternating projection methods for solving feasibility problems. Several equivalent characterizations of these properties are provided. Two settings of inexact alternating projections are considered and the corresponding convergence estimates are established and discussed.

math.OC↗

arXiv2014

About [q]-regularity properties of collections of sets

We examine three primal space local Hoelder type regularity properties of finite collections of sets, namely, [q]-semiregularity, [q]-subregularity, and uniform [q]-regularity as well as their quantitative characterizations. Equivalent metric characterizations of the three mentioned regularity properties as well as a sufficient condition of [q]-subregularity in terms of Frechet normals are established. The relationships between [q]-regularity properties of collections of sets and the corresponding regularity properties of set-valued mappings are discussed.

math.OC↗

arXiv2013

About uniform regularity of collections of sets

We further investigate the uniform regularity property of collections of sets via primal and dual characterizing constants. These constants play an important role in determining convergence rates of projection algorithms for solving feasibility problems.

math.OC↗