Narrow search
Showing 1 - 6 of 6
Cover Image
Separation theorems for nonconvex sets and application in optimization
Kasimbeyli, Refail; Karimi, Masoud - In: Operations research letters 47 (2019) 6, pp. 569-573
Persistent link: https://www.econbiz.de/10012131873
Cover Image
A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems
Chieu, N. H.; Jeyakumar, Vaithilingam; Li, Guoyin - In: Operations research letters 45 (2017) 4, pp. 325-333
Persistent link: https://www.econbiz.de/10011740347
Cover Image
The regularized feasible directions method for nonconvex optimization
Beck, Amir; Hallak, Nadav - In: Operations research letters 50 (2022) 5, pp. 517-523
Persistent link: https://www.econbiz.de/10013449438
Cover Image
On robustness in nonconvex optimization with application to defense planning
Royset, Johannes O. - In: Operations research letters 51 (2023) 1, pp. 3-10
Persistent link: https://www.econbiz.de/10014283274
Cover Image
A new Lagrangian-based first-order method for nonconvex constrained optimization
Kim, Jong Gwang - In: Operations research letters 51 (2023) 3, pp. 357-363
Persistent link: https://www.econbiz.de/10014374986
Cover Image
Distributed stochastic nonsmooth nonconvex optimization
Kungurtsev, Vyacheslav - In: Operations research letters 50 (2022) 6, pp. 627-631
Persistent link: https://www.econbiz.de/10014230138