Zobrazeno 1 - 10
of 427
pro vyhledávání: '"Dai, Yu‐Hong"'
Autor:
Zhang, Wei-Yang, Dong, Feng-Lian, Wei, Zhi-Wei, Wang, Yan-Ru, Xu, Ze-Jin, Chen, Wei-Kun, Dai, Yu-Hong
The distributed recursion (DR) algorithm is an effective method for solving the pooling problem that arises in many applications. It is based on the well-known P-formulation of the pooling problem, which involves the flow and quality variables; and i
Externí odkaz:
http://arxiv.org/abs/2411.09554
In this paper, we consider the network slicing (NS) problem which attempts to map multiple customized virtual network requests (also called services) to a common shared network infrastructure and manage network resources to meet diverse quality of se
Externí odkaz:
http://arxiv.org/abs/2409.13943
This paper considers the generalized maximal covering location problem (GMCLP) which establishes a fixed number of facilities to maximize the weighted sum of the covered customers, allowing customers' weights to be positive or negative. The GMCLP can
Externí odkaz:
http://arxiv.org/abs/2409.09834
Bilevel optimization problems, encountered in fields such as economics, engineering, and machine learning, pose significant computational challenges due to their hierarchical structure and constraints at both upper and lower levels. Traditional gradi
Externí odkaz:
http://arxiv.org/abs/2408.09661
We consider the chance-constrained program (CCP) with random right-hand side under a finite discrete distribution. It is known that the standard mixed integer linear programming (MILP) reformulation of the CCP is generally difficult to solve by gener
Externí odkaz:
http://arxiv.org/abs/2406.10472
In the paper, we consider the competitive facility location problem with limited choice rule (CFLPLCR), which attempts to open a subset of facilities to maximize the net profit of a newcomer company, requiring customers to patronize only a limited nu
Externí odkaz:
http://arxiv.org/abs/2406.05775
This paper is devoted to studying the stability properties of the Karush-Kuhn-Tucker (KKT) solution mapping $S_{\rm KKT}$ for Nash equilibrium problems (NEPs) with canonical perturbations. Firstly, we obtain an exact characterization of the strong re
Externí odkaz:
http://arxiv.org/abs/2405.11266
The linearized Bregman iterations (LBreI) and its variants are powerful tools for finding sparse or low-rank solutions to underdetermined linear systems. In this study, we propose a cut-and-project perspective for the linearized Bregman method via a
Externí odkaz:
http://arxiv.org/abs/2404.09776
This paper presents a stochastic approximation proximal subgradient (SAPS) method for stochastic convex-concave minimax optimization. By accessing unbiased and variance bounded approximate subgradients, we show that this algorithm exhibits ${\rm O}(N
Externí odkaz:
http://arxiv.org/abs/2403.20205
In this paper, we investigate the probabilistic set covering problems (PSCP) in which the right-hand side is a random vector {\xi} and the covering constraint is required to be satisfied with a prespecified probability. We consider the case arising f
Externí odkaz:
http://arxiv.org/abs/2402.18795