Related papers: Towards a Resolution of P = NP Conjecture
Let $P$ be a planar set of $n$ points in general position. We consider the problem of computing an orientation of the plane for which the Rectilinear Convex Hull of $P$ has minimum area. Bae et al. (Computational Geometry: Theory and…
In this paper, we consider convex quadratic optimization problems with indicators on the continuous variables. In particular, we assume that the Hessian of the quadratic term is a Stieltjes matrix, which naturally appears in sparse…
We effectively bound T-singularities on non-rational projective surfaces with an arbitrary amount of T-singularities and ample canonical class. This fully generalizes the previous work for the case of one singularity, and illustrates the…
We consider the 4-body problem in spaces of constant curvature and study the existence of spherical and hyperbolic rectangular solutions, i.e. equiangular quadrilateral motions on spheres and hyperbolic spheres. We focus on relative…
We focus on rational solutions or nearly-feasible rational solutions that serve as certificates of feasibility for polynomial optimization problems. We show that, under some separability conditions, certain cubic polynomially constrained…
We consider the problem of covering hypersphere by a set of spherical hypercaps. This sort of problem has numerous practical applications such as error correcting codes and reverse k-nearest neighbor problem. Using the reduction of non…
Under study is the new class of geometrical extremal problems in which it is required to achieve the best result in the presence of conflicting goals; e.g., given the surface area of a convex body $\mathfrak x$, we try to maximize the…
This chapter delves into the realm of computational complexity, exploring the world of challenging combinatorial problems and their ties with statistical physics. Our exploration starts by delving deep into the foundations of combinatorial…
In this article we develop a duality principle and concerning computational method for a structural optimization problem in elasticity. We consider the problem of finding the optimal topology for an elastic solid which minimizes its…
We study the convex-hull problem in a probabilistic setting, motivated by the need to handle data uncertainty inherent in many applications, including sensor databases, location-based services and computer vision. In our framework, the…
In this paper we are concerned with the local well-posedness of the unsteady potential flows near a space corner of right angle, which could be formulated as an initial-boundary value problem of a hyperbolic equation of second order in a…
This paper proposes a general fixture layout design framework that directly integrates the system equation with the convex relaxation method. Note that the optimal fixture design problem is a large-scale combinatorial optimization problem,…
This paper presents a novel and straight formulation, and gives a complete insight towards the understanding of the complexity of the problems of the so called NP-Class. In particular, this paper focuses in the Searching of the Optimal…
In general, standard necessary optimality conditions cannot be formulated in a straightforward manner for semi-smooth shape optimization problems. In this paper, we consider shape optimization problems constrained by variational…
We consider a variational convex relaxation of a class of optimal partitioning and multiclass labeling problems, which has recently proven quite successful and can be seen as a continuous analogue of Linear Programming (LP) relaxation…
This paper addresses smooth convexly constrained optimization problems where the Euclidean projection onto the feasible set is computationally tractable. Although momentum techniques like Polyak's heavy-ball are known for accelerating…
We study the existing algorithms that solve the multidimensional martingale optimal transport. Then we provide a new algorithm based on entropic regularization and Newton's method. Then we provide theoretical convergence rate results and we…
Physical design refers to mathematical optimization of a desired objective (e.g. strong light--matter interactions, or complete quantum state transfer) subject to the governing dynamical equations, such as Maxwell's or Schrodinger's…
Imprecise measurements of a point set P = (p1, ..., pn) can be modelled by a family of regions F = (R1, ..., Rn), where each imprecise region Ri contains a unique point pi. A retrieval models an accurate measurement by replacing an…
In this paper, we focus on the following general shape optimization problem: $$ \min\{J(\Om), \Om convex, \Om\in\mathcal S_{ad}\}, $$ where $\mathcal S_{ad}$ is a set of 2-dimensional admissible shapes and $J:\mathcal{S}_{ad}\to\R$ is a…