• GloptiPoly

  • Referenced in 301 articles [sw04343]
  • important applications in various fields such as optimization, probability, finance, control, signal processing, chemistry, cristallography ... moment problems with polynomial data. Many important applications in e.g. optimization, probability, financial economics ... optimal control, can be viewed as particular instances of the GPM, and (possibly after some ... transformation) of the GPM with polynomial data.The approach is similar to that used...
  • 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 larger-scale...
  • INTLAB

  • Referenced in 426 articles [sw04004]
  • systems systems of nonlinear equations (including unconstrained optimization) roots of univariate and multivariate nonlinear equations ... clusters) quadrature for univariate functions univariate polynomial zeros (simple and clusters) interval arithmetic for real ... systems of nonlinear equations) Hessians (for global optimization) Taylor series for univariate functions automatic slopes ... simple) univariate functions univariate and multivariate (interval) polynomials rigorous real interval standard functions (fast, very...
  • REDUCE

  • Referenced in 740 articles [sw00789]
  • syntax; analytic differentiation and integration; factorization of polynomials; facilities for the solution of a variety ... variety of formats; facilities for generating optimized numerical programs from symbolic input; calculations with...
  • ISOLATE

  • Referenced in 213 articles [sw07741]
  • isolating the real roots of a univariate polynomial using Descartes’ rule of signs. It follows ... algorithm is presented, which is optimal in terms of memory usage and as fast ... Krandick’s variant, independently of the input polynomial. From this new algorithm, we derive ... critical optimizations have important consequences since our new algorithm still works with huge polynomials, including...
  • Sostools

  • Referenced in 273 articles [sw00891]
  • optimization programs. SOSTOOLS can be used to specify and solve sum of squares polynomial problems...
  • 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]
  • terms that arise in nonconvex mixed integer optimization problems. The goal is to obtain ... produce a solver for mixed integer polynomial optimization problems...
  • SOSOPT

  • Referenced in 12 articles [sw13407]
  • SOSOPT: A Toolbox for Polynomial Optimization. SOSOPT is a Matlab toolbox for formulating and solving ... Squares (SOS) polynomial optimizations. This document briefly describes the use and functionality of this toolbox...
  • Sparse-BSOS

  • Referenced in 11 articles [sw31772]
  • degree SOS hierarchy for large scale polynomial optimization with sparsity. We provide a sparse version ... Comp Optim:87–117, 2017) for polynomial optimization problems. It permits to treat large scale...
  • R-MAX

  • Referenced in 32 articles [sw02539]
  • algorithm which can attain near-optimal average reward in polynomial time ... environment and acts based on the optimal policy derived from this model. The model...
  • Tensorlab

  • Referenced in 53 articles [sw14255]
  • squares optimization with complex variables including numerical complex differentiation, global minimization of bivariate polynomials ... real exact plane search (PS) for tensor optimization, and much more: cumulants, tensor visualization, estimating...
  • TSSOS

  • Referenced in 5 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]
  • optimization solvers, a integrated set of routines for function approximation using polynomial, splines and other...
  • OPBDP

  • Referenced in 13 articles [sw05036]
  • LinearPseudo-Boolean Optimization , 0-1 variables, objective and constraints polynomial(C++) A Davis-Putnam Based...
  • SPOT

  • Referenced in 5 articles [sw21276]
  • SPOT (Systems Polynomial Optimization Tools) is a MATLAB toolbox written as an alternative implementation ... R2009a). SPOT provides its own matrix multivariable polynomial variable class msspoly ... handling elementary polynomial operations, a special class mssprog for defining convex optimization problems...
  • Rk-opt

  • Referenced in 8 articles [sw17497]
  • multistep and multistage methods. polyopt: Find optimal stability polynomials of a given degree and order...
  • 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...
  • ROLMIP

  • Referenced in 15 articles [sw21158]
  • designed to work specifically with optimization problems presenting parameter-dependent 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...
  • Sieve-SDP

  • Referenced in 4 articles [sw31824]
  • infeasibility. It does not rely on any optimization solver: the only subroutine it needs ... literature, with many SDPs coming from polynomial optimization...