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

IEEE International Geoscience and Remote Sensing Symposium (IGARSS)

作者： Su, Yang He, Zishu Cheng, Ting Wang, Jiaheng Univ Elect Sci & Technol China Sch Informat & Commun Engn Chengdu Sichuan Peoples R China

ISBN: (数字)9781665427920

ISBN: (纸本)9781665427920

In this paper, for the application of multi-target tracking (MTT), a joint node and resource scheduling (JNRS) strategy based on convex programming is proposed for the distributed multiple-input multiple-output (MIMO) radar network. To be more precise, the JNRS strategy is first formulated as a mathematic optimization problem, which is NP-hard. Then, an iterative and efficient solution technique incorporating the sequential convex programming (SCP) and the semi-definite programming (SDP) is proposed to tackle the NP-hard problem. Finally, numerical simulation results are provided to verify the effectiveness of the proposed JNRS strategy. Furthermore, the proposed JNRS strategy can achieve better MTT performance than other existing benchmark strategies.

关键词： Transmitter and receiver selection dwell time allocation power and bandwidth allocation sequential convex programming semi-definite programming

来源：评论

学校读者我要写书评

暂无评论

Understanding the Cluster Linear Program for Correlation Clustering 2024

Understanding the Cluster Linear Program for Correlation Clu...

引用

56th Annual ACM Symposium on Theory of Computing (STOC)

作者： Cao, Nairen Cohen-Addad, Vincent Lee, Euiwoong Li, Shi Newman, Alantha Vogl, Lukas Boston Coll Brighton MA 02135 USA Google Res Grenoble France Univ Michigan Ann Arbor MI 48109 USA Nanjing Univ Dept Comp Sci & Technol Nanjing Peoples R China Univ Grenoble Alpes CNRS Grenoble France Ecole Polytech Fed Lausanne Lausanne Switzerland

ISBN: (纸本)9798400703836

In the classic Correlation Clustering problem introduced by Bansal, Blum, and Chawla (FOCS 2002), the input is a complete graph where edges are labeled either + or -, and the goal is to find a partition of the vertices that minimizes the sum of the +edges across parts plus the sum of the -edges within parts. In recent years, Chawla, Makarychev, Schramm and Yaroslavtsev (STOC 2015) gave a 2.06-approximation by providing a near-optimal rounding of the standard LP, and Cohen-Addad, Lee, Li, and Newman (FOCS 2022, 2023) finally bypassed the integrality gap of 2 for this LP giving a 1.73-approximation for the problem. While introducing new ideas for Correlation Clustering, their algorithm is more complicated than typical approximation algorithms in the following two aspects: (1) It is based on two different relaxations with separate rounding algorithms connected by the round-or-cut procedure. (2) Each of the rounding algorithms has to separately handle seemingly inevitable correlated rounding errors, coming from correlated rounding of Sherali-Adams and other strong LP relaxations. In order to create a simple and unified framework for Correlation Clustering similar to those for typical approximate optimization tasks, we propose the cluster LP as a strong linear program that might tightly capture the approximability of Correlation Clustering. It unifies all the previous relaxations for the problem. It is exponential-sized, but we show that it can be (1 + epsilon)-approximately solved in polynomial time for any epsilon > 0, providing the framework for designing rounding algorithms without worrying about correlated rounding errors;these errors are handled uniformly in solving the relaxation.

关键词： Clustering approximation algorithms exponential size linear programming semi-definite programming

来源：评论

学校读者我要写书评

暂无评论

Strengthened stability analysis of discrete-time Lurie systems involving ReLU neural networks 6

Strengthened stability analysis of discrete-time Lurie syste...

引用

6th Annual Learning for Dynamics and Control Conference

作者： Richardson, Carl R. Turner, Matthew C. Gunn, Steve R. Drummond, Ross Univ Southampton Dept Elect & Comp Sci Southampton SO17 1BJ Hants England Univ Sheffield Dept Automat Control & Syst Engn Sheffield S1 3JD S Yorkshire England

This paper addresses the stability analysis of a discrete-time (DT) Lurie system featuring a static repeated ReLU nonlinearity. Such systems often arise in the analysis of recurrent neural networks and other neural feedback loops. Custom quadratic constraints, satisfied by the repeated ReLU, are employed to strengthen the standard DT Circle and DT Popov Criteria for this specific Lurie system. The criteria can be expressed as a set of linear matrix inequalities (LMIs) with less restrictive conditions on the matrix variables. It is further shown that if the Lurie system under consideration has a unique equilibrium point at the origin, then this equilibrium point is in fact globally stable or unstable, meaning that local stability analysis will provide no additional benefit. Numerical examples demonstrate that the strengthened criteria achieve a desirable balance between reduced conservatism and complexity when compared to existing criteria.

关键词： Lyapunov methods neural networks semi-definite programming stability of nonlinear systems

来源：评论

学校读者我要写书评

暂无评论

Supervised-distributed control with joint performance and communication optimisation

引用

INTERNATIONAL JOURNAL OF CONTROL 2022年第5期95卷 1371-1382页

作者： Guicherd, Romain Trodden, Paul A. Mills, Andrew R. Kadirkamanathan, Visakan Univ Sheffield Dept Automat Control & Syst Engn Rolls Royce Univ Technol Ctr Control Monitoring & Mappin St Sheffield S1 3JD S Yorkshire England

This paper is concerned with the control of systems composed of multiple coupled subsystems. In such architectures, communication between different local controllers is desired in order to achieve a better overall control performance. Any resultant improvement in control performance needs, however, to be significant enough to warrant the additional design complexity and higher energy consumption and costs associated with introducing communication channels between controllers. A practical distributed control design aims, therefore, to achieve an acceptable balance between minimising the use of communication between controllers and maximising the system-wide performance. In this article, a new approach to the problem of synthesising stabilising distributed control laws for discrete-time linear systems that balances performance and communication is presented. The approach employs a supervisory agent that, periodically albeit not necessarily at every sampling instant, solves an optimisation problem in order to synthesise a stabilising state feedback control law for the system. The online optimisation problem, which maximises sparsity of the control law while minimising an infinite-horizon performance cost, is formulated as a bilinear matrix inequality (BMI) problem;subsequently, it is then relaxed to a linear matrix inequality (LMI) problem, and (i) convergence to a solution as well as (ii) that early termination guarantees a feasible (but suboptimal) control law are proved. Stability of the closed-loop system under what is a switched control law is guaranteed by the inclusion of dwell-time constraints in the LMI problem. Finally, the efficacy of the approach is demonstrated through numerical simulation examples.

关键词： Distributed control optimal control optimisation semi-definite programming

来源：评论

学校读者我要写书评

暂无评论

A sublevel moment-SOS hierarchy for polynomial optimization

引用

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS 2022年第1期81卷 31-66页

作者： Chen, Tong Lasserre, Jean-Bernard Magron, Victor Pauwels, Edouard LAAS CNRS 7 Ave Colonel RocheBP 54200 F-31031 Toulouse 4 France Univ Toulouse 3 Paul Sabatier IMT Toulouse France Univ Toulouse CNRS IRIT Toulouse France

We introduce a sublevel Moment-SOS hierarchy where each SDP relaxation can be viewed as an intermediate (or interpolation) between the d-th and (d + 1)-th order SDP relaxations of the Moment-SOS hierarchy (dense or sparse version). With the flexible choice of determining the size (level) and number (depth) of subsets in the SDP relaxation, one is able to obtain different improvements compared to the dth order relaxation, based on the machine memory capacity. In particular, we provide numerical experiments for d = 1 and various types of problems both in combinatorial optimization (Max-Cut, Mixed Integer programming) and deep learning (robustness certification, Lipschitz constant of neural networks), where the standard Lasserre's relaxation (or its sparse variant) is computationally intractable. In our numerical results, the lower bounds from the sublevel relaxations improve the bound from Shor's relaxation (first order Lasserre's relaxation) and are significantly closer to the optimal value or to the best-known lower/upper bounds.

关键词： Polynomial optimization Moment-SOS hierarchy semi-definite programming Sublevel hierarchy

来源：评论

学校读者我要写书评

暂无评论

Joint Active and Passive Beamforming Optimization in Self-sustainable RIS-aided NOMA Networks 98

Joint Active and Passive Beamforming Optimization in Self-su...

引用

98th IEEE Vehicular Technology Conference (VTC-Fall)

作者： Li, Yiding Pan, Zhenni Shimamoto, Shigeru Waseda Univ Dept Fundimental Sci & Engn Tokyo Japan

ISBN: (纸本)9798350329285

Reconfigurable Intelligent Surface (RIS) is a competitive technology for future communication systems owning its capability of artificially manipulating the Electro-Magnetic (EM) environment at a low energy cost. Self-sustainable RIS, as a practical design, further enhance the ease of deploying and maintaining the devices. In this paper, we discuss the joint active and passive beamforming design of a Wireless Power Transfer (WPT) powered self-sustainable RIS aided Non-Orthogonal Multiple Access (NOMA) system. An RIS-NOMA transmission scheme and a corresponding min-max fairness problem are proposed. To address the problem and tackle the non-convexity caused by the coupling of active and passive beamforming parameters, we discuss an Alternating Optimization (AO) based solution. Results show the tradeoff between self-sustainability and Spectrum Efficiency (SE) under different RIS settings. It is also determined that self-sustainable RIS and NOMA are mutual beneficial and allow higher SE compared with the combination with traditional OMA schemes.

关键词： Self-sustainable Reconfigurable Intelligent Surfaces Non-orthogonal Multiple Access Beamforming semi-definite programming

来源：评论

学校读者我要写书评

暂无评论

Distributionally Robust State Estimation for Linear Systems Subject to Uncertainty and Outlier

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2022年 70卷 452-467页

作者： Wang, Shixiong Ye, Zhi-Sheng Natl Univ Singapore Dept Ind Syst Engn & Management Singapore 117576 Singapore

Parameter uncertainties and measurement outliers unavoidably exist in a real linear system. Such uncertainties and outliers make the true joint state-measurement distributions (induced by the true system model) deviate from the nominal ones (induced by the nominal system model) so that the performance of the optimal state estimator designed for the nominal model becomes unsatisfactory or even unacceptable in practice. The challenges are to quantitatively describe the uncertainties in the model and the outliers in the measurements, and then robustify the estimator in a right way. This article studies a distributionally robust state estimation framework for linear systems subject to parameter uncertainties and measurement outliers. It utilizes a family of distributions near the nominal one to implicitly describe the uncertainties and outliers, and the robust state estimation in the worst case is made over the least-favorable distribution. The advantages of the presented framework include: 1) it only uses a few scalars to parameterize the method and does not require the structural information of uncertainties;2) it generalizes several classical filters (e.g., the fading Kalman filter, risk-sensitive Kalman filter, relative-entropy Kalman filter, outlier-insensitive Kalman filters) into a unified framework. We show that the distributionally robust state estimation problem can be reformulated into a linear semi-definite program and in some special cases it can be analytically solved. Comprehensive comparisons with existing state estimation frameworks that are insensitive to parameter uncertainties and measurement outliers are also conducted.

关键词： Kalman filters Uncertainty State estimation Measurement uncertainty Noise measurement Uncertain systems Linear systems Distributionally robust state estimation linear system parameter uncertainty measurement outlier semi-definite programming

来源：评论

学校读者我要写书评

暂无评论

Exploiting Constructive Interference Precoding for MISO-NOMA Networks

Exploiting Constructive Interference Precoding for MISO-NOMA...

引用

IEEE International Conference on Communications (IEEE ICC)

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

ISBN: (纸本)9781538674628

As a symbol-level precoding scheme, constructive interference precoding (CIP) has been demonstrated its superiority in multi-antenna orthogonal multiple access (OMA) systems. By utilizing both the channel state information (CSI) and data symbols, harmful multi-user interference can convert to useful reception power via the well-designed CIP precoder. When CIP meets non-orthogonal multiple access (NOMA) whose bottleneck is usually at the weaker user side, 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. By replacing the non-convex constraints with convex linear matrix inequalities, we optimally obtain the precoding solutions for our CIP-NOMA scheme by semidefinite relaxation (SDR) method. 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 smaller transmit power to reach the target SINR thresholds. We further extend our CIP-NOMA scheme to the scenario of imperfect CSI, by further addressing the hidden CSI errors. Finally, we run extensive simulations to verify that our proposed CIP-NOMA scheme greatly outperforms zero-forcing (ZF), conventional NOMA and conventional CIP schemes.

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

来源：评论

学校读者我要写书评

暂无评论

stateQIP = statePSPACE 64

stateQIP = statePSPACE

引用

64th Annual IEEE Symposium on the Foundations of Computer Science (FOCS)

作者： Metger, Tony Yuen, Henry Swiss Fed Inst Technol Zurich Switzerland Columbia Univ New York NY USA

ISBN: (纸本)9798350318944

Complexity theory traditionally studies the hardness of solving classical computational problems. In the quantum setting, it is also natural to consider a different notion of complexity, namely the complexity of physically preparing a certain quantum state. We study the relation between two such state complexity classes: statePSPACE, which contains states that can be generated by space-uniform polynomial-space quantum circuits, and stateQIP, which contains states that a polynomial-time quantum verifier can generate by interacting with an all-powerful untrusted quantum prover. The latter class was recently introduced by Rosenthal and Yuen (ITCS 2022), who proved that statePSPACE subset of stateQIP. Our main result is the reverse inclusion, stateQIP. statePSPACE, thereby establishing equality of the two classes and providing a natural state-complexity analogue to the celebrated QIP = PSPACE theorem of Jain, et al. (J. ACM 2011). To prove this, we develop a polynomial-space quantum algorithm for solving a large class of exponentially large "PSPACE-computable" semidefinite programs (SDPs), which also prepares an optimiser encoded in a quantum state. Our SDP solver relies on recent block-encoding techniques from quantum algorithms, demonstrating that these techniques are also useful for complexity theory. Using similar techniques, we also show that optimal prover strategies for general quantum interactive protocols can be implemented in quantum polynomial space. We prove this by studying an algorithmic version of Uhlmann's theorem and establishing an upper bound on the complexity of implementing Uhlmann transformations.

关键词： quantum complexity interactive protocols quantum state complexity state synthesis semi-definite programming block encoding

来源：评论

学校读者我要写书评

暂无评论

Near-optimal fitting of ellipsoids to random points 36

Near-optimal fitting of ellipsoids to random points

引用

36th Annual Conference on Learning Theory (COLT)

作者： Potechin, Aaron Turner, Paxton Venkat, Prayaag Wein, Alexander S. Univ Chicago Chicago IL 60637 USA Harvard Univ Cambridge MA USA Univ Calif Davis Davis CA USA

Given independent standard Gaussian points v(1), . . . , v(n) in dimension d, for what values of (n, d) does there exist with high probability an origin-symmetric ellipsoid that simultaneously passes through all of the points? This basic problem of fitting an ellipsoid to random points has connections to low-rank matrix decompositions, independent component analysis, and principal component analysis. Based on strong numerical evidence, Saunderson, Parrilo, and Willsky (Saunderson, 2011;Saunderson et al., 2013) conjectured that the ellipsoid fitting problem transitions from feasible to infeasible as the number of points n increases, with a sharp threshold at n similar to d(2)/4. We resolve this conjecture up to logarithmic factors by constructing a fitting ellipsoid for some n = d(2)/polylog(d). Our proof demonstrates feasibility of the least squares construction of (Saunderson, 2011;Saunderson et al., 2013) using a convenient decomposition of a certain non-standard random matrix and a careful analysis of its Neumann expansion via the theory of graph matrices.

关键词： High-dimensional probability semi-definite programming phase transitions convex geometry

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：