{"title":"Finding ε-Global Optimal Value of a One-dimensional Periodic Function in an Interval Based on Fourier Series and Semi-definite Programming","authors":"H. Chen, Churen Sun","doi":"10.1109/BCGIN.2011.86","DOIUrl":null,"url":null,"abstract":"One-dimensional global optimization of a function f(x) in an interval D is still a difficult problem. In this paper, we pose a new method for finding the ε-global optimal value of f(x) in D. We first approximate the function f (x) via its partial sum of its Fourier series. We show that for given ε, we can find a partial sum sn(x) n of its Fourier series such that $\\math\\$ when n is larger than some positive number. Then we consider finding the ε-global optimal value of this partial sum, which turns out to be able to be converted into a semi-definite programming problem via some transformation, hence is able to be solved by interior point method in polynomial time.","PeriodicalId":127523,"journal":{"name":"2011 International Conference on Business Computing and Global Informatization","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Business Computing and Global Informatization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BCGIN.2011.86","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
One-dimensional global optimization of a function f(x) in an interval D is still a difficult problem. In this paper, we pose a new method for finding the ε-global optimal value of f(x) in D. We first approximate the function f (x) via its partial sum of its Fourier series. We show that for given ε, we can find a partial sum sn(x) n of its Fourier series such that $\math\$ when n is larger than some positive number. Then we consider finding the ε-global optimal value of this partial sum, which turns out to be able to be converted into a semi-definite programming problem via some transformation, hence is able to be solved by interior point method in polynomial time.