Related papers: Generic minimizing behavior in semi-algebraic opti…

Many algorithms for determining properties of real algebraic or semi-algebraic sets rely upon the ability to compute smooth points. Existing methods to compute smooth points on semi-algebraic sets use symbolic quantifier elimination tools.…

In this paper, we consider a generalized multivariate regression problem where the responses are monotonic functions of linear transformations of predictors. We propose a semi-parametric algorithm based on the ordering of the responses…

Consider a convex function that is invariant under an group of transformations. If it has a minimizer, does it also have an invariant minimizer? Variants of this problem appear in nonparametric statistics and in a number of adjacent fields.…

Subgradient and Newton algorithms for nonsmooth optimization require generalized derivatives to satisfy subtle approximation properties: conservativity for the former and semismoothness for the latter. Though these two properties originate…

We introduce the semiring of values $\Gamma$ with respect to the tropical operations associated to an algebroid curve. As a set, $\Gamma$ determines and is determined by the well known semigroup of values $S$ and we prove that $\Gamma$ is…

We prove a generalized version of the Morse index theorem for geodesics endowed with a non positive definite metric tensor (semi-Riemannian manifolds). We apply the result to obtain lower estimates on the number of geodesics joining two…

We consider the problem of minimizing the sum of cost functions pertaining to agents over a network whose topology is captured by a directed graph (i.e., asymmetric communication). We cast the problem into the ADMM setting, via a consensus…

We study the algebraic connectivity for several classes of random semi-regular graphs. For large random semi-regular bipartite graphs, we explicitly compute both their algebraic connectivity and as well as the full spectrum distribution.…

We generalize the notion of semi-normalized classes of systems of differential equations, study properties of such classes and extend the algebraic method of group classification to them. In particular, we prove the important theorems on…

Using only basic topological properties of real algebraic sets and regular morphisms we show that any injective regular self-mapping of a real algebraic set is surjective. Then we show that injective morphisms between germs of real…

In this paper, we consider a new scalarization function for set-valued maps. As the main goal, by using this scalarization function, we obtain some Weierstrass-type theorems for the noncontinuous set optimization problems via the coercivity…

We study the affine variety $L_{n}(\mathfrak{g})$ of Lie algebra representations, the collection of all homomorphisms from an arbitrary $n$-dimensional Lie algebra into a fixed real semi-simple Lie algebra $\mathfrak{g}$. Using techniques…

Geometric semigroup theory is the systematic investigation of finitely-generated semigroups using the topology and geometry of their associated automata. In this article we show how a number of easily-defined expansions on finite semigroups…

A wider selection of step sizes is explored for the distributed subgradient algorithm for multi-agent optimization problems, for both time-invariant and time-varying communication topologies. The square summable requirement of the step…

Graph-based methods play an important role in unsupervised and semi-supervised learning tasks by taking into account the underlying geometry of the data set. In this paper, we consider a statistical setting for semi-supervised learning and…

A graph-based classification method is proposed for semi-supervised learning in the case of Euclidean data and for classification in the case of graph data. Our manifold learning technique is based on a convex optimization problem involving…

Consider the problem of minimizing a lower semi-continuous semi-algebraic function $f \colon \mathbb{R}^n \to \mathbb{R} \cup \{+\infty\}$ on an unbounded closed semi-algebraic set $S \subset \mathbb{R}^n.$ Employing adequate tools of…

This article considers a class of disordered mean-field combinatorial optimization problems. We focus on the Gibbs measure, where the inverse temperature does not vary with the size of the graph and the edge weights are sampled from a…

In this paper we prove the strong Sard conjecture for sub-Riemannian structures on 3-dimensional analytic manifolds. More precisely, given a totally nonholonomic analytic distribution of rank 2 on a 3-dimensional analytic manifold, we…

We present a method for nonlinear parametric optimization based on algebraic geometry. The problem to be studied, which arises in optimal control, is to minimize a polynomial function with parameters subject to semialgebraic constraints.…