Related papers: Characterization of generic parameter families of …
Shortened abstract: Given a constrained minimization problem, under what conditions does there exist a related, unconstrained problem having the same minimum points? This basic question in global optimization motivates this paper, which…
When persistence diagrams are formalized as the Mobius inversion of the birth-death function, they naturally generalize to the multi-parameter setting and enjoy many of the key properties, such as stability, that we expect in applications.…
Let $X$ be a finite set such that $|X|=n$ and let $i\leq j \leq n$. A group $G\leq \sym$ is said to be $(i,j)$-homogeneous if for every $I,J\subseteq X$, such that $|I|=i$ and $|J|=j$, there exists $g\in G$ such that $Ig\subseteq J$.…
Constrained optimization problems are often characterized by multiple constraints that, in the practice, must be satisfied with different tolerance levels. While some constraints are hard and as such must be satisfied with zero-tolerance,…
We propose a stochastic conditional gradient method (CGM) for minimizing convex finite-sum objectives formed as a sum of smooth and non-smooth terms. Existing CGM variants for this template either suffer from slow convergence rates, or…
This is a review paper, summarizing without proofs recent results by the authors on the property of strong metric subregularity (SMSR) in optimization. It presents sufficient conditions for SMSR of the optimality mapping associated with a…
Handling an infinite number of inequality constraints in infinite-dimensional spaces occurs in many fields, from global optimization to optimal transport. These problems have been tackled individually in several previous articles through…
The factor graph of an instance of a symmetric constraint satisfaction problem on n Boolean variables and m constraints (CSPs such as k-SAT, k-AND, k-LIN) is a bipartite graph describing which variables appear in which constraints. The…
Gradient Descent (GD) and Conjugate Gradient (CG) methods are among the most effective iterative algorithms for solving unconstrained optimization problems, particularly in machine learning and statistical modeling, where they are employed…
We introduce the concept of topological finite-determinacy for germs of analytic functions within a fixed ideal $I$, which provides a notion of topological finite-determinacy of functions with non-isolated singularities. We prove the…
We analyze the embedding dimension of a normal weighted homogeneous surface singularity, and more generally, the Poincar\'e series of the minimal set of generators of the graded algebra of regular functions, provided that the link of the…
We present new families of goodness-of-fit tests of uniformity on a full-dimensional set $W\subset\R^d$ based on statistics related to edge lengths of random geometric graphs. Asymptotic normality of these statistics is proven under the…
Kohonen's Self-Organizing Maps (SOMs) have proven to be a successful data-reduction method to identify the intrinsic lower-dimensional sub-manifold of a data set that is scattered in the higher-dimensional feature space. Motivated by the…
Skew-Gaussian processes (SkewGPs) extend the multivariate Unified Skew-Normal distributions over finite dimensional vectors to distribution over functions. SkewGPs are more general and flexible than Gaussian processes, as SkewGPs may also…
In this paper we study the deformation and Q-Gorenstein deformation theory of schemes with non-isolated singularities. We obtain obstruction spaces for the existence of deformations and also for local deformations to exist globally. Finally…
Let $G = GL(n)$ and $K = GL(p) \times GL(q)$ with $p+q=n$, where the groups are taken over $\C$. In this paper we study a certain family of $K$-orbit closures on the flag variety $X$ of $G$. The geometry of these orbit closures plays a…
We study a variant of the \emph{generalized assignment problem} ({\sf GAP}) with group constraints. An instance of {\sf Group GAP} is a set $I$ of items, partitioned into $L$ groups, and a set of $m$ uniform (unit-sized) bins. Each item $i…
Let $G$ be a group containing a nilpotent normal subgroup $N$ with central series $\{N_j\}$, such that each $N_j/N_{j+1}$ is a $\mathbb{F}$-vector space over a field $\mathbb{F}$ and the action of $G$ on $N_j/N_{j+1}$ induced by the…
In this paper, we classify the generic singularities of 2-parameter plane congruences in $\mathbb{R^4}$ and the generic singularities of affine normal plane congruences. We also study the generic singularities of the family of affine…
Genetic sequencing has become an increasingly affordable and accessible source of genomic data in computational biology. This data is often represented as $k$-mers, i.e., strings of some fixed length $k$ with symbols chosen from a reference…