Zobrazeno 1 - 10
of 80
pro vyhledávání: '"Gert Wanka"'
The aim of this manuscript is to approach by means of first order differential equations/inclusions convex programming problems with two-block separable linear constraints and objectives, whereby (at least) one of the components of the latter is assu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9af829cbbd3b5d8f559b38fefc3f09d9
https://phaidra.univie.ac.at/o:1440124
https://phaidra.univie.ac.at/o:1440124
Autor:
Gert Wanka, Oleg Wilfer
Publikováno v:
Optimization. 67:1095-1119
Duality statements are presented for multifacility location problems as suggested by Drezner Hiu 1991, where for each given point the sum of weighted distances to all facilities plus set-up costs i...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::046a9536e4b8636b449d2de2b53812d2
https://doi.org/10.1080/02331934.2017.1387549
https://doi.org/10.1080/02331934.2017.1387549
Autor:
Gert Wanka, Oleg Wilfer
Publikováno v:
Mathematical Methods of Operations Research. 86:401-439
In the framework of conjugate duality we discuss nonlinear and linear single minimax location problems with geometric constraints, where the gauges are defined by convex sets of a Frechet space. The version of the nonlinear location problem is additi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6d04e2b5347919b65daa421650485de8
https://doi.org/10.1007/s00186-017-0603-3
https://doi.org/10.1007/s00186-017-0603-3
Autor:
Gert Wanka, Oleg Wilfer
Publikováno v:
TOP. 25:288-313
In this paper, we consider an optimization problem with geometric and cone constraints, whose objective function is a composition of $$n+1$$ functions. For this problem, we calculate its conjugate dual problem, where the functions involved in the obj
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8f822994533d5a32cff155422e4e647f
https://doi.org/10.1007/s11750-016-0431-2
https://doi.org/10.1007/s11750-016-0431-2
Publikováno v:
Journal of Optimization Theory and Applications
The Alternating Minimization Algorithm has been proposed by Paul Tseng to solve convex programming problems with two-block separable linear constraints and objectives, whereby (at least) one of the components of the latter is assumed to be strongly c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::47b3c2d6c49cd7ba7086196f0e82e811
https://pubmed.ncbi.nlm.nih.gov/31258180
https://pubmed.ncbi.nlm.nih.gov/31258180
Autor:
Sorin-Mihai Grad, Gert Wanka
Publikováno v:
Optimization. 64:1759-1775
We deliver formulae for the biconjugate functions of some infimal functions that hold provided the fulfilment of weak regularity conditions of both closedness and interiority types. As special cases, we obtain biconjugates of infimal convolutions of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2da77f1c5c40a91b6fcee200ec674cd1
https://doi.org/10.1080/02331934.2015.1046873
https://doi.org/10.1080/02331934.2015.1046873
Publikováno v:
Open Mathematics, Vol 12, Iss 2, Pp 381-394 (2014)
Supervised learning methods are powerful techniques to learn a function from a given set of labeled data, the so-called training data. In this paper the support vector machines approach is applied to an image classification task. Starting with the co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ec5c7cb64dd742b3dbcaf9ed4de3e06e
https://doaj.org/article/d71b6d6de99947f3a43ba77d07634821
https://doaj.org/article/d71b6d6de99947f3a43ba77d07634821
Publikováno v:
Journal of the Korean Mathematical Society. 47:17-28
In this paper we deal with linear chance-constrained opti- mization problems, a class of problems which naturally arise in practical applications in finance, engineering, transportation and scheduling, where decisions are made in presence of uncertai
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4af91aad66c7f3c2ebbd181ad915ee47
https://doi.org/10.4134/jkms.2010.47.1.017
https://doi.org/10.4134/jkms.2010.47.1.017
Publikováno v:
Optimization. 58:917-933
We give two generalized Moreau–Rockafellar-type results for the sum of a convex function with a composition of convex functions in separated locally convex spaces. Then we equivalently characterize the stable strong duality for composed convex opti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d34593e13ddde0ec802f23fe17e46e94
https://doi.org/10.1080/02331930902945082
https://doi.org/10.1080/02331930902945082
Publikováno v:
Journal of Optimization Theory and Applications. 144:185-203
The aim of this paper is to give dual representations for different convex risk measures by employing their conjugate functions. To establish the formulas for the conjugates, we use on the one hand some classical results from convex analysis and on t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7bcd0660662624fc28ec30a0beb9298c
https://doi.org/10.1007/s10957-009-9595-3
https://doi.org/10.1007/s10957-009-9595-3