YALMIP
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.
Keywords for this software
References in zbMATH (referenced in 736 articles , 1 standard article )
Showing results 1 to 20 of 736.
Sorted by year (- Ahmadi, Amir Ali; de Klerk, Etienne; Hall, Georgina: Polynomial norms (2019)
- De Castro, Yohann; Gamboa, Fabrice; Henrion, Didier; Hess, Roxana; Lasserre, Jean-Bernard: Approximate optimal designs for multivariate polynomial regression (2019)
- Deghat, Mohammad; Ugrinovskii, Valery; Shames, Iman; Langbort, Cédric: Detection and mitigation of biasing attacks on distributed estimation networks (2019)
- Jafari, Saeid; Ioannou, Petros A.: Reference tracking control and attenuation of unknown periodic disturbances in the presence of noise for unknown minimum-phase LTI plants (2019)
- Kvasnica, Michal; Bakaráč, Peter; Klaučo, Martin: Complexity reduction in explicit MPC: a reachability approach (2019)
- Li, Yang; Zhang, Hongbin: Stability, (L_1)-gain analysis and asynchronous (L_1)-gain control of uncertain discrete-time switched positive linear systems with dwell time (2019)
- Morato, Marcelo Menezes; Nguyen, Manh Quan; Sename, Olivier; Dugard, Luc: Design of a fast real-time \textitLPVmodel predictive control system for semi-active suspension control of a full vehicle (2019)
- Rego, Brenner S.; Raffo, Guilherme V.: Suspended load path tracking control using a tilt-rotor UAV based on zonotopic state estimation (2019)
- Yeşilçimen, Ali; Yıldırım, E. Alper: An alternative polynomial-sized formulation and an optimization based heuristic for the reviewer assignment problem (2019)
- Abou Jaoude, Dany; Farhood, Mazen: Model reduction of distributed nonstationary LPV systems (2018)
- Agulhari, C. M.: Synthesis of controllers for finite-time stabilisation of LTV continuous-time systems using a discrete-time approach (2018)
- Al-Jiboory, Ali Khudhair; Zhu, Guoming: Static output-feedback robust gain-scheduling control with guaranteed (\mathcalH_2) performance (2018)
- Amini, Amir; Asif, Amir; Mohammadi, Arash: CEASE: a collaborative event-triggered average-consensus sampled-data framework with performance guarantees for multi-agent systems (2018)
- Argha, Ahmadreza; Li, Li; Su, Steven W.; Nguyen, Hung: Sparsely distributed sliding mode control for interconnected systems (2018)
- Ben-Ameur, Walid; Ouorou, Adam; Wang, Guanglei; Żotkiewicz, Mateusz: Multipolar robust optimization (2018)
- Brunner, Florian David; Antunes, Duarte; Allgöwer, Frank: Stochastic thresholds in event-triggered control: a consistent policy for quadratic control (2018)
- Caldeira, André F.; Prieur, Christophe; Coutinho, Daniel; Leite, Valter J. S.: Regional stability and stabilization of a class of linear hyperbolic systems with nonlinear quadratic dynamic boundary conditions (2018)
- Campi, Marco C.; Garatti, Simone: Wait-and-judge scenario optimization (2018)
- Chanekar, Prasad Vilas; Chopra, Nikhil; Azarm, Shapour: Co-design of linear systems using generalized Benders decomposition (2018)
- Chen, Haibin; Chen, Yannan; Li, Guoyin; Qi, Liqun: A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test. (2018)