检索结果-内蒙古大学图书馆

SDP-based Benders decomposition for solving p-median quadratic facility location problems

COMPUTERS & OPERATIONS RESEARCH 2025年 182卷

作者： Yang, Yingying Bui, Hoa T. Loxton, Ryan Curtin Univ ARC Ctr Transforming Maintenance Data Sci Perth Australia Curtin Univ Curtin Ctr Optimisat & Decis Sci Perth Australia

The p-median facility location problem involves selecting the locations for p facilities from a set of potential locations, to balance the trade-off between facility establishment costs and distance to end users. In this paper, we introduce an extension, named the p-median quadratic facility location problem, that also considers inter-facility distance-important in applications where the facilities serve as intermediate hubs linking sites in different regions. This creates a quadratic term in the objective that makes the problem nonlinear. We develop a Benders decomposition method that uses a tight semi-definite programming relaxation of the Benders master problem, instead of solving the nonlinear master problem directly. We incorporate this decomposition strategy into a branch and bound framework to ensure convergence. Our numerical results show that this method outperforms the linear reformulation and classical Benders decomposition techniques, working independently or in tandem.

关键词： Facility location problem Binary quadratic programming Benders decomposition semi-definite programming

来源：评论

学校读者我要写书评

暂无评论

Transparent RIS: Wireless Coverage Enhancement via Region-Oriented Passive Beamforming

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2024年第10期23卷 13796-13811页

作者： Wang, Jue Hu, Yingdong Xu, Yicheng Li, Ye Gao, Ruifeng Zhang, Jun Han, Yu Jin, Shi Nantong Univ Sch Informat Sci & Technol Nantong 226019 Peoples R China Nantong Res Inst Adv Commun Technol Nantong 226019 Peoples R China Nantong Univ Sch Transportat & Civil Engn Nantong 226019 Peoples R China Nanjing Univ Posts & Telecommun Jiangsu Key Lab Wireless Commun Nanjing 210003 Peoples R China Southeast Univ Natl Mobile Commun Res Lab Nanjing 210096 Peoples R China

We investigate a new deployment form of reflective intelligent surface (RIS), which aims at enhancing the quality of service of a main communication system in a target region, while without the need of changing its transmission protocol and scheme (i.e., the RIS is "transparent" to the main system). To this end, we mathematically formulate a coverage enhancement problem, where a RIS is used transparently in the sense that the BS can be unaware of its existence, while the minimum channel link strength, measured from every BS antenna to any point in the target region, can be maximized. The formulated problem is non-convex with mixed discrete-continuous variables. To tackle this challenge, we recast it into a convex feasibility problem via spatial sampling and semi-definite relaxation. Based on a derived analytical upper bound on the link strength difference between any two location points, we further characterize the coverage-similarity region of a given location, and accordingly propose an improved spatial sampling scheme for efficient implementation. Simulation results show that the proposed transparent RIS design achieves better coverage performance than benchmark schemes. More importantly, it can effectively improve the communication performance without affecting the transmission scheme originally adopted by the main communication system.

关键词： Wireless communication Microprocessors Computer architecture Antenna measurements Array signal processing Antenna arrays Signal to noise ratio Reflective intelligent surface coverage enhancement spatial sampling semi-definite programming

来源：评论

学校读者我要写书评

暂无评论

Multi-dimensional Scaling from K-Nearest Neighbourhood Distances

引用

JOURNAL OF SCIENTIFIC COMPUTING 2024年第1期101卷 19页

作者： Du, Wenjian Li, Jia Sun Yat Sen Univ Sch Math 135 Xingang West Rd Guangzhou 510275 Peoples R China

Multi-dimensional scaling (MDS) with incomplete distance information represents a significant challenging inverse problem in computational geometry. This technique finds expensive applications in the fields of surface, manifold, and cubicle reconstructions, and is also relevant in the context of social networks. While a majority of existing methodologies tend to provide accurate results primarily when the missing distance indices are chosen randomly or when the omission rate is below 50%, our research proposes an innovative approach. We present a robust MDS framework when distances to the k-nearest neighbors (kNN) are known, even in situations characterized by a high coherence of missing indices. Our proposed strategy starts with a local reconstruction phase based on local correlation. Subsequently, the global reconstruction phase is realized through two distinct models: one based on low-rank semi-definite programming (SDP) and the other rooted in a model utilizing the Frobenius norm. Throughout the global reconstruction, we incorporate the alternating direction method of multipliers (ADMM) and the Riemann gradient descent algorithm (RGrad). Numerical Simulations have demonstrated that for MDS from kNN distances, our proposed model and algorithm outperforms the existed SDP models in terms of the visual effect and error of Gram matrix. We further validate that our approach can reconstruct surfaces from as mere as 1% of kNN distances, which shows that the proposed model is robust to the high coherence of missing indices. Additionally, we propose another MDS model which is applicable from kNN distances with additive noise.

关键词： Multidimensional scaling K-nearest neighborhood Low-rank matrix completion semi-definite programming

来源：评论

学校读者我要写书评

暂无评论

Hybrid distributed online and alternating convex optimization-based initial value accelerated hybrid precoding for millimeter wave multiple-input-multiple-output

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 2024年第3期37卷 e5660-e5660页

作者： Kadiyala, Ragodaya Deepthi Kakarla, Deepti Chikyal, Neetu Vasavi Coll Engn A Dept Elect & Commun Engn Hyderabad Telangana India Vasavi Coll Engn A Dept Elect & Commun Engn Hyderabad 500089 Telangana India

The hybrid precoding problem is considered a Frobenius norm reduction problem for the narrowband channel in a millimeter wave (mmWave) with multiple inputs and outputs (mmWave MIMO). This work proposes a hybrid distributed online and alternating convex optimization (HDO-ACO) algorithm to improve hybrid precoding (HP), interpreted as a trace minimization problem. HDO-ACO alternately determines the digital and analog precoders to reduce the trace by keeping the other constant. Initially, HDO-ACO uses Lagrange's method to determine the digital precoding subproblem. Then, it uses the integrated distributed online convex optimization and alternating minimization algorithm in the analog precoder design. In the HP method, the digital and analog precoders are iteratively updated until the highest number of iterations or convergence is reached. But this hybrid precoding method requires an initial analog precoding matrix input to begin the iteration. The algorithms converge gradually and fall into a suboptimal solution when the initial analog precoding matrix is set randomly. Hence, an initial value acceleration-based heuristic approach is used in the HDO-ACO alternating minimization algorithm that calculates the initial feasible value of an alternating minimization method using channel conditions. The simulation results of the proposed HDO-ACO algorithm are presented under bit error rate (BER), spectral efficiency (SE), and convergence behavior by comparing it with modified block coordinate descent-HP (MBCD-HP), manifold optimization-alternating minimization (MO-AltMin), and semi-definite relaxation-based alternating optimization (SDR-AO). The proposed HDO-ACO attains maximum SE and less BER than other hyper-precoding designs. A new hybrid distributed online and alternating convex optimization (HDO-ACO) algorithm is proposed to solve the problem of hybrid precoding (HP) by interpreting it as a trace minimization problem. The digital and analog decoding problems are solved us

关键词： convex optimization algorithm Hermitian matrix initial value acceleration Lagrangian method semi-definite programming

来源：评论

学校读者我要写书评

暂无评论

Cooperative Positioning of Wireless Networks in Complex Propagation Environments

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2024年第10期42卷 2877-2889页

作者： Jiang, Peiyue Gu, Xiaobo Zhou, Haibo Guangdong Univ Technol Sch Integrated Circuits Guangzhou 510006 Peoples R China Nanjing Univ Sch Elect Sci & Engn Nanjing 210008 Peoples R China

Cooperative positioning in wireless networks has attracted great attention in recent years, as many applications require the exact location of all member nodes. The pairwise distance between the member nodes is conventionally constructed as an Euclidean Distance Matrix (EDM) for subsequent location estimation. In this paper, we address the problem of cooperative positioning in complex propagation environments, which results in an incomplete EDM. We proposed an improved EDM recovery algorithm based on low tank matrix completion (LRMC), which makes use of the sensor correlation by Laplacian and trace minimization. In addition, we derive a semi-definite relaxation estimator to localize the unknown sensors. Simulations are conducted to evaluate the performance of the proposed algorithm and the results show that the proposed method outperforms existing ones in both matrix completion and positioning accuracy.

关键词： Distance measurement Correlation Wireless sensor networks Signal processing algorithms Position measurement Minimization Accuracy Cooperative positioning graph Laplacian low rank matrix completion manifold learning semi-definite programming

来源：评论

学校读者我要写书评

暂无评论

Enhancing MISO-NOMA Networks via Constructive Interference Precoding

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2024年第1期72卷 510-523页

作者： Wang, Wei Duan, Lingjie Liu, Xin Zhao, Nan Dalian Univ Technol Sch Informat & Commun Engn Dalian 116024 Peoples R China Singapore Univ Technol & Design SUTD Engn Syst & Design Pillar Singapore 487372 Singapore

As a symbol-level precoding scheme, constructive interference precoding (CIP) has been demonstrated its superiority in multi-antenna orthogonal multiple access (OMA). By utilizing both the channel state information (CSI) and data symbols, harmful multi-user interference can be converted into useful reception power via the well-designed CIP. When CIP meets non-orthogonal multiple access (NOMA) whose bottleneck is usually at the weaker user, this paper is the first to propose CIP to enhance the downlink MISO-NOMA networks, by making the desired signal of the stronger user in a typical NOMA pair constructive to the weaker user. In our CIP-NOMA scheme, we properly design the CIP precoder for transmit power minimization at the base station (BS), subject to signal-to-interference-plus-noise ratio (SINR) requirements of NOMA users. We further derive its closed-form solutions with Karush-Kuhn-Tucker (KKT) conditions, and optimally obtain the desired CIP precoders. Moreover, as compared to conventional NOMA schemes, we theoretically prove that once two NOMA users possess distinct channel gains, our optimized CIP-NOMA scheme always uses lower transmit power to reach the SINR thresholds. To be robust against the channel estimation errors, we extend our CIP-NOMA scheme to the scenario of imperfect CSI, by further addressing the hidden CSI errors. Specifically, we first introduce some auxiliary variables to separate the coupled vectors, and then use S-Procedure and semi-definite relaxation (SDR) to further transform them into convex ones. Extensive simulations verify that our CIP-NOMA scheme greatly outperforms the benchmarks with both perfect and imperfect CSI.

关键词： Constructive interference precoding semi-definite programming imperfect CSI

来源：评论

学校读者我要写书评

暂无评论

Hidden Convexity-Based Distributed Operation of Integrated Electricity-Gas Systems

引用

IEEE CONTROL SYSTEMS LETTERS 2024年 8卷 2051-2056页

作者： Liu, Rong-Peng Song, Yue Liu, Junhong Wang, Xiaozhe Guo, Jinpeng Hou, Yunhe McGill Univ Dept Elect & Comp Engn Montreal PQ H3A 0E9 Canada Tongji Univ Dept Control Sci & Engn Natl Key Lab Autonomous Intelligent Unmanned Syst Shanghai 201804 Peoples R China Tongji Univ Shanghai Inst Intelligent Sci & Technol Shanghai 201804 Peoples R China Univ Hong Kong Dept Elect & Elect Engn Hong Kong Peoples R China Hohai Univ Dept Elect & Power Engn Nanjing 211100 Peoples R China

This letter proposes a hidden convexity-based method to address distributed optimal energy flow (OEF) problems for transmission-level integrated electricity-gas systems. First, we develop a node-wise decoupling method to decompose an OEF problem into multiple OEF subproblems. Then, we propose a hidden convexity-based method to equivalently reformulate nonconvex OEF subproblems as semi-definite programs. This method differs from any approximation and convexification methods that may incur infeasible solutions. Since all OEF subproblems are originally convex or equivalently convexified, we adopt an ADMM to solve the hidden convexity-based distributed OEF problem with convergence analysis. Test results validate the effectiveness of the proposed method.

关键词： Pipelines Mathematical models Costs Vectors Power transmission lines Generators Convergence Distributed control energy systems optimal energy flow quadratic programming semi-definite programming

来源：评论

学校读者我要写书评

暂无评论

A Unified Non-Strict Finsler Lemma

引用

IEEE CONTROL SYSTEMS LETTERS 2024年 8卷 1955-1960页

作者： Meijer, T. J. Scheres, K. J. A. van den Eijnden, S. Holicki, T. Scherer, C. W. Heemels, W. P. M. H. Eindhoven Univ Technol Dept Mech Engn NL-5600 MB Eindhoven Netherlands Univ Stuttgart Dept Math D-70569 Stuttgart Germany

In this letter, we present a unified general non-strict Finsler lemma. This result is general in the sense that it does not impose any restrictions on the involved matrices and, thereby, it encompasses all existing non-strict versions of Finsler's lemma that do impose such restrictions. To further illustrate its usefulness, we showcase applications of the non-strict Finsler's lemma in deriving a structured solution to a special case of the non-strict projection lemma, and we use the unified non-strict Finsler's lemma to prove a more general version of the matrix Finsler's lemma.

关键词： Symmetric matrices Linear matrix inequalities Optimization Couplings Vectors Symbols Surveys Matrix inequalities semi-definite programming optimization

来源：评论

学校读者我要写书评

暂无评论

A distributional Farkas' lemma and moment optimization problems with no-gap dual semi-definite programs

引用

OPTIMIZATION LETTERS 2024年第5期18卷 1095-1110页

作者： Huang, Queenie Yingkun Jeyakumar, Vaithilingam Univ New South Wales Dept Appl Math Sydney 2052 Australia

We present a generalized Farkas' Lemma for an inequality system involving distributions. This lemma establishes an equivalence between an infinite-dimensional system of moment inequalities and a semi-definite system, assuming that the support for the distributions is a spectrahedron. To the best of our knowledge, it is the first extension of Farkas' Lemma to the distributional paradigm. Applying the new Lemma, we then establish no-gap duality results between a class of moment optimization problems and numerically tractable semi-definite programs.

关键词： Generalized Farkas' lemma semi-definite programming Duality Linear matrix inequalities Conic optimization Generalized moment problems

来源：评论

学校读者我要写书评

暂无评论

3D analytical and numerical upper-bound homogenization approaches to the in-plane strength domain of a running-bond masonry wall

引用

INTERNATIONAL JOURNAL FOR NUMERICAL AND ANALYTICAL METHODS IN GEOMECHANICS 2023年第10期47卷 1742-1771页

作者： Donval, Elodie Pham, Duc Toan Hassen, Ghazi de Buhan, Patrick Vigroux, Martin Ctr Sci & Tech Batiment CSTB Marne La Vallee France Univ Gustave Eiffel Ecole Ponts Lab Navier CNRS Marne La Vallee France Ctr Tech Mat Nat Construct Paris France Ctr Sci & Tech Batiment CSTB 84 Ave Jean Jaures F-77447 Champs Sur Marne 2 Marne La Vallee France

The present paper proposes a new homogenization method in order to determine the in-plane strength domain of a single-wythe, running-bond masonry wall. Two approaches, one analytical and one numerical, relying on the limit analysis/yield design framework, are introduced. The main novelty of these two approaches is that they allow to take into account a finite strength for the blocks and the mortar, as well as a non-zero thickness for the joints, without any specific assumption on the state of stress or strain of the structure. For that purpose, 3D virtual failure mechanisms are considered. A comprehensive parametric study is performed, showing that in many cases, the analytical approach is as precise as the numerical one for a much lower computational cost. Finally, the strength domains obtained by the proposed approaches are compared to the results of an extensive experimental study on reduced-scale masonry wallettes available in the literature, showing a good agreement in the compression-compression range.

关键词： homogenisation in-plane strength domain masonry semi-definite programming yield design

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：