SparsePOP

SparsePOP: a sparse semidefinite programming relaxation of polynomial optimization problems. SparsePOP is a Matlab implementation of the sparse semidefinite programming (SDP) relaxation method for approximating a global optimal solution of a polynomial optimization problem (POP) proposed by Waki et al. [2006]. The sparse SDP relaxation exploits a sparse structure of polynomials in POPs when applying “a hierarchy of LMI relaxations of increasing dimensions” Lasserre [2006]. The efficiency of SparsePOP to approximate optimal solutions of POPs is thus increased, and larger-scale POPs can be handled.


References in zbMATH (referenced in 50 articles )

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

1 2 3 next

  1. Campos, Juan S.; Parpas, Panos: A multigrid approach to SDP relaxations of sparse polynomial optimization problems (2018)
  2. Ghaddar, Bissan; Claeys, Mathieu; Mevissen, Martin; Eck, Bradley J.: Polynomial optimization for water networks: global solutions for the valve setting problem (2017)
  3. Bugarin, Florian; Henrion, Didier; Lasserre, Jean Bernard: Minimizing the sum of many rational functions (2016)
  4. Dalkiran, Evrim; Sherali, Hanif D.: RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (2016)
  5. de Klerk, Etienne: Book review of: J.-B. Lasserre, An introduction to polynomial and semi-algebraic optimization (2016)
  6. Jeyakumar, V.; Kim, S.; Lee, G. M.; Li, G.: Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets (2016)
  7. Klep, Igor; Povh, Janez: Constrained trace-optimization of polynomials in freely noncommuting variables (2016)
  8. Lasserre, Jean Bernard: An introduction to polynomial and semi-algebraic optimization (2015)
  9. Wittek, Peter: Algorithm 950: Ncpol2sdpa -- sparse semidefinite programming relaxations for polynomial optimization problems of noncommuting variables (2015)
  10. Magron, Victor: NLCertify: a tool for formal nonlinear optimization (2014)
  11. Allamigeon, Xavier; Gaubert, Stéphane; Magron, Victor; Werner, Benjamin: Certification of bounds of non-linear functions: the templates method (2013)
  12. Burgdorf, Sabine; Cafuta, Kristijan; Klep, Igor; Povh, Janez: The tracial moment problem and trace-optimization of polynomials (2013)
  13. Cerone, V.; Piga, D.; Regruto, D.: Bounding the parameters of block-structured nonlinear feedback systems (2013)
  14. Dalkiran, Evrim; Sherali, Hanif D.: Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (2013)
  15. Kojima, Masakazu; Yamashita, Makoto: Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization (2013)
  16. Mizutani, Tomohiko; Yamashita, Makoto: Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables (2013)
  17. Waki, Hayato; Muramatsu, Masakazu: Facial reduction algorithms for conic optimization problems (2013)
  18. Anjos, Miguel F.; Lasserre, Jean B.: Introduction to semidefinite, conic and polynomial optimization (2012)
  19. Cafuta, Kristijan; Klep, Igor; Povh, Janez: Constrained polynomial optimization problems with noncommuting variables (2012)
  20. Cerone, V.; Piga, D.; Regruto, D.: Bounded error identification of Hammerstein systems through sparse polynomial optimization (2012)

1 2 3 next