期刊
OPERATIONS RESEARCH LETTERS
卷 44, 期 6, 页码 790-795出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.orl.2016.10.003
关键词
Composite optimization; Gauss-Newton method; KL inequality; Value function; Convergence
资金
- Air Force Office of Scientific Research, Air Force Material Command, USAF [FA9550-15-1-0500]
This works aims at understanding further convergence properties of first order local search methods with complex geometries. We focus on the composite optimization model which unifies within a simple formalism many problems of this type. We provide a general convergence analysis of the composite Gauss-Newton method as introduced in Burke and Ferris (1995) (studied further in Chong and Wang, 2002; Chong and Ng, 2007; Lewis and Wright, 2015) under tameness assumptions (an extension of semi-algebraicity). Tameness is a very general condition satisfied by virtually all problems solved in practice. The analysis is based on recent progresses in understanding convergence properties of sequential convex programming methods through the value function as introduced in Bolte and Pauwels (2016). (C) 2016 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据