GloptiPoly

DOI10.1145/779359.779363zbMath1070.65549OpenAlexW2001033871WikidataQ113309750 ScholiaQ113309750MaRDI QIDQ5461055

Jean-Bernard Lasserre, Didier Henrion

Publication date: 21 July 2005

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/779359.779363

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Packaged methods for numerical algorithms (65Y15) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (98)

Minimizing the sum of many rational functions ⋮ Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets ⋮ Simulation of discrete linear time-invariant fuzzy dynamic systems ⋮ Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization ⋮ Sum of squares method for sensor network localization ⋮ Moments and sums of squares for polynomial optimization and related problems ⋮ Confidence regions for the location of response surface optima: the R package OptimaRegion ⋮ An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems ⋮ Semidefinite representation of convex sets ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Globally optimal estimates for geometric reconstruction problems ⋮ Duality of sum of nonnegative circuit polynomials and optimal SONC bounds ⋮ Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach ⋮ Certifying the global optimality of quartic minimization over the sphere ⋮ Finding largest small polygons with gloptipoly ⋮ Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals ⋮ On the estimation of robustness and filtering ability of dynamic biochemical networks under process delays, internal parametric perturbations and external disturbances ⋮ Solving polynomial least squares problems via semidefinite programming relaxations ⋮ A novel LMI-based optimization algorithm for the guaranteed estimation of the domain of attraction using rational Lyapunov functions ⋮ Global optimality conditions and optimization methods for constrained polynomial programming problems ⋮ On the complexity of Putinar's Positivstellensatz ⋮ Semidefinite relaxations of dynamical programs under discrete constraints ⋮ Partitioning procedure for polynomial optimization ⋮ An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones ⋮ Approximation algorithms for homogeneous polynomial optimization with quadratic constraints ⋮ UTA-poly and UTA-splines: additive value functions with polynomial marginals ⋮ A new approximation hierarchy for polynomial conic optimization ⋮ POS3POLY -- a MATLAB preprocessor for optimization with positive polynomials ⋮ Optimality conditions and finite convergence of Lasserre's hierarchy ⋮ Distance to a constitutive tensor isotropy stratum by the Lasserre polynomial optimization method ⋮ Globally optimal algorithms for stratified autocalibration ⋮ An efficient DC programming approach for portfolio decision with higher moments ⋮ Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm ⋮ An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization ⋮ Global optimality conditions for cubic minimization problems with cubic constraints ⋮ Algorithms for the orthographic-\(n\)-point problem ⋮ Comonotone and coconvex rational interpolation and approximation ⋮ Linear control of time-domain constrained systems ⋮ Exact determinations of the maximal output admissible set for a class of nonlinear systems ⋮ Enforcing stability constraints in set-membership identification of linear dynamic systems ⋮ Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts ⋮ Moment Problem and Its Applications to Risk Assessment ⋮ Min-max and robust polynomial optimization ⋮ Stability and Bifurcations in a Model of Bacteria Immunity with Quorum Sensing ⋮ Sum-of-Squares Optimization without Semidefinite Programming ⋮ Semidefinite programming for min-max problems and games ⋮ Efficiency improvement in an \(n\)D systems approach to polynomial optimization ⋮ An alternative approach for nonlinear optimal control problems based on the method of moments ⋮ A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals ⋮ TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity ⋮ Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension ⋮ Exact relaxations of non-convex variational problems ⋮ DIRECTGO: A new DIRECT-type MATLAB toolbox for derivative-free global optimization ⋮ Global optimality conditions and optimization methods for polynomial programming problems ⋮ Improved parameter bounds for set-membership EIV problems ⋮ Analog circuit design by nonconvex polynomial optimization: Two design examples ⋮ Binary quadratic optimization problems that are difficult to solve by conic relaxations ⋮ Optimal Designs for Rational Function Regression ⋮ An analogue of the Riesz-Haviland theorem for the truncated moment problem ⋮ Exact Certification in Global Polynomial Optimization Via Rationalizing Sums-Of-Squares ⋮ Global minimization of rational functions and the nearest GCDs ⋮ Approximation of Model Predictive Control Laws for Polynomial Systems ⋮ The domain of attraction for the endemic equilibrium of an SIRS epidemic model ⋮ Global optimization of rational functions: a semidefinite programming approach ⋮ Robust synchronization analysis in nonlinear stochastic cellular networks with time-varying delays, intracellular perturbations and intercellular noise ⋮ Coarse-Convex-Compactification Approach to Numerical Solution of Nonconvex Variational Problems ⋮ Shear-driven planar Couette and Taylor-like instabilities for a class of compressible isotropic elastic solids ⋮ Minimizing polynomials via sum of squares over the gradient ideal ⋮ Robust global optimization with polynomials ⋮ Robust optimization with simulated annealing ⋮ An improved semidefinite programming relaxation for the satisfiability problem ⋮ An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions ⋮ Adaptive output control of uncertain nonlinear systems with non-symmetric dead-zone input ⋮ A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming ⋮ LMI conditions for robust stability analysis based on polynomially parameter-dependent Lyapunov functions ⋮ A semidefinite programming approach to the generalized problem of moments ⋮ Semidefinite programming relaxations and algebraic optimization in control ⋮ PRICING A CLASS OF EXOTIC OPTIONS VIA MOMENTS AND SDP RELAXATIONS ⋮ On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0 ⋮ Computation of stable convex combinations of a set of matrices through LMIs with application in \(\mathcal{H}_\infty\) control of switched linear systems ⋮ Algorithm 996 ⋮ Algorithm 998 ⋮ Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation ⋮ GpoSolver: a Matlab/C++ toolbox for global polynomial optimization ⋮ Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction ⋮ A geometric branch and bound method for robust maximization of convex functions ⋮ On semidefinite bounds for maximization of a non-convex quadratic objective over thel₁unit ball ⋮ Algorithm 950 ⋮ An algorithm for the global optimization of a class of continuous minimax problems ⋮ Radii minimal projections of polytopes and constrained optimization of symmetric polynomials ⋮ An efficient algorithm for range computation of polynomials using the Bernstein form ⋮ Limits of positive flat bivariate moment matrices ⋮ Equivalence of sum of squares convex relaxations for quadratic distance problems ⋮ Optimal periodic feedback design for continuous-time LTI systems with constrained control structure ⋮ Control analysis and design via randomised coordinate polynomial minimisation ⋮ Nonsmooth bundle trust-region algorithm with applications to robust stability ⋮ Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm ⋮ Advances in computational Lyapunov analysis using sum-of-squares programming

Uses Software

• Unnamed Item
• SeDuMi
• GloptiPoly

This page was built for publication: GloptiPoly