Applications of Stochastic Mixed-Integer Second-Order Cone Optimization

Second-order cone programming problems are a tractable subclass of convex optimization problems that can be solved using polynomial algorithms. In the last decade, stochastic second-order cone programming problems have been studied, and efficient algorithms for solving them have been developed. The...

Celý popis

Podrobná bibliografie

Vydáno v:	IEEE access Ročník 10; s. 3522 - 3547
Hlavní autoři:	Alzalg, Baha, Alioui, Hadjer
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Piscataway IEEE 2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithms applications Computational geometry Convex functions Convexity Mixed integer Mixed integer linear programming mixed-integer programming Optimization Polynomials Programming Second-order cone programming Stochastic processes stochastic programming Uncertainty
ISSN:	2169-3536, 2169-3536
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!