SeDuMi is a Matlab toolbox for solving optimization problems over symmetric cones, i.e. it allows not only for linear constraints, but also quasiconvex-quadratic constraints and positive semi-definiteness constraints. Complex valued entries are allowed. Features include symbolic and numerical reordering schemes, balancing speed/accuracy performance and sophisticated dense column handling, using the Goldfarb-Scheinberg product form idea.

References in zbMATH (referenced in 714 articles , 2 standard articles )

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

1 2 3 ... 34 35 36 next

  1. Ahmadi, Amir Ali; Jungers, Raphaël M.: Lower bounds on complexity of Lyapunov functions for switched linear systems (2016)
  2. Ahmadi, Amir Ali; Majumdar, Anirudha: Some applications of polynomial optimization in operations research and real-time decision making (2016)
  3. Aşici, Emel; Karaçal, Funda: Incomparability with respect to the triangular order. (2016)
  4. Benavoli, Alessio; Piga, Dario: A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding (2016)
  5. Bugarin, Florian; Henrion, Didier; Lasserre, Jean Bernard: Minimizing the sum of many rational functions (2016)
  6. Bunin, Gene A.: Extended reverse-convex programming: an approximate enumeration approach to global optimization (2016)
  7. Chen, Caihua; Liu, Yong-Jin; Sun, Defeng; Toh, Kim-Chuan: A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems (2016)
  8. Chen, Yannan; Qi, Liqun; Wang, Qun: Positive semi-definiteness and sum-of-squares property of fourth order four dimensional Hankel tensors (2016)
  9. Chesi, Graziano; Middleton, Richard H.: Robust stability and performance analysis of 2D mixed continuous-discrete-time systems with uncertainty (2016)
  10. Collier, Olivier; Dalalyan, Arnak S.: Minimax rates in permutation estimation for feature matching (2016)
  11. Dalkiran, Evrim; Sherali, Hanif D.: RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (2016)
  12. de Klerk, Etienne: Book review of: J.-B. Lasserre, An introduction to polynomial and semi-algebraic optimization (2016)
  13. Fan, Jinyan; Zhou, Anwa: The CP-matrix approximation problem (2016)
  14. Fan, Jinyan; Zhou, Anwa: Computing the distance between the linear matrix pencil and the completely positive cone (2016)
  15. Friberg, Henrik A.: CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization (2016)
  16. Grimstad, Bjarne; Sandnes, Anders: Global optimization with spline constraints: a new branch-and-bound method based on B-splines (2016)
  17. Hassanabadi, Amir Hossein; Shafiee, Masoud; Puig, Vicenc: UIO design for singular delayed LPV systems with application to actuator fault detection and isolation (2016)
  18. Hu, Jianghai; Shen, Jinglai; Putta, Vamsi: Generalized input-to-state $\ell_2$-gains of discrete-time switched linear control systems (2016)
  19. 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)
  20. Jeyakumar, V.; Lasserre, J.B.; Li, G.; Phạm, T.S.: Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems (2016)

1 2 3 ... 34 35 36 next