相关论文: The weighted horizontal linear complementarity pro…

We introduce a method for solving Calder\'on type inverse problems for semilinear equations with power type nonlinearities. The method is based on higher order linearizations, and it allows one to solve inverse problems for certain…

We prove the well posedness in weighted Sobolev spaces of certain linear and nonlinear elliptic boundary value problems posed on convex domains and under singular forcing. It is assumed that the weights belong to the Muckenhoupt class $A_p$…

The $L_p$-Christoffel-Minkowski problem and the prescribed $L_p$-Weingarten curvature problem for convex hypersurfaces in Euclidean space are important problems in geometric analysis. In this paper, we consider their counterparts in…

In this paper, we establish a new approach to solve the tensor complementarity problem (TCP). A mixed integer programming model is given and the TCP is solved by solving the model. The TCP is shown to be formulated as an equivalent mixed…

Let us consider a parametric weighted directed graph in which every arc $(j,i)$ has weight of the form $w((j,i))=\max(P_{ij}+\lambda,I_{ij}-\lambda,C_{ij})$, where $\lambda$ is a real parameter and $P$, $I$ and $C$ are arbitrary square…

This paper is concerned with a covering problem of Euclidean space by a particular arrangement of cones that are not necessarily full and are allowed to overlap. The problem provides an equivalent geometric reformulation of the solvability…

A fixed-time stable dynamical system for solving the extended vertical linear complementarity problem (EVLCP) is developed. The system is based on the reformulation of EVLCP as a special case of a new kind of generalized absolute value…

We study the generalized multidimensional bin packing problem (GVBP) that generalizes both geometric packing and vector packing. Here, we are given $n$ rectangular items where the $i^{\textrm{th}}$ item has width $w(i)$, height $h(i)$, and…

Let $\mathcal{H}$ be a Hilbert space, $L(\mathcal{H})$ the algebra of bounded linear operators on $\mathcal{H}$ and $W \in L(\mathcal{H})$ a positive operator such that $W^{1/2}$ is in the p-Schatten class, for some $1 \leq p< \infty.$…

Intertwining analysis, algebra, numerical analysis and optimization, computing conjugate co-gradients of real-valued quotients gives rise to eigenvalue problems. In the linear Hermitian case, by inspecting optimal quotients in terms of…

We study a geometric hitting-set problem in which the input consists of a set $P$ of weighted points and a family $S=H\cup V$ of axis-parallel segments in the plane. The goal is to select a minimum-weight subset of $P$ that hits every…

A null vector is an algebraic quantity with square equal to zero. I denote the universal algebra generated by taking all sums and products of null vectors over the real or complex numbers by N. The rules of addition and multiplication in N…

Based on smoothing techniques, we propose two new methods to solve linear complementarity problems (LCP) called TLCP and Soft-Max. The idea of these two new methods takes inspiration from interior-point methods in optimization. The…

Generalized Nash equilibrium problems (GNEPs) arise in various applications where multiple players minimize individual cost functions subject to coupled constraints. A relatively unexplored approach to solving such problems is via a…

A popular approach for addressing uncertainty in variational inequality problems is by solving the expected residual minimization (ERM) problem. This avenue necessitates distributional information associated with the uncertainty and…

In this paper, we introduce two parabolic target-space interior-point algorithms for solving monotone linear complementarity problems. The first algorithm is based on a universal tangent direction, which has been recently proposed for…

Multiple orthogonal polynomials are a generalization of orthogonal polynomials in which the orthogonality is distributed among a number of orthogonality weights. They appear in random matrix theory in the form of special determinantal point…

We consider the problem of learning a linear subspace from data corrupted by outliers. Classical approaches are typically designed for the case in which the subspace dimension is small relative to the ambient dimension. Our approach works…

Connectivity augmentation problems are among the most elementary questions in Network Design. Many of these problems admit natural $2$-approximation algorithms, often through various classic techniques, whereas it remains open whether…

The paper aims to show the equivalency between nonlinear complementarity problem and the system of nonlinear equations. We propose a homotopy method with vector parameter $\lambda$ in finding the solution of nonlinear complementarity…