Showing 71 - 80 of 107
Persistent link: https://www.econbiz.de/10012301625
Persistent link: https://www.econbiz.de/10011627255
Persistent link: https://www.econbiz.de/10012102192
Persistent link: https://www.econbiz.de/10012102588
Persistent link: https://www.econbiz.de/10012003272
Persistent link: https://www.econbiz.de/10012132359
Persistent link: https://www.econbiz.de/10012157816
In this paper we apply two convexification procedures to the Lagrangian of a nonconvex semi-infinite programming problem. Under the reduction approach it is shown that, locally around a local minimizer, this problem can be transformed equivalently in such a way that the transformed Lagrangian...
Persistent link: https://www.econbiz.de/10010994130
In these comments on the excellent survey by Dinh and Jeyakumar, we briefly discuss some recently developed topics and results on applications of extended Farkas’ lemma(s) and related qualification conditions to problems of variational analysis and optimization, which are not fully reflected...
Persistent link: https://www.econbiz.de/10010995334
This paper studies how to solve semi-infinite polynomial programming (SIPP) problems by semidefinite relaxation methods. We first recall two SDP relaxation methods for solving polynomial optimization problems with finitely many constraints. Then we propose an exchange algorithm with SDP...
Persistent link: https://www.econbiz.de/10010847463