Related papers: Efficient treatment of bilinear forms in global op…
In this paper, two nonconforming finite element schemes that use piecewise cubic and piecewise quartic polynomials respectively are constructed for the planar biharmonic equation with optimal convergence rates on general shape-regular…
This article studies problems of optimal transport, by embedding them in a general functional analytic framework of convex optimization. This provides a unified treatment of a large class of related problems in probability theory and allows…
We propose a novel method to fit and segment multi-structural data via convex relaxation. Unlike greedy methods --which maximise the number of inliers-- this approach efficiently searches for a soft assignment of points to models by…
Current state-of-the-art methods for solving discrete optimization problems are usually restricted to convex settings. In this paper, we propose a general approach based on cutting planes for solving nonlinear, possibly nonconvex, binary…
This paper investigates a shape optimization problem involving the Signorini unilateral conditions in a linear elastic model, without any penalization procedure. The shape sensitivity analysis is performed using tools from convex and…
We consider inhomogeneous supersymmetric bilinear forms, i.e., forms that are neither even nor odd. We classify such forms up to dimension seven in the case when the restrictions of the form to the even and odd parts of the superspace are…
We study optimization programs given by a bilinear form over non-commutative variables subject to linear inequalities. Problems of this form include the entangled value of two-prover games, entanglement-assisted coding for classical…
We use "generalized" version of total variation, coarea formulas, isoperimetric inequalities to obtain sharp estimates for solutions (and for their gradients) to anisotropic elliptic equations with a lower order term, comparing them with…
In two-phase image segmentation, convex relaxation has allowed global minimisers to be computed for a variety of data fitting terms. Many efficient approaches exist to compute a solution quickly. However, we consider whether the nature of…
We further research on the accelerated optimization phenomenon on Riemannian manifolds by introducing accelerated global first-order methods for the optimization of $L$-smooth and geodesically convex (g-convex) or $\mu$-strongly g-convex…
We describe strong convex valid inequalities for conic quadratic mixed 0-1 optimization. These inequalities can be utilized for solving numerous practical nonlinear discrete optimization problems from value-at-risk minimization to queueing…
Coordinate-wise minimization is a simple popular method for large-scale optimization. Unfortunately, for general (non-differentiable) convex problems it may not find global minima. We present a class of linear programs that coordinate-wise…
In this note we provide a full conjugacy and subdifferential calculus for convex convex-composite functions in finite-dimensional space. Our approach, based on infimal convolution and cone-convexity, is straightforward and yields the…
We present an efficient framework for solving algebraically-constrained global non-convex polynomial optimization problems over subsets of the hypercube. We prove the existence of an equivalent nonlinear reformulation of such problems that…
We consider the global optimization of nonconvex quadratic programs and mixed-integer quadratic programs. We present a family of convex quadratic relaxations which are derived by convexifying nonconvex quadratic functions through…
We establish improved bounds for bilinear forms with Kloosterman fractions of the form ${\sum\sum}_{m,n} \alpha_m \beta_n e(a\overline{m}/(bn))$ with $M<m\le 2M$, $N < n \le 2N$ and $(m,n)=1$. Our approach works directly with arbitrary…
In this paper we study convex bi-level optimization problems for which the inner level consists of minimization of the sum of smooth and nonsmooth functions. The outer level aims at minimizing a smooth and strongly convex function over the…
We devise a method that reduces the problem of classifying systems of forms and linear mappings to the problem of classifying systems of linear mappings. Canonical matrices of (i) bilinear or sesquilinear forms, (ii) pairs of symmetric,…
We prove that bilinear fractional integral operators and similar multipliers are smoothing in the sense that they improve the regularity of functions. We also treat bilinear singular multiplier operators which preserve regularity and obtain…
In this work, we develop a framework based on piecewize B\'ezier curves to plane shapes deformation and we apply it to shape optimization problems. We describe a general setting and some general result to reduce the study of a shape…