Related papers: Improving SDP bounds for minimizing quadratic func…
The uniform quadratic optimizatin problem (UQ) is a nonconvex quadratic constrained quadratic programming (QCQP) sharing the same Hessian matrix. Based on the second-order cone programming (SOCP) relaxation, we establish a new sufficient…
We consider a property of positive polynomials on a compact set with a small perturbation. When applied to a Polynomial Optimization Problem (POP), the property implies that the optimal value of the corresponding SemiDefinite Programming…
We introduce a method for proving lower bounds on the efficacy of semidefinite programming (SDP) relaxations for combinatorial problems. In particular, we show that the cut, TSP, and stable set polytopes on $n$-vertex graphs are not the…
A sequential quadratic optimization algorithm for minimizing an objective function defined by an expectation subject to nonlinear inequality and equality constraints is proposed, analyzed, and tested. The context of interest is when it is…
We develop a numerical method for solving shape optimization of functionals involving Steklov eigenvalues and apply it to the problem of maximization of the $k$-th Steklov eigenvalue, under volume constraint. A similar study in the planar…
We consider parabolic equations with mixed boundary conditions and domain inhomogeneities supported on a lower dimensional hypersurface, enforcing a jump in the conormal derivative. Only minimal regularity assumptions on the domain and the…
We show that the ball does not maximize the first nonzero Steklov eigenvalue among all contractible domains of fixed boundary volume in $\mathbb{R}^n$ when $n \geq 3$. This is in contrast to the situation when $n=2$, where a result of…
We obtain upper and lower bounds for Steklov eigenvalues of submanifolds with prescribed boundary in Euclidean space. A very general upper bound is proved, which depends only on the geometry of the fixed boundary and on the measure of the…
This paper studies the problem of selecting a submatrix of a positive definite matrix in order to achieve a desired bound on the smallest eigenvalue of the submatrix. Maximizing this smallest eigenvalue has applications to selecting input…
It has been shown that the maximum stable set problem in some infinite graphs, and the kissing number problem in particular, reduces to a minimization problem over the cone of copositive kernels. Optimizing over this infinite dimensional…
We re-confirm, for the case of the unit p-ball of R^n, one of recent conjectures of G.Kuperberg on centrally symmetric convex bodies.This conjecture was very recently confirmrd for this particular case by D.A.Gutierrez using polygamma…
There are at least two directions concerning the extension of classical sharp Hardy-Littlewood-Sobolev inequality: (1) Extending the sharp inequality on general manifolds; (2) Extending it for the negative exponent $\lambda=n-\alpha$ (that…
In the first paper of this series we established new upper bounds for multi-variable exponential sums associated with a quadratic form. The present study shows that if one adds a linear term in the exponent, the estimates can be further…
An eigenvalue problem arising in optimal insulation related to the minimization of the heat decay rate of an insulated body is adapted to enforce a positive lower bound imposed on the distribution of insulating material. We prove the…
In this paper, we propose a branch-and-bound algorithm for solving nonconvex quadratic programming problems with box constraints (BoxQP). Our approach combines existing tools, such as semidefinite programming (SDP) bounds strengthened…
We are given a uniformly elliptic coefficient field that we regard as a realization of a stationary and finite-range (say, range unity) ensemble of coefficient fields. Given a (deterministic) right-hand-side supported in a ball of size…
We develop a computational method for extremal Steklov eigenvalue problems and apply it to study the problem of maximizing the $p$-th Steklov eigenvalue as a function of the domain with a volume constraint. In contrast to the optimal…
We consider the series expansion of the $L^p$-Hardy inequality of \cite{BFT2}, in the particular case where the distance is taken from an interior point of a bounded domain in $\mathbb{R}^n$ and $1<p\neq n$. For $p<n$ we improve it by…
We prove sharp $L^p$ estimates for the Steklov eigenfunctions on compact manifolds with boundary in terms of their $L^2$ norms on the boundary. We prove it by establishing $L^p$ bounds for the harmonic extension operators as well as the…
We consider the problem of minimizing a fixed-degree polynomial over the standard simplex. This problem is well known to be NP-hard, since it contains the maximum stable set problem in combinatorial optimization as a special case. In this…