Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Nguyen Huy Chieu"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
SIAM Journal on Optimization. 31:545-568
This paper mainly studies the relationship between quadratic growth and strong metric subregularity of the subdifferential in finite dimensional settings by using the subgradient graphical derivati...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a3d825bf1d71417d2f34ad9f0cb7abd0
https://doi.org/10.1137/19m1242732
https://doi.org/10.1137/19m1242732
Publikováno v:
Acta Mathematica Vietnamica. 45:477-499
This paper examines tilt stability for quadratic programs with one or two quadratic inequality constraints. Exploiting specific features of these problems and using some known results on tilt stability in nonlinear programming, we establish quite sim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c8ea443ffdd790cf880661f586a69102
https://doi.org/10.1007/s40306-020-00372-4
https://doi.org/10.1007/s40306-020-00372-4
Publikováno v:
European Journal of Operational Research. 280:441-452
In this paper we show that a convexifiability property of nonconvex quadratic programs with nonnegative variables and quadratic constraints guarantees zero duality gap between the quadratic programs and their semi-Lagrangian duals. More importantly,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::84f454fda7ae4cee3d7879f8430f9a59
https://doi.org/10.1016/j.ejor.2019.08.009
https://doi.org/10.1016/j.ejor.2019.08.009
This paper mainly studies the quadratic growth and the strong metric subregularity of the subdifferential of a function that can be represented as the sum of a function twice differentiable in the extended sense and a subdifferentially continuous, pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::063889d2c44c364fe8b9e918b2d1e24c
http://arxiv.org/abs/2109.03399
http://arxiv.org/abs/2109.03399
Publikováno v:
Operations Research Letters. 47:530-536
We present a new copositive Farkas lemma for a general conic quadratic system with binary constraints under a convexifiability requirement. By employing this Farkas lemma, we establish that a minimally exact conic programming relaxation holds for a c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a5c55b35545498a936a11f9ad9e2b93f
https://doi.org/10.1016/j.orl.2019.09.013
https://doi.org/10.1016/j.orl.2019.09.013
Publikováno v:
European Journal of Operational Research. 265:19-25
We study constraint qualifications and necessary and sufficient optimality conditions for a convex optimization problem with inequality constraints where the constraint functions are continuously differentiable but they are not assumed to be convex.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ccf64d1d881025389e4fec408e31224
https://doi.org/10.1016/j.ejor.2017.07.038
https://doi.org/10.1016/j.ejor.2017.07.038
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Set-Valued and Variational Analysis. 26:305-326
In this paper, we introduce a new class of nonsmooth convex functions called SOS-convex semialgebraic functions extending the recently proposed notion of SOS-convex polynomials. This class of nonsmooth convex functions covers many common nonsmooth fu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::814b2a0dbf110ac96e8b227563bb567c
https://doi.org/10.1007/s11228-017-0456-1
https://doi.org/10.1007/s11228-017-0456-1
Publikováno v:
Operations Research Letters. 45:325-333
A hierarchy of semidefinite programming (SDP) relaxations is proposed for solving a broad class of hard nonconvex robust polynomial optimization problems under constraint data uncertainty, described by convex quadratic inequalities. This class of rob
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e081eb7f68f4de16473cc0c125fe4492
https://doi.org/10.1016/j.orl.2017.04.005
https://doi.org/10.1016/j.orl.2017.04.005