References in zbMATH (referenced in 36 articles )

Showing results 1 to 20 of 36.
Sorted by year (citations)

1 2 next

  1. Bertsimas, Dimitris; Cory-Wright, Ryan: On polyhedral and second-order cone decompositions of semidefinite optimization problems (2020)
  2. Dey, Santanu S.; Kocuk, Burak; Santana, Asteroide: Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem (2020)
  3. Frangioni, Antonio; Gentile, Claudio; Hungerford, James: Decompositions of semidefinite matrices and the perspective reformulation of nonseparable quadratic programs (2020)
  4. Gouveia, João; Pong, Ting Kei; Saee, Mina: Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices (2020)
  5. Hohmann, Marc; Warrington, Joseph; Lygeros, John: A moment and sum-of-squares extension of dual dynamic programming with application to nonlinear energy storage problems (2020)
  6. Lakshmi, Mayur V.; Fantuzzi, Giovanni; Fernández-Caballero, Jesús D.; Hwang, Yongyun; Chernyshenko, Sergei I.: Finding extremal periodic orbits with polynomial optimization, with application to a nine-mode model of shear flow (2020)
  7. Saunderson, James: Limitations on the expressive power of convex cones without long chains of faces (2020)
  8. Ahmadi, Amir Ali; de Klerk, Etienne; Hall, Georgina: Polynomial norms (2019)
  9. Ahmadi, Amir Ali; Hall, Georgina: On the construction of converging hierarchies for polynomial optimization based on certificates of global positivity (2019)
  10. Ahmadi, Amir Ali; Majumdar, Anirudha: DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization (2019)
  11. Campos, Juan S.; Misener, Ruth; Parpas, Panos: A multilevel analysis of the Lasserre hierarchy (2019)
  12. Chuong, T. D.; Jeyakumar, V.; Li, G.: A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs (2019)
  13. Dickinson, Peter J. C.; Povh, Janez: A new approximation hierarchy for polynomial conic optimization (2019)
  14. Goluskin, David; Fantuzzi, Giovanni: Bounds on mean energy in the Kuramoto-Sivashinsky equation computed using semidefinite programming (2019)
  15. Holicki, Tobias; Scherer, Carsten W.: Stability analysis and output-feedback synthesis of hybrid systems affected by piecewise constant parameters via dynamic resetting scalings (2019)
  16. Iannelli, Andrea; Marcos, Andrés; Lowenberg, Mark: Robust estimations of the region of attraction using invariant sets (2019)
  17. Kimizuka, Masaki; Kim, Sunyoung; Yamashita, Makoto: Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods (2019)
  18. Kuang, Xiaolong; Ghaddar, Bissan; Naoum-Sawaya, Joe; Zuluaga, Luis F.: Alternative SDP and SOCP approximations for polynomial optimization (2019)
  19. Kussaba, Hugo T. M.; Ishihara, João Y.; Menezes, Leonardo R. A. X.: A robust unscented transformation for uncertain moments (2019)
  20. Papp, Dávid; Yildiz, Sercan: Sum-of-squares optimization without semidefinite programming (2019)

1 2 next