- 1、本文档共17页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
《2016 Approximate Level Method for Nonsmooth Convex Minimization》.pdf
J Optim Theory Appl (2012) 152:334–350
DOI 10.1007/s10957-011-9908-1
Approximate Level Method for Nonsmooth Convex
Minimization
Peter Richtárik
Received: 18 February 2011 / Accepted: 27 July 2011 / Published online: 9 September 2011
© Springer Science+Business Media, LLC 2011
Abstract In this paper, we propose and analyse an approximate variant of the level
method of Lemaréchal, Nemirovskii and Nesterov for minimizing nonsmooth convex
functions. The main per-iteration work of the level method is spent on (i) minimizing
a piecewise-linear model of the objective function and (ii) projecting onto the inter-
section of the feasible region and a level set of the model function. We show that,
by replacing exact computations in both cases by approximate computations, in rela-
tive scale, the theoretical iteration complexity increases only by a small factor which
depends on the approximation level and reduces to one in the exact case.
Keywords Level method · Approximate projections in relative scale · Nonsmooth
convex minimization · Sensitivity analysis · Large-scale optimization
1 Introduction
In this paper, we consider the problem of minimizing a Lipschitz continuous and
convex objective function on a compact and convex feasible set. We assume that all
Communicated by Marcin Studniarski.
The research results presented in this paper have been supported by a grant “Action de recherche
concertée ARC 04/09-315” from the “Direction de la recherche scientifique—Communauté française
de Belgique”. This paper presents research results of the Belgian Program on Interuniversity Poles
of Attraction initiated by the Belgian State, Prime Minister’s Office, Science Policy Programming.
The scientific responsibility is assumed by the author(s).
The author wishes to thank Yurii Nesterov for enlightening discussions and suggestions that greatly
helped to improve the paper, and to Robert Chares and two anonymous referees for carefully reading
the man
您可能关注的文档
- 《1883[]Brodric The reform of the English land system》.pdf
- 《19 The Mean Sea Level Aquifer》.pdf
- 《1910.Java经典入门教程 》.pdf
- 《1983 Surrogate duality relaxation for job shop scheduling》.pdf
- 《1987 Scheduling jobs with release dates and tails on identical machines to minimize the makespan》.pdf
- 《1988 The Shifting Bottleneck Procedure for Job Shop Scheduling》.pdf
- 《1988level set》.pdf
- 《1990 B A real snow job》.pdf
- 《1990 Scheduling jobs with simple precedence constraints on parallel machines》.pdf
- 《1991 A branch and bound algorithm for job-shop scheduling》.pdf
- 江苏省灌云高级中学2023-2024学年高三上学期第一次月考地理试题含答案.docx
- 备战2024年高考物理一轮重难点复习 第十三章 近代物理.docx
- 江苏省高邮市一中2021-2022学年高三上学期第一次月考语文试题(原卷版).docx
- 江苏省华罗庚中学2023-2024学年高三上学期12月阶段检测数学试卷含答案.docx
- 江苏省海门中学2023-2024学年高三上学期第一次调研考试地理试题及答案.docx
- 备战2024年高考物理一轮重难点复习 第九章 恒定电流.docx
- 江苏省高邮市2023-2024学年高三下学期3月学情调研数学试题含答案.docx
- 备战2024年高考物理一轮重难点复习 实验十一:探究影响感应电流方向的因素.docx
- 备战2024年高考物理一轮重难点复习 实验三:验证平行四边形定则.docx
- 备战2024年高考物理一轮重难点复习 第十四章 光.docx
文档评论(0)