Related papers: Ca{\Sigma}oS: A nonlinear sum-of-squares optimizat…
In this paper we present efficient computational and symbolic algorithms for solving a nearly pentadiagonal linear systems. The implementation of the algorithms using Computer Algebra Systems (CAS)such as MAPLE, MACSYMA, MATHEMATICA, and…
Nonlinear dynamics and pattern formation in the systems with quadratic nonlinearity is computed symbolically by specially developed MATHEMATICA package. A Web interface for the presented methods is developed, which turns the implementations…
In this paper we present an efficient computational and symbolic algorithms for solving a backward pentadiagonal linear systems. The implementation of the algorithms using Computer Algebra Systems (CAS) such as MAPLE, MACSYMA, MATHEMATICA,…
Algorithms are presented for the tanh- and sech-methods, which lead to closed-form solutions of nonlinear ordinary and partial differential equations (ODEs and PDEs). New algorithms are given to find exact polynomial solutions of ODEs and…
This paper introduces an efficient first-order method based on the alternating direction method of multipliers (ADMM) to solve semidefinite programs (SDPs) arising from sum-of-squares (SOS) programming. We exploit the sparsity of the…
Geometry processing presents a variety of difficult numerical problems, each seeming to require its own tailored solution. This breadth is largely due to the expansive list of geometric primitives, e.g., splines, triangles, and hexahedra,…
We present alfonso, an open-source Matlab package for solving conic optimization problems over nonsymmetric convex cones. The implementation is based on the authors' corrected analysis of a primal-dual interior-point method of Skajaa and…
We demonstrate applications of algebraic techniques that optimize and certify polynomial inequalities to problems of interest in the operations research and transportation engineering communities. Three problems are considered: (i) wireless…
Symbolic integration is an important module of a typical Computer Algebra System. As for now, Mathematica, Matlab, Maple and Sage are all mainstream CAS. They share the same framework for symbolic integration at some points. In this book…
We devise a scheme for solving an iterative sequence of linear programs (LPs) or second order cone programs (SOCPs) to approximate the optimal value of any semidefinite program (SDP) or sum of squares (SOS) program. The first LP and…
In this paper, we develop a dynamical system counterpart to the term sparsity sum-of-squares (TSSOS) algorithm proposed for static polynomial optimization. This allows for computational savings and improved scalability while preserving…
We present the package SADE (Symmetry Analysis of Differential Equations) for the determination of symmetries and related properties of systems of differential equations. The main methods implemented are: Lie, nonclassical, Lie-B\"acklund…
Certifying nonnegativity of polynomials is a well-known NP-hard problem with direct applications spanning non-convex optimization, control, robotics, and beyond. A sufficient condition for nonnegativity is the Sum of Squares (SOS) property,…
Global optimization has gained attraction over the past decades, thanks to the development of both theoretical foundations and efficient numerical routines. Among recent advances, Kernel Sum of Squares (KernelSOS) provides a powerful…
Sums-of-squares (SOS) optimization is a promising tool to synthesize certifiable controllers for nonlinear dynamical systems. Building upon prior works, we demonstrate that SOS can synthesize dynamic controllers with bounded suboptimal…
One of the desirable objectives in feedback control design is to formulate and solve the design problem as an optimisation problem that is convex, so that an optimal solution can be found efficiently. Unfortunately many control design…
In this paper, we propose a framework based on sum-of-squares programming to design iterative first-order optimization algorithms for smooth and strongly convex problems. Our starting point is to develop a polynomial matrix inequality as a…
Automated proving of polynomial inequalities is a fundamental challenge in automated mathematical reasoning, where rich algebraic structure and a rapidly growing certificate search space hinder scalability. Purely symbolic approaches…
Handling an infinite number of inequality constraints in infinite-dimensional spaces occurs in many fields, from global optimization to optimal transport. These problems have been tackled individually in several previous articles through…
We consider the problem of finding exact sums of squares (SOS) decompositions for certain classes of non-negative multivariate polynomials, relying on semidefinite programming (SDP) solvers. We start by providing a hybrid numeric-symbolic…