
SparsePOP
 Referenced in 65 articles
[sw04331]
 sparse semidefinite programming relaxation of polynomial optimization problems. SparsePOP is a Matlab implementation ... global optimal solution of a polynomial optimization problem (POP) proposed by Waki ... relaxation exploits a sparse structure of polynomials in POPs when applying “a hierarchy ... efficiency of SparsePOP to approximate optimal solutions of POPs is thus increased, and largerscale...

GloptiPoly
 Referenced in 301 articles
[sw04343]
 important applications in various fields such as optimization, probability, finance, control, signal processing, chemistry, cristallography ... handle moment problems with polynomial data. Many important applications in e.g. optimization, probability, financial economics...

Sostools
 Referenced in 276 articles
[sw00891]
 optimization programs. SOSTOOLS can be used to specify and solve sum of squares polynomial problems...

INTLAB
 Referenced in 435 articles
[sw04004]
 unconstrained optimization) roots of univariate and multivariate nonlinear equations (simple and clusters) eigenvalue problems (simple ... generalized eigenvalue problems (simple and clusters) quadrature for univariate functions univariate polynomial zeros (simple ... systems of nonlinear equations) Hessians (for global optimization) Taylor series for univariate functions automatic slopes...

SMRSOFT
 Referenced in 36 articles
[sw12217]
 SMRSOFT: a MATLAB toolbox for optimization over polynomials and dynamical systems study via SOS programming ... Matlab toolbox for solving basic optimization problems over polynomials and studying dynamical systems...

MINOTAUR
 Referenced in 18 articles
[sw06268]
 that arise in nonconvex mixed integer optimization problems. The goal is to obtain a formulation ... that cover all multilinear terms in the problem. The approach is combined with additional reformulation ... produce a solver for mixed integer polynomial optimization problems...

SparseBSOS
 Referenced in 12 articles
[sw31772]
 Comp Optim:87–117, 2017) for polynomial optimization problems. It permits to treat large scale...

TSSOS
 Referenced in 6 articles
[sw36859]
 sparsity. This paper is concerned with polynomial optimization problems. We show how to exploit term ... applied to compute lower bounds for polynomial optimization problems either randomly generated or coming from...

CompEcon
 Referenced in 49 articles
[sw04789]
 problems in economics and finance. The library functions include rootfinding and optimization solvers, a integrated ... routines for function approximation using polynomial, splines and other functional families, a set of numerical ... Differential Equations (both initial and boundary value problems), routines for solving discrete and continuous time...

ROLMIP
 Referenced in 16 articles
[sw21158]
 designed to work specifically with optimization problems presenting parameterdependent variables with parameters ... simplex. The variables are assumed to depend polynomially ... parameters, being the polynomials considered to be homogeneous. Such optimization problems arise, for example...

Ncpol2sdpa
 Referenced in 3 articles
[sw17564]
 Ncpol2sdpa  sparse semidefinite programming relaxations for polynomial optimization problems of noncommuting variables. A hierarchy ... relaxations approximates the global optimum of polynomial optimization problems of noncommuting variables. Generating the relaxation...

SLRA
 Referenced in 23 articles
[sw11262]
 presents optimization methods and software for the approximate GCD problem of multiple univariate polynomials ... formulations of the problem are solved by the variable projection method. Optimization methods are implemented...

Algorithm 829
 Referenced in 54 articles
[sw04467]
 functions for multiextremal multidimensional boxconstrained global optimization is presented. Each test class consists ... convex quadratic function systematically distorted by polynomials in order to introduce local minima. To determine ... user defines the following parameters: (i) problem dimension, (ii) number of local minima, (iii) value...

MotifCut
 Referenced in 5 articles
[sw35400]
 finding leading to a convex optimization problem with a polynomial time solution. We build...

RLTPOS
 Referenced in 3 articles
[sw18321]
 reformulationlinearization techniquebased optimization software for solving polynomial programming problems. In this paper ... techniquebased opensource optimization software for solving polynomial programming problems (RLTPOS). We present...

BBCPOP
 Referenced in 3 articles
[sw31757]
 relaxations of a class of polynomial optimization (minimization) problems (POPs) with binary, box and complementarity...

SPOT
 Referenced in 5 articles
[sw21276]
 handling elementary polynomial operations, a special class mssprog for defining convex optimization problems...

ORBIT
 Referenced in 35 articles
[sw20552]
 derivativefree algorithm, ORBIT, for unconstrained local optimization of computationally expensive functions. A trustregion ... functions using fewer function evaluations than the polynomial models considered by present techniques. Approximation guarantees ... points. We present numerical results on test problems to motivate the use of ORBIT when ... very different application problems, calibration of a watershed model and optimization of a PDEbased...

HapCUT
 Referenced in 6 articles
[sw35352]
 This problem has been shown to be computationally intractable for various optimization criteria. Polynomial time...

POS3POLY
 Referenced in 3 articles
[sw09847]
 work with positive polynomials as variables in a convex optimization problem. We present here ... such problems without the need of knowing the parameterization for each type of polynomial. POS3POLY ... types of polynomials: trigonometric, real and hybrid. The positivity of the polynomials can be global ... uses SeDuMi for solving the convex optimization problems. POS3POLY can also work inside...