Related papers: Algebraic Core and Convex Calculus without Topolog…

In applications throughout science and engineering one is often faced with the challenge of solving an ill-posed inverse problem, where the number of available measurements is smaller than the dimension of the model to be estimated. However…

We show that the minimization problem of any non-convex and non-lower semi-continuous function on a compact convex subset of a locally convex real topological vector space can be studied via an associated convex and lower semi-continuous…

This article investigates matrix convex sets and introduces their tracial analogs which we call contractively tracial convex sets. In both contexts completely positive (cp) maps play a central role: unital cp maps in the case of matrix…

Starting from the Colombeau's full generalized functions, the sharp topologies and the notion of generalized points, we introduce a new kind differential calculus (for functions between totally disconnected spaces). We study generalized…

The (delta-) normal cone to an arbitrary intersection of sublevel sets of proper, lower semicontinuous, and convex functions is characterized, using either epsilon-subdifferentials at the nominal point or exact subdifferentials at nearby…

The purpose of this paper is to give an updated survey on various algebraic and analytic properties of semigroups related to fixed point properties of semigroup actions on a non-empty closed convex subset of a Banach space or, more…

This chapter is a tutorial on techniques and results in free convex algebraic geometry and free real algebraic geometry (RAG). The term free refers to the central role played by algebras of noncommutative polynomials R<x> in free (freely…

We consider convex programming problems with integrality constraints that are invariant under a linear symmetry group. To decompose such problems we introduce the new concept of core points, i.e., integral points whose orbit polytopes are…

Vertex algebras (and their modules) can be described as vector spaces together with a linear operator-valued series in one parameter $z$. With the interpretation of $z$ as a coordinate at a point on a curve, one can construct algebraic…

These lecture notes present a computation driven pathway from classical complex analysis to the theory of compact Riemann surfaces and their connections to algebraic geometry. The exposition follows a compute first then abstract philosophy,…

We consider several basic questions pertaining to the geometry of image of a general quadratic map. In general the image of a quadratic map is non-convex, although there are several known classes of quadratic maps when the image is convex.…

In this article we define an algebraic vertex of a generalized polyhedron and show that it is the smallest set of points needed to define the polyhedron. We prove that the indicator function of a generalized polytope $P$ is a linear…

We investigate robust optimization problems defined for maximizing convex functions. For finite uncertainty set, we develop a geometric branch-and-bound algorithmic approach to solve this problem. The geometric branch-and-bound algorithm…

We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial…

Much like in the theory of algebraic geometry, we develop a correspondence between certain types of algebraic and geometric objects. The basic algebraic environment we work in is the a semifield of fractions H(x1,...,xn) of the polynomial…

This is a survey article on real algebra and geometry, and in particular on its recent applications in optimization and convexity. We first introduce basic notions and results from the classical theory. We then explain how these relate to…

We study the computational difficulty of the problem of finding fixed points of nonexpansive mappings in uniformly convex Banach spaces. We show that the fixed point sets of computable nonexpansive self-maps of a nonempty, computably weakly…

We focus on establishing the foundational paradigm of a novel optimization theory based on convolution with convex kernels. Our goal is to devise a morally deterministic model of locating the global optima of an arbitrary function, which is…

This article describes a method to compute successive convex approximations of the convex hull of a set of points in R^n that are the solutions to a system of polynomial equations over the reals. The method relies on sums of squares of…

Working in infinite dimensional linear spaces, we deal with support for closed sets without interior. We generalize the Convexity Theorem for closed sets without interior. Finally we study the infinite dimensional version of Jordan…