Related papers: Critical Topology for Optimization on the Symplect…
We introduce multiple symmetric LP relaxations for minimum cut problems. The relaxations give optimal and approximate solutions when the input is a Hamiltonian cycle. We show that this leads to one of two interesting results. In one case,…
The paper aims at the development of an apparatus for analysis and construction of near optimal solutions of singularly perturbed (SP) optimal controls problems (that is, problems of optimal control of SP systems) considered on the infinite…
The concentration compactness framework for semilinear elliptic equations without compactness, set originally by P.-L.Lions for constrained minimization in the case of homogeneous nonlinearity, is extended here to the case of general…
This paper considers a stochastic optimization problem over the fixed point sets of quasinonexpansive mappings on Riemannian manifolds. The problem enables us to consider Riemannian hierarchical optimization problems over complicated sets,…
We introduce a novel method for solving density-based topology optimization problems: Sigmoidal Mirror descent with a Projected Latent variable (SiMPL). The SiMPL method (pronounced as ``the simple method'') optimizes a design using only…
For any real-analytic hypersurface M in complex euclidean space of dimension >= 2 which does not contain any complex-analytic subvariety of positive dimension, we show that for every point p in M the local real-analytic CR automorphisms of…
Centrality measures characterize important nodes in networks. Efficiently computing such nodes has received a lot of attention. When considering the generalization of computing central groups of nodes, challenging optimization problems…
We propose two practical non-convex approaches for learning near-isometric, linear embeddings of finite sets of data points. Given a set of training points $\mathcal{X}$, we consider the secant set $S(\mathcal{X})$ that consists of all…
We study when co-evolving (or adaptive) higher-order networks defined on directed hypergraphs admit a simplicial description. Binary and triadic couplings are modelled by time-dependent weight tensors. Using representation theory of the…
Global optimality analysis in sub-Riemannian problem on the Lie group SH(2) is considered. We cutout open dense domains in the preimage and in the image of the exponential mapping based on the description of Maxwell strata. We then prove…
The Stacker Crane Problem (SCP) is a variant of the Traveling Salesman Problem. In SCP, pairs of pickup and delivery points are designated on a graph, and a crane must visit these points to move objects from each pickup location to its…
We investigate the universality of multi-spin systems in architectures of various symmetries of coupling type and topology. Explicit reachability sets under symmetry constraints are provided. Thus for a given (possibly symmetric)…
Study about theory and algorithms for constrained optimization usually assumes that the feasible region of the optimization problem is nonempty. However, there are many important practical optimization problems whose feasible regions are…
The work explores a specific scenario for structural computational optimization based on the following elements: (a) a relaxed optimization setting considering the ersatz (bi-material) approximation, (b) a treatment based on a nonsmoothed…
In this paper, we propose control theoretic smoothing splines with L1 optimality for reducing the number of parameters that describes the fitted curve as well as removing outlier data. A control theoretic spline is a smoothing spline that…
Many recent problems in signal processing and machine learning such as compressed sensing, image restoration, matrix/tensor recovery, and non-negative matrix factorization can be cast as constrained optimization. Projected gradient descent…
The aim of this paper is the geometric study of the symplectic operators which are a perturbation of the identity by a Hilbert-Schmidt operator. This subgroup of the symplectic group was introduced in Pierre de la Harpe's classical book of…
Finding a Maximum Clique is a classic property test from graph theory; find any one of the largest complete subgraphs in an Erd\"os-R\'enyi G(N, p) random graph. We use Maximum Clique to explore the structure of the problem as a function of…
The existence of singularities in the spectrum of non-Hermitian Hamiltonians leads to a non-trivial spectral topology which can be exploited to generate topological operations. However, their implementation has remained elusive due to the…
In this paper, we study simple splines on a Riemannian manifold $Q$ from the point of view of the Pontryagin maximum principle (PMP) in optimal control theory. The control problem consists in finding smooth curves matching two given tangent…