中文
相关论文

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

200 篇论文

To the best of our knowledge, since the extended horizontal linear complementarity problem (EHLCP) was first introduced and studied by Kaneko in 1977, no iterative methods or error analysis have been developed for it due to the…

数值分析 · 数学 2025-09-19 Shi-Liang Wu , Cui-Xia Li

In this paper, we discuss the perturbation analysis of the extended vertical linear complementarity problem (EVLCP). Under the assumption of the row $\mathcal{W}$-property, several absolute and relative perturbation bounds of EVLCP are…

数值分析 · 数学 2022-10-05 Shiliang Wu , Wen Li , Hehui Wang

We present a new interior-point potential-reduction algorithm for solving monotone linear complementarity problems (LCPs) that have a particular special structure: their matrix $M\in{\mathbb R}^{n\times n}$ can be decomposed as $M=\Phi U +…

机器学习 · 计算机科学 2013-01-01 Geoffrey J. Gordon

In this work, we study the parallel complexity of the Euclidean minimum-weight perfect matching (EWPM) problem. Here our graph is the complete bipartite graph $G$ on two sets of points $A$ and $B$ in $\mathbb{R}^2$ and the weight of each…

计算几何 · 计算机科学 2024-05-30 Sujoy Bhore , Sarfaraz Equbal , Rohit Gurjar

We consider existence and uniqueness properties of a solution to homogeneous cone complementarity problem (HCCP). Employing the $T$-algebraic characterization of homogeneous cones, we generalize the $P, P_0, R_0$ properties for a nonlinear…

最优化与控制 · 数学 2010-11-15 Lingchen Kong , Levent Tunçel , Naihua Xiu

The linear complementarity problem is a continuous optimization problem that generalizes convex quadratic programming, Nash equilibria of bimatrix games and several such problems. This paper presents a continuous optimization formulation…

离散数学 · 计算机科学 2018-10-19 Parthe Pandit , Ankur A. Kulkarni

The linear complementarity problem (LCP) is a general set membership problem that includes quadratic cone programming as a special case. In this work we consider a homogeneous embedding of the LCP, which encodes both the optimality…

最优化与控制 · 数学 2021-06-15 Brendan O'Donoghue

The Weighted Vertex Integrity (wVI) problem takes as input an $n$-vertex graph $G$, a weight function $w:V(G)\to\mathbb{N}$, and an integer $p$. The task is to decide if there exists a set $X\subseteq V(G)$ such that the weight of $X$ plus…

数据结构与算法 · 计算机科学 2014-12-05 Pål Grønås Drange , Markus Sortland Dregi , Pim van 't Hof

The matching problem for a given Jordan curve in the complex plane asks to find two nonconstant functions, one analytic in the bounded complementary component of the curve and the other analytic in the unbounded complementary component of…

复变函数 · 数学 2025-07-08 Kirill Lazebnik , Pierre-Olivier Parisé , Malik Younsi

Given a polynomial map f on the Euclidean n-space and a vector q, the polynomial complementarity problem, PCP(f,q), is the nonlinear complementarity problem of finding a nonnegative vector x such that y=f(x)+q is nonnegative and orthogonal…

最优化与控制 · 数学 2016-09-20 M. Seetharama Gowda

In this paper, we introduce a unified framework of Tensor Higher-Degree Eigenvalue Complementarity Problem (THDEiCP), which goes beyond the framework of the typical Quadratic Eigenvalue Complementarity Problem (QEiCP) for matrices. First,…

最优化与控制 · 数学 2015-07-15 Chen Ling , Hongjin He , Liqun Qi

This paper investigates the convexity of the solution set of the linear complementarity problems over tensor spaces (TLCPs). We introduce the notion of a $T$-column sufficient tensor and study its properties and relationships with several…

最优化与控制 · 数学 2026-04-03 Sonali Sharma , V. Vetrivel , Jein-Shan Chen

Let $G$ be a complete edge-weighted graph on $n$ vertices. To each subset of vertices of $G$ assign the cost of the minimum spanning tree of the subset as its weight. Suppose that $n$ is a multiple of some fixed positive integer $k$. The…

We develop an FPT algorithm and a bi-kernel for the Weighted Edge Clique Partition (WECP) problem, where a graph with $n$ vertices and integer edge weights is given together with an integer $k$, and the aim is to find $k$ cliques, such that…

数据结构与算法 · 计算机科学 2020-05-21 Andreas Emil Feldmann , Davis Issac , Ashutosh Rai

Given complex numbers $w_1, \ldots, w_n$, we define the weight $w(X)$ of a set $X$ of 0-1 vectors as the sum of $w_1^{x_1} \cdots w_n^{x_n}$ over all vectors $(x_1, \ldots, x_n)$ in $X$. We present an algorithm, which for a set $X$ defined…

组合数学 · 数学 2019-08-15 Alexander Barvinok , Guus Regts

In this paper, we consider the {\it generalized polynomial complementarity problem} (GPCP), which covers the recently introduced {\it polynomial complementarity problem} (PCP) and the well studied {\it tensor complementarity problem} (TCP)…

最优化与控制 · 数学 2019-05-03 Liyun Ling , Chen Ling , Hongjin He

Given two matroids $\mathcal{M}_1$ and $\mathcal{M}_2$ over the same ground set, the matroid intersection problem is to find the maximum cardinality common independent set. In the weighted version of the problem, the goal is to find a…

数据结构与算法 · 计算机科学 2026-02-18 Aditi Dudeja , Mara Grilnberger

We introduce the complete lifts of maps between (real and complex) Euclidean spaces and study their properties concerning holomorphicity, harmonicity and horizontal weakly conformality. As applications, we are able to use this concept to…

dg-ga · 数学 2008-02-03 Ye-lin Ou

For a {\em simple Euclidean Jordan algebra}, let $\mathfrak{co}$ be its conformal algebra, $\mathscr P$ be the manifold consisting of its semi-positive rank-one elements, $C^\infty(\mathscr P)$ be the space of complex-valued smooth…

数学物理 · 物理学 2011-11-18 Guowu Meng

In this paper, we mainly focus on the existence and uniqueness of the vertical tensor complementarity problem. Firstly, combining the generalized-order linear complementarity problem with the tensor complementarity problem, the vertical…

最优化与控制 · 数学 2022-12-05 Li-Ming Li , Shi-Liang Wu
‹ 上一页 1 2 3 10 下一页 ›