相关论文: Solving polynomial variational inequality problems…
We propose to solve polynomial hyperbolic partial differential equations (PDEs) with convex optimization. This approach is based on a very weak notion of solution of the nonlinear equation, namely the measure-valued (mv) solution,…
We study how to solve semidefinite programming relaxations for large scale polynomial optimization. When interior-point methods are used, typically only small or moderately large problems could be solved. This paper studies regularization…
In this paper, we examine linear programming (LP) relaxations based on Bernstein polynomials for polynomial optimization problems (POPs). We present a progression of increasingly more precise LP relaxations based on expressing the given…
The method of separation of variables can be used to solve many separable linear partial differential equations (LPDEs). Moreover, variable separation solutions usually are some trigonometric series. In the paper, base on some ideas of this…
The aim of this paper is to study the existence of a finite stopping time for solutions in the form of variational inequality to fluid flows following a power law (or Ostwald-DeWaele law) in dimension $N \in \{2,3\}$. We first establish the…
This paper considers sparse polynomial optimization with unbounded sets. When the problem possesses correlative sparsity, we propose a sparse homogenized Moment-SOS hierarchy with perturbations to solve it. The new hierarchy introduces one…
This paper presents a pseudo-spectral method for Dynamic Optimization Problems (DOPs) that allows for tight polynomial bounds to be achieved via flexible sub-intervals. The proposed method not only rigorously enforces inequality…
Convex relaxation methods are powerful tools for studying the lowest energy of many-body problems. By relaxing the representability conditions for marginals to a set of local constraints, along with a global semidefinite constraint, a…
In this paper, we consider polynomial optimization with correlative sparsity. We construct correlatively sparse Lagrange multiplier expressions (CS-LMEs) and propose CS-LME reformulations for polynomial optimization problems using the…
We present a novel, global algorithm for solving polynomial multiparameter eigenvalue problems (PMEPs) by leveraging a hidden variable tensor Dixon resultant framework. Our method transforms a PMEP into one or more univariate polynomial…
We consider hierarchical variational inequality problems, or more generally, variational inequalities defined over the set of zeros of a monotone operator. This framework includes convex optimization over equilibrium constraints and…
The behaviour of the moment-sums-of-squares (moment-SOS) hierarchy for polynomial optimal control problems on compact sets has been explored to a large extent. Our contribution focuses on the case of non-compact control sets. We describe a…
We consider the following basic problem: given an $n$-variate degree-$d$ homogeneous polynomial $f$ with real coefficients, compute a unit vector $x \in \mathbb{R}^n$ that maximizes $|f(x)|$. Besides its fundamental nature, this problem…
We propose a model for the coupling between free fluid and a linearized poro-hyperelastic body. In this model, the Brinkman equation is employed for fluid flow in the porous medium, incorporating inertial effects into the fluid dynamics. A…
We are concerned with the problem of decomposing the parameter space of a parametric system of polynomial equations, and possibly some polynomial inequality constraints, with respect to the number of real solutions that the system attains.…
In this article we propose a novel strategy for choosing the Lagrange multipliers in the Levenberg-Marquardt method for solving ill-posed problems modeled by nonlinear operators acting between Hilbert spaces. Convergence analysis results…
In this article, we describe an implementation of a polynomial system solver to compute the approximate solutions of a 0-dimensional polynomial system with finite precision p-adic arithmetic. We also describe an improvement to an algorithm…
In this work, we focus on separable convex optimization problems with box constraints and a set of triangular linear constraints. The solution is given in closed-form as a function of some Lagrange multipliers that can be computed through…
In this work we design a general method for proving moment inequalities for polynomials of independent random variables. Our method works for a wide range of random variables including Gaussian, Boolean, exponential, Poisson and many…
We consider the semi-infinite system of polynomial inequalities of the form \[ \mathbf{K}:=\{x\in\mathbb{R}^m\mid p(x,y)\ge 0,\ \ \forall y\in S\subseteq\mathbb{R}^n\}, \] where $p(x,y)$ is a real polynomial in the variables $x$ and the…