Zobrazeno 1 - 10
of 55
pro vyhledávání: '"Hubertus Th. Jongen"'
Publikováno v:
Journal of Mathematical Analysis and Applications. 411:916-930
We study systems of equations, F(x)=0, given by piecewise differentiable functions F from R^n to R^k, k
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cb23faee896b4ae11010fcb7346d3d10
https://doi.org/10.1016/j.jmaa.2013.10.029
https://doi.org/10.1016/j.jmaa.2013.10.029
Publikováno v:
SIAM Journal on Optimization. 23:452-474
We consider generalized Nash equilibrium problems (GNEP) from a structural and computational point of view. In GNEP the players’ feasible sets may depend on the other players’ strategies. Moreover, the players may share common constraints. In par
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d8127d57a91e12deb18d7bd0dd35c804
https://doi.org/10.1137/110822670
https://doi.org/10.1137/110822670
Publikováno v:
Journal of Optimization Theory and Applications. 159:606-634
In this article we study generalized Nash equilibrium problems (GNEP) and bilevel optimization side by side. This perspective comes from the crucial fact that both problems heavily depend on parametric issues. Observing the intrinsic complexity of GN
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::15b4ba491847b8662b51fb341b40d98f
https://doi.org/10.1007/s10957-012-0210-7
https://doi.org/10.1007/s10957-012-0210-7
Autor:
Hubertus Th. Jongen, Vladimir Shikhman
Publikováno v:
Mathematical Programming. 136:65-89
We consider bilevel optimization from the optimistic point of view. Let the pair (x, y) denote the variables. The main difficulty in studying such problems lies in the fact that the lower level contains a global constraint. In fact, a point (x, y) is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::69ee06283f89aec52e55590be78cdea6
https://doi.org/10.1007/s10107-012-0551-x
https://doi.org/10.1007/s10107-012-0551-x
Autor:
Hubertus Th. Jongen, Vladimir Shikhman
Publikováno v:
Optimization. 60:859-873
We study General Semi-Infinite Programming (GSIP) from a topological point of view. Under the Symmetric Mangasarian-Fromovitz Constraint Qualification (Sym-MFCQ) two basic theorems from Morse theory (deformation theorem and cell-attachment theorem) a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b16f6b75d36ca0cf9a15ee58131a0600
https://doi.org/10.1080/02331934.2010.543134
https://doi.org/10.1080/02331934.2010.543134
Publikováno v:
Set-Valued and Variational Analysis. 19:237-253
We examine the topological structure of the upper-level set Mmax given by a min-max function φ. It is motivated by recent progress in Generalized Semi-Infinite Programming (GSIP). Generically, Mmax is proven to be the topological closure of the GSIP
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7942a03c877426d5556da29d6b891fd2
https://doi.org/10.1007/s11228-010-0170-8
https://doi.org/10.1007/s11228-010-0170-8
Autor:
Hubertus Th. Jongen, Jan-J. Rückmann
Publikováno v:
SIAM Journal on Optimization. 20:2137-2156
The paper deals with a nonlinear programming problem (P) and, by using a logarithmic barrier function, a parametric family of interior point approximations $M^\gamma$ of its feasible set $M$, where $M^\gamma$ is described by a single smooth inequalit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::778f77f744c08e56ee6158cf27ee1b5b
https://doi.org/10.1137/070711566
https://doi.org/10.1137/070711566
Publikováno v:
SIAM Journal on Optimization. 20:718-727
We consider bilevel programming problems in the so-called optimistic formulation. The aim is to study the generic structure of such problems in a neighborhood of their solutions. In particular, we are interested in local reductions of the feasible se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::39543a0bffb39b8f367101bc45b39203
https://doi.org/10.1137/080718231
https://doi.org/10.1137/080718231
Publikováno v:
Journal of Global Optimization. 42:413-421
In this paper a basic structural problem in Generalized Semi-Infinite Programming is solved. In fact, under natural and generic assumptions we show that at any (local) minimizer the "Symmetric Reduction Ansatz" holds.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cfb2b46787ee65fac73e4847fb745b55
https://doi.org/10.1007/s10898-008-9302-1
https://doi.org/10.1007/s10898-008-9302-1
Publikováno v:
Mathematical Methods of Operations Research. 70:35-46
We consider unconstrained finite dimensional multi-criteria optimization problems, where the objective functions are continuously differentiable. Motivated by previous work of Brosowski and da Silva (1994), we suggest a number of tests (TEST 1–4) t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::34c29c773b3f6214d7c61b058456bdb6
https://doi.org/10.1007/s00186-008-0230-0
https://doi.org/10.1007/s00186-008-0230-0