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 748 articles , 2 standard articles )

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

1 2 3 ... 36 37 38 next

  1. Arima, Naohiko; Kim, Sunyoung; Kojima, Masakazu; Toh, Kim-Chuan: A robust Lagrangian-DNN method for a class of quadratic optimization problems (2017)
  2. Canelas, Alfredo; Carrasco, Miguel; López, Julio: Application of the sequential parametric convex approximation method to the design of robust trusses (2017)
  3. Claeys, Mathieu; Henrion, Didier; Kružík, Martin: Semi-definite relaxations for optimal control problems with oscillation and concentration effects (2017)
  4. Fan, Jinyan; Zhou, Anwa: A semidefinite algorithm for completely positive tensor decomposition (2017)
  5. Harman, Radoslav; Benková, Eva: Barycentric algorithm for computing D-optimal size- and cost-constrained designs of experiments (2017)
  6. Huang, Kuo-Ling; Mehrotra, Sanjay: Solution of monotone complementarity and general convex programming problems using a modified potential reduction interior point method (2017)
  7. Korda, Milan; Jones, Colin N.: Stability and performance verification of optimization-based controllers (2017)
  8. Lu, Cheng; Deng, Zhibin; Jin, Qingwei: An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (2017)
  9. Mohammad-Nezhad, Ali; Terlaky, Tamás: A polynomial primal-dual affine scaling algorithm for symmetric conic optimization (2017)
  10. Pirhaji, M.; Mansouri, H.; Zangiabadi, M.: An $O(\sqrt nL)$ wide neighborhood interior-point algorithm for semidefinite optimization (2017)
  11. Sakaue, Shinsaku; Takeda, Akiko; Kim, Sunyoung; Ito, Naoki: Exact semidefinite programming relaxations with truncated moment matrix for binary polynomial optimization problems (2017)
  12. Salahi, Maziar; Taati, Akram; Wolkowicz, Henry: Local nonglobal minima for solving large-scale extended trust-region subproblems (2017)
  13. Taylor, Adrien B.; Hendrickx, Julien M.; Glineur, François: Smooth strongly convex interpolation and exact worst-case performance of first-order methods (2017)
  14. Ahmadi, Amir Ali; Jungers, Raphaël M.: Lower bounds on complexity of Lyapunov functions for switched linear systems (2016)
  15. Ahmadi, Amir Ali; Majumdar, Anirudha: Some applications of polynomial optimization in operations research and real-time decision making (2016)
  16. Aşici, Emel; Karaçal, Funda: Incomparability with respect to the triangular order. (2016)
  17. Benavoli, Alessio; Piga, Dario: A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding (2016)
  18. Briat, Corentin: Stability analysis and stabilization of stochastic linear impulsive, switched and sampled-data systems under dwell-time constraints (2016)
  19. Bugarin, Florian; Henrion, Didier; Lasserre, Jean Bernard: Minimizing the sum of many rational functions (2016)
  20. Bunin, Gene A.: Extended reverse-convex programming: an approximate enumeration approach to global optimization (2016)

1 2 3 ... 36 37 38 next