Related papers: Complexity Results for Implication Bases of Convex…
Nonlinear programming is explicitly analyzed via a novel perspective/method and from a bottom-up manner. The philosophy is based on the recent findings on convex quadratic equation (CQE), which help clarify a geometric interpretation that…
Geometric complexity theory (GCT) is an approach to the $P$ vs. $NP$ and related problems. A high level overview of this research plan and the results obtained so far was presented in a series of three lectures in the Institute of Advanced…
The basic idea of quantum complexity geometry is to endow the space of unitary matrices with a metric, engineered to make complex operators far from the origin, and simple operators near. By restricting our attention to a finite subgroup of…
In this work, we consider constrained stochastic optimization problems under hidden convexity, i.e., those that admit a convex reformulation via non-linear (but invertible) map $c(\cdot)$. A number of non-convex problems ranging from…
The aim of this paper is to give an existence result for a class of one-dimensional, non-convex, non-coercive problems in the Calculus of Variations. The main tools for the proof are an existence theorem in the convex case and the closure…
In 1978, Schaefer proved his famous dichotomy theorem for generalized satisfiability problems. He defined an infinite number of propositional satisfiability problems (nowadays usually called Boolean constraint satisfaction problems) and…
On negatively curved compact manifolds, it is possible to associate to every closed form a bounded cocycle - hence a bounded cohomology class - via integration over straight simplices. The kernel of this map is contained in the space of…
This article is devoted to characterize all possible effective behaviors of composite materials by means of periodic homogenization. This is known as a $G$-closure problem. Under convexity and $p$-growth conditions ($p>1$), it is proved…
We provide a solution method for the polyhedral convex set optimization problem, that is, the problem to minimize a set-valued mapping with polyhedral convex graph with respect to a set ordering relation which is generated by a polyhedral…
Error bounds, which refer to inequalities that bound the distance of vectors in a test set to a given set by a residual function, have proven to be extremely useful in analyzing the convergence rates of a host of iterative methods for…
In this paper, we study bijections on strictly convex sets of $\mathbf R \mathbf P^n$ for $n \geq 2$ and closed convex projective surfaces equipped with the Hilbert metric that map complete geodesics to complete geodesics as sets.…
Two-view relative pose estimation and structure reconstruction is a classical problem in computer vision. The typical methods usually employ the singular value decomposition of the essential matrix to get multiple solutions of the relative…
We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…
The underlying algebra for a noncommutative geometry is taken to be a matrix algebra, and the set of derivatives the adjoint of a subset of traceless matrices. This is sufficient to calculate the dual 1-forms, and show that the space of…
Convex optimization problems arising in applications often have favorable objective functions and complicated constraints, thereby precluding first-order methods from being immediately applicable. We describe an approach that exchanges the…
We are interested in existence results for second order differential inclusions, involving finite number of unilateral constraints in an abstract framework. These constraints are described by a set-valued operator, more precisely a proximal…
This article is the first part of a series of three articles about compatible systems of symplectic Galois representations and applications to the inverse Galois problem. In this first part, we determine the smallest field over which the…
This work puts forward a form finding problem of designing a least-volume vault that is a surface structure spanning over a plane region, which via pure compression transfers a vertically tracking load to the supporting boundary. Through a…
We consider the problem of approximating the solution of variational problems subject to the constraint that the admissible functions must be convex. This problem is at the interface between convex analysis, convex optimization, variational…
Approximations of functions with finite data often do not respect certain "structural" properties of the functions. For example, if a given function is non-negative, a polynomial approximation of the function is not necessarily also…