相关论文: Isolated calmness and sharp minima via H\"older gr…

Extracting structured subgraphs inside large graphs - often known as the planted subgraph problem - is a fundamental question that arises in a range of application domains. This problem is NP-hard in general, and as a result, significant…

In this work we address graph based semi-supervised learning using the theory of the spatial segregation of competitive systems. First, we define a discrete counterpart over connected graphs by using direct analogue of the corresponding…

Accelerated gradient descent iterations are widely used in optimization. It is known that, in the continuous-time limit, these iterations converge to a second-order differential equation which we refer to as the accelerated gradient flow.…

We consider a monotone submodular maximization problem whose constraint is described by a logic formula on a graph. Formally, we prove the following three `algorithmic metatheorems.' (1) If the constraint is specified by a monadic…

The definition of edge-regularity in graphs is a relaxation of the definition of strong regularity, so strongly regular graphs are edge-regular and, not surprisingly, the family of edge-regular graphs is much larger and more diverse than…

We develop two adaptive discretization algorithms for convex semi-infinite optimization, which terminate after finitely many iterations at approximate solutions of arbitrary precision. In particular, they terminate at a feasible point of…

Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank r,…

In this paper, we develop new continuous and discrete relaxations for nonlinear expressions in an MINLP. In contrast to factorable programming, our techniques utilize the inner-function structure by encapsulating it in a polyhedral set,…

We present algorithms to classify isolated hypersurface singularities over the real numbers according to the classification by V.I. Arnold (Arnold et al., 1985). This first part covers the splitting lemma and the simple singularities; a…

This paper provides new summation inequalities in both single and double forms to be used in stability analysis of discrete-time systems with time-varying delays. The potential capability of the newly derived inequalities is demonstrated by…

This paper concerns the quasilinear subelliptic function derived from H\"ormander vector fields. Based on the significant work of J. Serrin in \cite{SER}, M. Meier in \cite{MM1}, and L. Capogna, D. Danielli and N. Garofalo in…

This paper concerns a first-order algorithmic technique for a class of optimal control problems defined on switched-mode hybrid systems. The salient feature of the algorithm is that it avoids the computation of Fr\'echet or G\^ateaux…

In this work, we give a new technique for analyzing individualized privacy accounting via the following simple observation: if an algorithm is one-sided add-DP, then its subsampled variant satisfies two-sided DP. From this, we obtain…

This survey concerns regular graphs that are extremal with respect to the number of independent sets, and more generally, graph homomorphisms. More precisely, in the family of of $d$-regular graphs, which graph $G$ maximizes/minimizes the…

We study gradient descent under linearly correlated noise. Our work is motivated by recent practical methods for optimization with differential privacy (DP), such as DP-FTRL, which achieve strong performance in settings where privacy…

A new relaxed variant of interior point method for low-rank semidefinite programming problems is proposed in this paper. The method is a step outside of the usual interior point framework. In anticipation to converging to a low-rank primal…

This paper is concerned with the minimisation of peak stresses occurring in linear elasticity. We propose to minimise the maximal von Mises stress of the elastic body. This leads to a nonsmooth shape functional. We derive the shape…

The limited penetrable horizontal visibility graph algorithm was recently introduced to map time series in complex networks. We extend this visibility graph and create a directed limited penetrable horizontal visibility graph and an image…

In this paper we study the following problem. Let $A$ be a fixed graph, and let $\hom(G,A)$ denote the number of homomorphisms from a graph $G$ to $A$. Furthermore, let $v(G)$ denote the number of vertices of $G$, and let $\mathcal{G}_d$…

In this paper, we give a sharp sparse domination of pseudodifferential operators associated with symbols belonging to the H\"{o}rmander class, and fundamental solutions of dispersive equations. Furthermore, we give boundedness results of…