相关论文: Distance to a constitutive tensor isotropy stratum…

Building on the blueprint from Goemans and Williamson (1995) for the Max-Cut problem, we construct a polynomial-time approximation algorithm for orthogonally constrained quadratic optimization problems. First, we derive a semidefinite…

We present a new implementation of the geometric method of Cullen & Purser (1984) for solving the semi-geostrophic Eady slice equations which model large scale atmospheric flows and frontogenesis. The geometric method is a Lagrangian…

We present a polynomial time algorithm to approximately scale tensors of any format to arbitrary prescribed marginals (whenever possible). This unifies and generalizes a sequence of past works on matrix, operator and tensor scaling. Our…

In recent years, semidefinite relaxations of common optimization problems in robotics have attracted growing attention due to their ability to provide globally optimal solutions. In many cases, it was shown that specific handcrafted…

A polynomial matrix inequality is a formula asserting that a polynomial matrix is positive semidefinite. Polynomial matrix optimization concerns minimizing the smallest eigenvalue of a symmetric polynomial matrix subject to a tuple of…

We show that Nesterov acceleration is an optimal-order iterative regularization method for linear ill-posed problems provided that a parameter is chosen accordingly to the smoothness of the solution. This result is proven both for an a…

In this paper we analyze a posteriori error estimates for a mixed formulation of the linear elasticity eigenvalue problem. A posteriori estimators for the nearly and perfectly compressible elasticity spectral problems are proposed. With a…

A numerical method is developed to solve linear semi-infinite programming problem (LSIP) in which the iterates produced by the algorithm are feasible for the original problem. This is achieved by constructing a sequence of standard linear…

We propose a compressive spectral collocation method for the numerical approximation of Partial Differential Equations (PDEs). The approach is based on a spectral Sturm-Liouville approximation of the solution and on the collocation of the…

We consider problems with multiple linear objectives and linear constraints and use Adjustable Robust Optimization and Polynomial Optimization as tools to approximate the Pareto set with polynomials of arbitrarily large degree. The main…

We derive a three-term recurrence relation for computing the polynomial of best approximation in the uniform norm to $x^{-1}$ on a finite interval with positive endpoints. As application, we consider two-level methods for scalar elliptic…

This paper presents a nonconforming finite element approximation of the space of symmetric tensors with square integrable divergence, on tetrahedral meshes. Used for stress approximation together with the full space of piecewise linear…

We propose a volumetric formulation for computing the Optimal Transport problem defined on surfaces in $\mathbb{R}^3$, found in disciplines like optics, computer graphics, and computational methodologies. Instead of directly tackling the…

Laguerre polynomials are orthogonal polynomials defined on positive half line with respect to weight $e^{-x}$. They have wide applications in scientific and engineering computations. However, the exponential growth of Laguerre polynomials…

Partitioning the vertices of a graph into two roughly equal parts while minimizing the number of edges crossing the cut is a fundamental problem (called Balanced Separator) that arises in many settings. For this problem, and variants such…

We study the exponential stability of constant steady state of isentropic compressible Euler equation with damping on $\mathbb T^n$. The local existence of solutions is based on semigroup theory and some commutator estimates. We propose a…

There has been significant recent progress on algorithms for approximating graph spanners, i.e., algorithms which approximate the best spanner for a given input graph. Essentially all of these algorithms use the same basic LP relaxation, so…

We present a polynomial time dynamic programming algorithm for optimal partitions in the shortest path metric induced by a tree. This resolves, among other things, the exact complexity status of the optimal partition problems in one…

This paper deals with speeding up the convergence of a class of two-step iterative methods for solving linear systems of equations. To implement the acceleration technique, the residual norm associated with computed approximations for each…

We propose an effective geometrical approach to recover the normal form of a given Elasticity tensor, once we know its symmetry class. In other words, we produce a rotation which brings an Elasticity tensor onto its normal form, given its…