{"title":"Path-Based Incremental Target Level Algorithm for Nondifferentiable Optimization","authors":"Peng Zhang","doi":"10.1109/IWCFTA.2012.35","DOIUrl":null,"url":null,"abstract":"In this paper, we consider Path-Based incremental target level algorithm for a type of nondifferentiable optimization in a Hilbert space. We prove that the problem has solutions when the constraint set is bounded, and the sequence generated in this way is weakly convergence.","PeriodicalId":354870,"journal":{"name":"2012 Fifth International Workshop on Chaos-fractals Theories and Applications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Fifth International Workshop on Chaos-fractals Theories and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWCFTA.2012.35","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
In this paper, we consider Path-Based incremental target level algorithm for a type of nondifferentiable optimization in a Hilbert space. We prove that the problem has solutions when the constraint set is bounded, and the sequence generated in this way is weakly convergence.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
