YALMIP Yet another LMI parser. YALMIP is a free MATLAB toolbox for rapid prototyping of optimization problems. The package initially aimed at the control community and focused on semidefinite programming, but the latest release extends this scope significantly. YALMIP 3 can be used for linear programming, quadratic programming, second order cone programming, semidefinite programming, non-convex semidefinite programming, mixed integer programming, multi-parametric programming, geometric programming The main features of YALMIP are: Easy to install since it is entirely based on MATLAB code. Easy to learn : 3 new commands is all the user needs to get started. Easy to use : you define your constraints and objective functions using intuitive and standard MATLAB code. Automatic categorization of problems, and automatic solver selection Supports numerous external solvers, both free and commercial. The solvers supported by YALMIP are currently CDD, CSDP, CPLEX, DSDP, GLPK, KYPD, LINPROG, LMILAB, MAXDET, MOSEK, MPT, NAG, OOQP, PENBMI, PENSDP, QUADPROG, SDPA SDPT3 and SEDUMI.

References in zbMATH (referenced in 625 articles , 1 standard article )

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

1 2 3 ... 30 31 32 next

  1. Campi, Marco C.; Garatti, Simone: Wait-and-judge scenario optimization (2018)
  2. Chen, Haibin; Huang, Zheng-Hai; Qi, Liqun: Copositive tensor detection and its applications in physics and hypergraphs (2018)
  3. El-Amrani, Abderrahim; Boukili, Bensalem; Hmamed, Abdellaziz; El Hajjaji, Ahmed; Boumhidi, Ismail: Robust $H_\infty$ filtering for 2D continuous systems with finite frequency specifications (2018)
  4. Gally, Tristan; Pfetsch, Marc E.; Ulbrich, Stefan: A framework for solving mixed-integer semidefinite programs (2018)
  5. Ghasemi, Mohammad S.; Afzalian, Ali A.: Invariant convex approximations of the minimal robust invariant set for linear difference inclusions (2018)
  6. Goluskin, David: Bounding averages rigorously using semidefinite programming: mean moments of the Lorenz system (2018)
  7. Hand, Paul; Lee, Choongbum; Voroninski, Vladislav: Exact simultaneous recovery of locations and structure from known orientations and corrupted point correspondences (2018)
  8. Hassanabadi, Amir Hossein; Shafiee, Masoud; Puig, Vicenc: Sensor fault diagnosis of singular delayed LPV systems with inexact parameters: an uncertain system approach (2018)
  9. Josz, Cédric; Molzahn, Daniel K.: Lasserre hierarchy for large scale polynomial optimization in real and complex variables (2018)
  10. Kim, Donghwan; Fessler, Jeffrey A.: Another look at the fast iterative shrinkage/thresholding algorithm (FISTA) (2018)
  11. Kuang, Xiaolong; Zuluaga, Luis F.: Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization (2018)
  12. Liu, Kanglin; Zhang, Zhi-Hai: Capacitated disassembly scheduling under stochastic yield and demand (2018)
  13. Lu, Jianbo; Xi, Yugeng; Li, Dewei; Xu, Yuli; Gan, Zhongxue: Model predictive control design for polytopic uncertain systems by synthesising multi-step prediction scenarios (2018)
  14. Mishra, Prabhat K.; Chatterjee, Debasish; Quevedo, Daniel E.: Sparse and constrained stochastic predictive control for networked systems (2018)
  15. Mohajerin Esfahani, Peyman; Shafieezadeh-Abadeh, Soroosh; Hanasusanto, Grani A.; Kuhn, Daniel: Data-driven inverse optimization with imperfect information (2018)
  16. Polcz, Péter; Péni, Tamás; Szederkényi, Gábor: Improved algorithm for computing the domain of attraction of rational nonlinear systems (2018)
  17. Yanikoğlu, İhsan; Kuhn, Daniel: Decision rule bounds for two-stage stochastic bilevel programs (2018)
  18. Abou Jaoude, Dany; Farhood, Mazen: Distributed control of nonstationary LPV systems over arbitrary graphs (2017)
  19. Abou Jaoude, Dany; Farhood, Mazen: Balanced truncation model reduction of nonstationary systems interconnected over arbitrary graphs (2017)
  20. Adjé, Assalé; Garoche, Pierre-Loïc; Magron, Victor: A sums-of-squares extension of policy iterations (2017)

1 2 3 ... 30 31 32 next