Related papers: Algebraic Core and Convex Calculus without Topolog…
One of the most important optimality conditions to aid to solve a vector optimization problem is the first-order necessary optimality condition that generalizes the Karush-Kuhn-Tucker condition. However, to obtain the sufficient optimality…
The classical Heron problem states: \emph{on a given straight line in the plane, find a point $C$ such that the sum of the distances from $C$ to the given points $A$ and $B$ is minimal}. This problem can be solved using standard geometry or…
We construct a complete locally convex topological vector space $X$ of countable algebraic dimension and a continuous linear operator $T:X\to X$ such that $T$ has no non-trivial closed invariant subspaces.
Proofs of the fundamental theorem of algebra can be divided up into three groups according to the techniques involved: proofs that rely on real or complex analysis, algebraic proofs, and topological proofs. Algebraic proofs make use of the…
Given an ideal $\mathcal{I}$ on $\omega$ and a sequence $x$ in a topological vector space, we let the $\mathcal{I}$-core of $x$ be the least closed convex set containing $\{x_n: n \notin I\}$ for all $I \in \mathcal{I}$. We show two…
We use techniques from both real and complex algebraic geometry to study K-theoretic and related invariants of the algebra C(X) of continuous complex-valued functions on a compact Hausdorff topological space X. For example, we prove a…
A toral algebraic set $A$ is an algebraic set in $\C^n$ whose intersection with $\T^n$ is sufficiently large to determine the holomorphic functions on $A$. We develop the theory of these sets, and give a number of applications to function…
Let G be a locally compact group. Consider the Banach algebra L_1(G)^**, equipped with the first Arens multiplication, as well as the algebra LUC(G)^*, the dual of the space of bounded left uniformly continuous functions on G, whose product…
A new and extensive formalism is developed for monads and galaxies in non-standard enlargements. It is shown that monads and galaxies can be manipulated using order-preserving and order-reversing set-to-set maps, and that set properties…
The $\mathcal{VU}$-algorithm is a superlinearly convergent method for minimizing nonsmooth, convex functions. At each iteration, the algorithm works with a certain $\mathcal{V}$-space and its orthogonal $\U$-space, such that the…
A key idea in convex optimization theory is to use well-structured affine functions to approximate general functions, leading to impactful developments in conjugate functions and convex duality theory. This raises the question: what are the…
A hyperbolic algebraic curve is a bounded subset of an algebraic set. We study the function theory and functional analytic aspects of these sets. We show that their function theory can be described by finite codimensional subalgebras of the…
In this paper some concepts of convex analysis on hyperbolic space are studied. We first study properties of the intrinsic distance, for instance, we present the spectral decomposition of its Hessian. Next, we study the concept of convex…
This is a case study of the algebraic boundary of convex hulls of varieties. We focus on surfaces in fourspace to showcase new geometric phenomena that neither curves nor hypersurfaces do. Our method is a detailed analysis of a general…
Recently geometric hypergraphs that can be defined by intersections of pseudohalfplanes with a finite point set were defined in a purely combinatorial way. This led to extensions of earlier results about points and halfplanes to…
A new notion of face relative interior for convex sets in topological real vector spaces is introduced in this work. Face relative interior is grounded in the facial structure, and may capture the geometry of convex sets in topological…
This paper presents a family of algorithms for decentralized convex composite problems. We consider the setting of a network of agents that cooperatively minimize a global objective function composed of a sum of local functions plus a…
The Belgian chocolate problem involves maximizing a parameter {\delta} over a non-convex region of polynomials. In this paper we detail a global optimization method for this problem that outperforms previous such methods by exploiting…
Real algebraic geometry adapts the methods and ideas from (complex) algebraic geometry to study the real solutions to systems of polynomial equations and polynomial inequalities. As it is the real solutions to such systems modeling…
We consider the differentiation of the value function for parametric optimization problems. Such problems are ubiquitous in Machine Learning applications such as structured support vector machines, matrix factorization and min-min or…