دورية أكاديمية

Set regularities and feasibility problems.

التفاصيل البيبلوغرافية
العنوان: Set regularities and feasibility problems.
المؤلفون: Kruger, Alexander Y., Luke, D. Russell, Thao, Nguyen H.
المصدر: Mathematical Programming; Mar2018, Vol. 168 Issue 1/2, p279-311, 33p
مصطلحات موضوعية: FEASIBILITY problem (Mathematical optimization), HOLDER spaces, METRIC spaces, CONES, MAXIMA & minima
مستخلص: 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. [ABSTRACT FROM AUTHOR]
Copyright of Mathematical Programming is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
قاعدة البيانات: Complementary Index
الوصف
تدمد:00255610
DOI:10.1007/s10107-016-1039-x