反例和 "不连续函数直接搜索分析 "结果的额外揭示性投票步骤

IF 2.2 2区 数学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING Mathematical Programming Pub Date : 2024-01-08 DOI:10.1007/s10107-023-02042-3
{"title":"反例和 \"不连续函数直接搜索分析 \"结果的额外揭示性投票步骤","authors":"","doi":"10.1007/s10107-023-02042-3","DOIUrl":null,"url":null,"abstract":"<h3>Abstract</h3> <p>This note provides a counterexample to a theorem announced in the last part of the paper (Vicente and Custódio Math Program 133:299–325, 2012). The counterexample involves an objective function <span> <span>\\(f: \\mathbb {R}\\rightarrow \\mathbb {R}\\)</span> </span> which satisfies all the assumptions required by the theorem but contradicts some of its conclusions. A corollary of this theorem is also affected by this counterexample. The main flaw revealed by the counterexample is the possibility that a directional direct search method (dDSM) generates a sequence of trial points <span> <span>\\((x_k)_{k \\in \\mathbb {N}}\\)</span> </span> converging to a point <span> <span>\\(x_*\\)</span> </span> where <em>f</em> is discontinuous, lower semicontinuous and whose objective function value <span> <span>\\(f(x_*)\\)</span> </span> is strictly less than <span> <span>\\(\\lim _{k\\rightarrow \\infty } f(x_k)\\)</span> </span>. Moreover the dDSM generates trial points in only one of the continuity sets of <em>f</em> near <span> <span>\\(x_*\\)</span> </span>. This note also investigates the proof of the theorem to highlight the inexact statements in the original paper. Finally this work introduces a modification of the dDSM that allows, in usual cases, to recover the properties broken by the counterexample. </p>","PeriodicalId":18297,"journal":{"name":"Mathematical Programming","volume":"1 1","pages":""},"PeriodicalIF":2.2000,"publicationDate":"2024-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Counterexample and an additional revealing poll step for a result of “analysis of direct searches for discontinuous functions”\",\"authors\":\"\",\"doi\":\"10.1007/s10107-023-02042-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<h3>Abstract</h3> <p>This note provides a counterexample to a theorem announced in the last part of the paper (Vicente and Custódio Math Program 133:299–325, 2012). The counterexample involves an objective function <span> <span>\\\\(f: \\\\mathbb {R}\\\\rightarrow \\\\mathbb {R}\\\\)</span> </span> which satisfies all the assumptions required by the theorem but contradicts some of its conclusions. A corollary of this theorem is also affected by this counterexample. The main flaw revealed by the counterexample is the possibility that a directional direct search method (dDSM) generates a sequence of trial points <span> <span>\\\\((x_k)_{k \\\\in \\\\mathbb {N}}\\\\)</span> </span> converging to a point <span> <span>\\\\(x_*\\\\)</span> </span> where <em>f</em> is discontinuous, lower semicontinuous and whose objective function value <span> <span>\\\\(f(x_*)\\\\)</span> </span> is strictly less than <span> <span>\\\\(\\\\lim _{k\\\\rightarrow \\\\infty } f(x_k)\\\\)</span> </span>. Moreover the dDSM generates trial points in only one of the continuity sets of <em>f</em> near <span> <span>\\\\(x_*\\\\)</span> </span>. This note also investigates the proof of the theorem to highlight the inexact statements in the original paper. Finally this work introduces a modification of the dDSM that allows, in usual cases, to recover the properties broken by the counterexample. </p>\",\"PeriodicalId\":18297,\"journal\":{\"name\":\"Mathematical Programming\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":2.2000,\"publicationDate\":\"2024-01-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematical Programming\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10107-023-02042-3\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Programming","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10107-023-02042-3","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

摘要

摘要 本注释提供了论文最后一部分(Vicente and Custódio Math Program 133:299-325, 2012)中公布的一个定理的反例。该反例涉及一个目标函数(f: \mathbb {R}\rightarrow \mathbb {R}/),它满足定理所要求的所有假设,但与定理的某些结论相矛盾。该定理的一个推论也受到了这个反例的影响。这个反例揭示的主要缺陷是定向直接搜索法(dDSM)有可能产生一连串的试验点 \((x_k)_{k \in \mathbb {N}}\) 收敛到 f 不连续的点\(x_*\)、并且其目标函数值 (f(x_*))严格小于 (f(x_k))。此外,dDSM 只在在\(x_*\)附近的 f 的连续性集合中的一个集合中产生试验点。本注释还研究了定理的证明,以突出原论文中不精确的陈述。最后,本文介绍了对 dDSM 的修改,在通常情况下,它可以恢复被反例破坏的性质。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Counterexample and an additional revealing poll step for a result of “analysis of direct searches for discontinuous functions”

Abstract

This note provides a counterexample to a theorem announced in the last part of the paper (Vicente and Custódio Math Program 133:299–325, 2012). The counterexample involves an objective function  \(f: \mathbb {R}\rightarrow \mathbb {R}\) which satisfies all the assumptions required by the theorem but contradicts some of its conclusions. A corollary of this theorem is also affected by this counterexample. The main flaw revealed by the counterexample is the possibility that a directional direct search method (dDSM) generates a sequence of trial points  \((x_k)_{k \in \mathbb {N}}\) converging to a point  \(x_*\) where f is discontinuous, lower semicontinuous and whose objective function value  \(f(x_*)\) is strictly less than  \(\lim _{k\rightarrow \infty } f(x_k)\) . Moreover the dDSM generates trial points in only one of the continuity sets of f near  \(x_*\) . This note also investigates the proof of the theorem to highlight the inexact statements in the original paper. Finally this work introduces a modification of the dDSM that allows, in usual cases, to recover the properties broken by the counterexample.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Mathematical Programming
Mathematical Programming 数学-计算机:软件工程
CiteScore
5.70
自引率
11.10%
发文量
160
审稿时长
4-8 weeks
期刊介绍: Mathematical Programming publishes original articles dealing with every aspect of mathematical optimization; that is, everything of direct or indirect use concerning the problem of optimizing a function of many variables, often subject to a set of constraints. This involves theoretical and computational issues as well as application studies. Included, along with the standard topics of linear, nonlinear, integer, conic, stochastic and combinatorial optimization, are techniques for formulating and applying mathematical programming models, convex, nonsmooth and variational analysis, the theory of polyhedra, variational inequalities, and control and game theory viewed from the perspective of mathematical programming.
期刊最新文献
Did smallpox cause stillbirths? Maternal smallpox infection, vaccination, and stillbirths in Sweden, 1780-1839. Fast convergence to non-isolated minima: four equivalent conditions for $${\textrm{C}^{2}}$$ functions Complexity of chordal conversion for sparse semidefinite programs with small treewidth Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty Accelerated stochastic approximation with state-dependent noise
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1