Related papers: Structured condition numbers for a linear function…
Generalized equations are problems emerging in contexts of modern variational analysis as an adequate formalism to treat such issues as constraint systems, optimality and equilibrium conditions, variational inequalities, differential…
Sum-rank-metric codes have wide applications in universal error correction, multishot network coding, space-time coding and the construction of partial-MDS codes for repair in distributed storage. Fundamental properties of sum-rank-metric…
We present a version of Krasnosel'skii fixed point theorem for operators acting on Cartesian products of normed linear spaces, under cone-compression and cone-expansion conditions of norm type. Our approach, based on the fixed point index…
The Constraint Satisfaction Problem (CSP) is ubiquitous in various areas of mathematics and computer science. Many of its variations have been studied including the Counting CSP, where the goal is to find the number of solutions to a CSP…
Developments in numerical methods for problems governed by nonlinear partial differential equations underpin simulations with sound arguments in diverse areas of science and engineering. In this paper, we explore the regularization method…
Constraint satisfaction problems (CSPs) consist of a set of variables taking values from some finite domain and a set of local constraints on these variables. The objective is to find an assignment to the variables that maximizes the…
This paper pursues a twofold goal. First, we introduce and study in detail a new notion of variational analysis called generalized metric subregularity, which is a far-going extension of the conventional metric subregularity conditions. Our…
The generalized winding number (GWN) is a scalar field that supports robust containment queries on curved geometry, including non-watertight, overlapping, and nested boundary representations. While queries can be easily parallelized over…
This paper studies the properties of d-stationary points of the trimmed lasso (Luo et al., 2013, Huang et al., 2015, and Gotoh et al., 2018) and the composite optimization problem with the truncated nuclear norm (Gao and Sun, 2010, and…
Cross-modal metric learning is a prominent research topic that bridges the semantic heterogeneity between vision and language. Existing methods frequently utilize simple cosine or complex distance metrics to transform the pairwise features…
In this paper, we derive new model formulations for computing generalized singular values of a Grassman matrix pair. These new formulations make use of truncated filter matrices to locate the $i$-th generalized singular value of a Grassman…
Literature on Constraint Satisfaction exhibits the definition of several structural properties that can be possessed by CSPs, like (in)consistency, substitutability or interchangeability. Current tools for constraint solving typically…
We provide a framework for generic 4D conformal bootstrap computations. It is based on the unification of two independent approaches, the covariant (embedding) formalism and the non-covariant (conformal frame) formalism. We construct their…
For the singular saddle-point problems with nonsymmetric positive definite $(1,1)$ block, we present a general constraint preconditioning (GCP) iteration method based on a singular constraint preconditioner. Using the properties of the…
The constraint satisfaction problem (CSP) is a general problem central to computer science and artificial intelligence. Although the CSP is NP-hard in general, considerable effort has been spent on identifying tractable subclasses. The main…
Normal form theory is developed deeply for planar smooth systems but has few results for piecewise-smooth systems because difficulties arise from continuity of the near-identity transformation, which is constructed piecewise. In this paper,…
This paper addresses the optimization problem of minimizing non-convex continuous functions, which is relevant in the context of high-dimensional machine learning applications characterized by over-parametrization. We analyze a randomized…
The discretization of robust quadratic optimal control problems under uncertainty using the finite element method and the stochastic collocation method leads to large saddle-point systems, which are fully coupled across the random…
The subject of Chapter 1 is GKK $\tau$-matrices and related topics. Chapter 2 is devoted to boundedly invertible collections of matrices, with applications to operator norms and spline approximation. Various structured matrices (Toeplitz,…
In this paper, we extend the inexact Uzawa algorithm in [Q. Hu, J. Zou, SIAM J. Matrix Anal., 23(2001), pp. 317-338] to the nonsymmetric generalized saddle point problem. The techniques used here are similar to those in [Bramble \emph{et…