Related papers: Structured condition numbers for a linear function…
This paper concerns the generalized Nash equilibrium problem of polynomials (GNEPP). We apply the Gauss-Seidel method and Lasserre type Moment-SOS relaxations to solve GNEPPs. The convergence of the Gauss-Seidel method is known for some…
We establish the existence of at least one solution to a system of two semilinear coupled Poisson equations with asymptotically linear nonlinearities, without imposing the Ambrosetti-Rabinowitz condition or any of its refinements. The proof…
This paper studies the Craig variant of the Golub-Kahan bidiagonalization algorithm as an iterative solver for linear systems with saddle point structure. Such symmetric indefinite systems in 2x2 block form arise in many applications, but…
Graph neural networks (GNNs) have emerged as a powerful tool for solving combinatorial optimization problems (COPs), exhibiting state-of-the-art performance in both graph-structured and non-graph-structured domains. However, existing…
Any satisfiability problem in conjunctive normal form can be solved in polynomial time by reducing it to a 3-sat formulation and transforming this to a Linear Complementarity problem (LCP) which is then solved as a linear program (LP). Any…
In text-to-SQL tasks -- as in much of NLP -- compositional generalization is a major challenge: neural networks struggle with compositional generalization where training and test distributions differ. However, most recent attempts to…
We propose the formulation of convex Generalized Disjunctive Programming (GDP) problems using conic inequalities leading to conic GDP problems. We then show the reformulation of conic GDPs into Mixed-Integer Conic Programming (MICP)…
We introduce a structured approach to the construction of linear BGK-type collision operators ensuring that the resulting Lattice-Boltzmann methods are stable with respect to a weighted $L^2$-norm. The results hold for particular boundary…
In recent years more and more involved block structures appeared in the literature in the context of numerical approximations of complex infinite dimensional operators modeling real-world applications. In various settings, thanks the theory…
In this paper we consider general rank minimization problems with rank appearing in either objective function or constraint. We first establish that a class of special rank minimization problems has closed-form solutions. Using this result,…
Structured output prediction aims to learn a predictor to predict a structured output from a input data vector. The structured outputs include vector, tree, sequence, etc. We usually assume that we have a training set of input-output pairs…
In this paper, we study two general classes of optimization algorithms for kernel methods with convex loss function and quadratic norm regularization, and analyze their convergence. The first approach, based on fixed-point iterations, is…
In this paper, we introduce a generalized notion of monotone property and prove some results regarding existence and uniqueness of multi-tupled fixed points for nonlinear contraction mappings satisfying monotone property in ordered complete…
In this paper, we present an algorithm for stability analysis of systems described by coupled linear Partial Differential Equations (PDEs) with constant coefficients and mixed boundary conditions. Our approach uses positive matrices to…
In this paper, we introduce structured sparsity estimators in Generalized Linear Models. Structured sparsity estimators in the least squares loss are introduced by Stucky and van de Geer (2018) recently for fixed design and normal errors.…
The generalized Golub-Kahan bidiagonalization has been used to solve saddle-point systems where the leading block is symmetric and positive definite. We extend this iterative method for the case where the symmetry condition no longer holds.…
The knapsack problem (KP) is a very famous NP-hard problem in combinatorial optimization. Also its generalization to multiple dimensions named d-dimensional knapsack problem (d-KP) and to multiple knapsacks named multiple knapsack problem…
We study central configurations when the set of positions is symmetric. We use a theorem from representation theory of finite groups to explore the symmetry properties of equations for central configurations. This approach simplifies…
We present new convergence estimates for the iterated penalty method applied to structure-preserving discretizations of linear generalized saddle point systems. The method may be viewed as an Uzawa iteration on an augmented Lagrangian…
This paper aims to establish counterparts of fundamental regularity statements for solutions to elliptic equations in the setting of low-dimensional structures such as, for instance, glued manifolds or CW-complexes. The main result proves…