Näytä suppeat kuvailutiedot

Multiobjective double bundle method for DC optimization

Kaisa Joki; Outi Montonen

dc.contributor.authorKaisa Joki
dc.contributor.authorOuti Montonen
dc.date.accessioned2022-10-28T13:26:07Z
dc.date.available2022-10-28T13:26:07Z
dc.identifier.isbn978-3-030-34909-7
dc.identifier.urihttps://www.utupub.fi/handle/10024/165151
dc.description.abstract<p>We discuss about the multiobjective double bundle method for nonsmooth multiobjective optimization where objective and constraint functions are presented as a difference of two convex (DC) functions. By utilizing a special technique called the improvement function, we are able to handle several objectives and constraints simultaneously. The method improves every objective at each iteration and the improvement function preserves DC property of the objectives and constraints. Once the improvement function is formed, we can approximate it by using a special cutting plane model capturing the convex and concave behaviour of a DC function. We solve the problem with a modified version of the single-objective double bundle method using the cutting plane model as a objective. The multiobjective double bundle method is proved to be finitely convergent to a weakly Pareto stationary solution under mild assumptions. Moreover, the applicability of the method is considered. <br></p>
dc.language.isoen
dc.publisherSpringer
dc.titleMultiobjective double bundle method for DC optimization
dc.identifier.urnURN:NBN:fi-fe2021042827032
dc.contributor.organizationfi=sovellettu matematiikka|en=Applied Mathematics|
dc.contributor.organization-code2606102
dc.converis.publication-id50379163
dc.converis.urlhttps://research.utu.fi/converis/portal/Publication/50379163
dc.description.edition1
dc.format.pagerange481
dc.format.pagerange497
dc.identifier.eisbn978-3-030-34910-3
dc.okm.affiliatedauthorJoki, Kaisa
dc.okm.affiliatedauthorMontonen, Outi
dc.okm.discipline111 Mathematicsen_GB
dc.okm.discipline111 Matematiikkafi_FI
dc.okm.internationalcopublicationnot an international co-publication
dc.okm.internationalityInternational publication
dc.okm.typeInbook
dc.publisher.countrySwitzerlanden_GB
dc.publisher.countrySveitsifi_FI
dc.publisher.country-codeCH
dc.publisher.isbn978-81-322;978-3-540;978-3-642;978-3-662;978-3-7908;978-3-8274;978-3-8347;978-90-481;978-94-007;978-94-009;978-94-010;978-94-011;978-94-015;978-94-017;978-94-024;978-0-387;978-0-8176;978-1-4419;978-1-4612;978-1-4613;978-1-4614;978-1-4615;978-1-4684;978-1-4757;978-1-4899;978-1-4939;978-1-5041;978-3-319;978-1-4020;978-0-85729;978-1-4471;978-1-84628;978-1-84800;978-1-84882;978-1-84996;978-1-85233;978-3-211;978-3-7091;978-4-431;978-3-322;978-3-409;978-3-531;978-3-658;978-3-663;978-3-8100;978-981-287;978-981-10;978-981-13;978-3-030;978-981-32;978-981-15;978-981-16;978-981-329;978-981-334;978-981-336;978-3-031;978-981-19;
dc.relation.doi10.1007/978-3-030-34910-3_14
dc.title.bookNumerical Nonsmooth Optimization: State of the Art Algorithms
dc.year.issued2020


Aineistoon kuuluvat tiedostot

Thumbnail

Aineisto kuuluu seuraaviin kokoelmiin

Näytä suppeat kuvailutiedot