Quadratically adjustable robust linear optimization with inexact data via generalized S-lemma: Exact second-order cone program reformulations | Zendy

V. Jeyakumar | Zendy; Guoyin Li | Zendy; D. Woolnough | Zendy

Open Access

Quadratically adjustable robust linear optimization with inexact data via generalized S-lemma: Exact second-order cone program reformulations

Author(s) -

V. Jeyakumar,

Guoyin Li,

D. Woolnough

Publication year - 2021

Publication title -

euro journal on computational optimization

Language(s) - Uncategorized

Resource type - Journals

eISSN - 2192-4414

pISSN - 2192-4406

DOI - 10.1016/j.ejco.2021.100019

Subject(s) - quadratic growth , second order cone programming , lemma (botany) , mathematics , generalization , quadratic programming , ellipsoid , quadratically constrained quadratic program , uncertain data , quadratic equation , realization (probability) , mathematical optimization , intersection (aeronautics) , separable space , conic section , function (biology) , computer science , algorithm , convex optimization , mathematical analysis , regular polygon , aerospace engineering , engineering , biology , geometry , data mining , statistics , physics , poaceae , astronomy , ecology , evolutionary biology

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research