Gposolver: a Matlab/C++ toolbox for global polynomial optimization. Global polynomial optimization can be a powerful tool when applied to engineering problems. One of the most successful methods for solving such problems is based on convex linear matrix inequality (LMI) relaxations. Software implementations of this approach can be found for example in Matlab toolboxes GloptiPoly and YALMIP. Matlab language makes it very easy when it comes to modelling polynomial problems. However, when using these toolboxes, Matlab is also required for the problem solving. GpoSolver aims at bridging this gap by providing a Matlab-based problem modelling toolbox supplemented by a problem-solving back end in a form of a C++ template library. Once a problem is conveniently modelled and parametrized in Matlab, a C++ class is automatically generated by GpoSolver. This class can be easily included into an existing codebase and used to solve different instances of the problem based on the supplied parameters.
Keywords for this software
References in zbMATH (referenced in 2 articles )
Showing results 1 to 2 of 2.
- Papp, Dávid; Yildiz, Sercan: Sum-of-squares optimization without semidefinite programming (2019)
- Heller, Jan; Pajdla, Tomas: Gposolver: a Matlab/C++ toolbox for global polynomial optimization (2016)