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

Asilomar Conference on Signals, Systems & Computers

作者： Ali Elghariani Michael D. Zoltowski School of Electrical and Computer Engineering Purdue University West Lafayette IN USA

ISBN: (纸本)9781467350501

In this paper we introduce integer quadratic programming (IQP) approach to detect QPSK Code Spread OFDM (CSOFDM) signal by formulating the problem as a combinatorial optimization problem. The Branch and Bound (BB) algorithm is utilized to solve this integer quadratic programming problem. Furthermore, we propose preprocessing procedures that can be applied prior to BB so that the computational complexity of the optimum receiver is reduced. The basic idea of the proposed preprocessing is to introduce a good choice of upper bound for the BB search tree and/or reduce the search space of the BB problem. Performance and complexity computations of these preprocessing are investigated. Simulation results show that the proposed preprocessing when applied prior to BB provides optimal or near optimal performance with a significantly reduced computational complexity.

关键词： CSOFDM integer quadratic programming Branch and Bound MMSE LLR Computational complexity quadratic programming complexity classes Mini Mental State Examination optimum receiver integer Orthogonal frequency division multiplexing Pretreatment optimum performance

来源：评论

学校读者我要写书评

暂无评论

A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming

引用

Electronic Notes in Discrete Mathematics 2010年第C期36卷 271-278页

作者： Quadri, Dominique Soutif, Éric Université d'Avignon et des Pays du Vaucluse LIA F-84911 Avignon Cedex 9 France CEDRIC-CNAM 292 rue Saint Martin 75141 Paris Cedex 03 France

We study in this paper a general case of integer quadratic multi-knapsack problem (QMKP) where the objective function is non separable. An upper bound is proposed for (QMKP) which is computed via two steps. We first rewrite (QMKP) into an equivalent separable mixed integer quadratic program (QP_x,y), using Gauss decomposition of the quadratic terms matrix. We then suggest an original technique, we call roof linearization, to linearize (QP_x,y) so as to obtain a mixed integer linear program which optimal value provides an upper bound for both (QP_x,y) and (QMKP). Preliminary computational experiments are conducted so as to assess that the proposed algorithm provides a tight upper bound in fast CPU times. © 2010 Elsevier B.V.

关键词： integer quadratic programming Knapsack problems Linearization techniques Non separable function

来源：评论

学校读者我要写书评

暂无评论

A semidefinite programming method for integer convex quadratic minimization

引用

OPTIMIZATION LETTERS 2018年第3期12卷 499-518页

作者： Park, Jaehyun Boyd, Stephen Stanford Univ Packard BldgRoom 243350 Serra Mall Stanford CA 94305 USA Stanford Univ Packard BldgRoom 254350 Serra Mall Stanford CA 94305 USA

We consider the NP-hard problem of minimizing a convex quadratic function over the integer lattice Zn. We present a simple semidefinite programming (SDP) relaxation for obtaining a nontrivial lower bound on the optimal value of the problem. By interpreting the solution to the SDP relaxation probabilistically, we obtain a randomized algorithm for finding good suboptimal solutions, and thus an upper bound on the optimal value. The effectiveness of the method is shown for numerical problem instances of various sizes.

关键词： Convex optimization integer quadratic programming Mixed-integer programming Semidefinite relaxation Branch-and-bound

来源：评论

学校读者我要写书评

暂无评论

AN EFFICIENT BRANCH AND BOUND ALGORITHM TO SOLVE THE quadratic integer programming PROBLEM

引用

COMPUTING 1983年第3期30卷 253-260页

作者： KORNER, F Sektion Mathematik Technische Universität Dresden Mommsenstrasse 13 DDR-8027 Dresden German Democratic Republic

The quadratic integer programming problem is considered. It will be shown in which order the variablesx1, ...,x n should be ramified in order to reduce the number of knots being studied to a minimum. There areO(n3) operations necessary to determine a favourable ramification. Numerical tests confirm the efficiency of the given algorithm.

关键词： integer quadratic programming branch and bound

来源：评论

学校读者我要写书评

暂无评论

Parameterized algorithms for minimum sum vertex cover

引用

THEORETICAL COMPUTER SCIENCE 2025年 1029卷

作者： Aute, Shubhada Panolan, Fahad Indian Inst Technol Hyderabad Sangareddy India Univ Leeds Sch Comp Sci Leeds England

A minimum sum vertex cover of an n-vertex graph G is a bijection : V(G)->[] that minimizes the cost ex) min ($(u). $()). Finding a minimum sum vertex cover of a graph (the MSVC problem) is NP-hard. MSVC is studied well in the realm of approximation algorithms. The best- known approximation factor in polynomial time for the problem is 16/9 [Bansal, Batra, Farhadi, and Tetali, SODA 2021]. Recently, Stankovic [APPROX/RANDOM 2022) proved that achieving an approximation ratio better than 1.014 for MSVC is NP-hard, assuming the Unique Games Conjecture. We study the MSVC problem from the perspective of parameterized algorithms. The parameters consider are the size of a minimum vertex cover and the size of a minimum clique modulator of the input graph. We obtain the following results. MSVC can be solved in 2000) time, where k is the size of a minimum vertex cover. MSVC can be solved in (k) time for some computable function, where k is the size of a minimum clique modulator.

关键词： FPT Vertex cover integer quadratic programming

来源：评论

学校读者我要写书评

暂无评论

From Angular Manifolds to the integer Lattice: Guaranteed Orientation Estimation With Application to Pose Graph Optimization

引用

IEEE TRANSACTIONS ON ROBOTICS 2014年第2期30卷 475-492页

作者： Carlone, Luca Censi, Andrea Georgia Inst Technol Coll Comp Atlanta GA 30332 USA MIT Informat & Decis Syst Lab Cambridge MA 02139 USA

Pose graph optimization from relative measurements is challenging because of the angular component of the poses: the variables live on a manifold product with nontrivial topology and the likelihood function is nonconvex and has many local minima. Because of these issues, iterative solvers are not robust to large amounts of noise. This paper describes a global estimation method, called multi-hypothesis orientation-from-lattice estimation in 2-D (MOLE2D), for the estimation of the nodes' orientation in a pose graph. We demonstrate that the original nonlinear optimization problem on the manifold product is equivalent to an unconstrained quadratic optimization problem on the integer lattice. Exploiting this insight, we show that, in general, the maximum likelihood estimate alone cannot be considered a reliable estimator. Therefore, MOLE2D returns a set of point estimates, for which we can derive precise probabilistic guarantees. Experiments show that the method is able to tolerate extreme amounts of noise, far above all noise levels of sensors used in applications. Using MOLE2D's output to bootstrap the initial guess of iterative pose graph optimization methods improves their robustness and makes them avoid local minima even for high levels of noise.

关键词： integer quadratic programming mobile robots multi-hypothesis estimation orientation estimation pose graph optimization simultaneous localization and mapping (SLAM) SO(2) manifold

来源：评论

学校读者我要写书评

暂无评论

Efficient Feature Matching via Nonnegative Orthogonal Relaxation

引用

INTERNATIONAL JOURNAL OF COMPUTER VISION 2019年第9期127卷 1345-1360页

作者： Jiang, Bo Tang, Jin Luo, Bin Anhui Univ Sch Comp Sci & Technol 111 Jiulong Rd Hefei Anhui Peoples R China

Feature matching problem that incorporates pair-wise constraints can be formulated as an integer quadratic programming (IQP) problem with one-to-one matching constraint. Since it is NP-hard, relaxation models are required. One main challenge for optimizing IQP matching is how to incorporate the discrete one-to-one matching constraint in IQP matching optimization. In this paper, we present a new feature matching relaxation model, called Nonnegative Orthogonal Relaxation (NOR), that aims to optimize IQP matching problem in nonnegative orthogonal domain. One important benefit of the proposed NOR model is that it can naturally incorporate the discrete one-to-one matching constraint in its optimization and can return a desired sparse (approximate discrete) solution for the problem. An efficient and effective update algorithm has been developed to solve the proposed NOR model. Promising experimental results on several benchmark datasets demonstrate the effectiveness and efficiency of the proposed NOR method.

关键词： Feature matching Nonnegative orthogonal constraint Multiplicative update integer quadratic programming

来源：评论

学校读者我要写书评

暂无评论

ON LOWER BOUNDS FOR A CLASS OF quadratic-0, 1 PROGRAMS

引用

OPERATIONS RESEARCH LETTERS 1985年第4期4卷 175-180页

作者： ASSAD, AA XU, WX CHINESE ACAD SCI INST APPL MATHBEIJINGPEOPLES R CHINA

We present a new method of obtaining lower bounds for a class of quadratic 0, 1 programs that includes the quadratic assignment problem. The method generates a monotonic sequence of lower bounds and may be interpreted as a Lagrangean dual ascent procedure. We report on a computational comparison of our bounds with earlier work in [2] based on subgradient techniques.

关键词： integer quadratic programming quadratic assignment problem lower bounding techniques

来源：评论

学校读者我要写书评

暂无评论

GENERALIZATION OF BARAHONAS ALGORITHM FOR CASES OF integer NONLINEAR-programming WITH BOX CONSTRAINTS

引用

OPERATIONS RESEARCH LETTERS 1993年第2期13卷 99-105页

作者： BALDICK, R LAWRENCE BERKELEY LAB DEPT ELECT & COMP ENGNBERKELEYCA 94720

Barahona described a linear time algorithm for a class of 0-1 quadratic programming problems. The algorithm was based on a transformation to a max-cut problem. We describe a linear algorithm that treats a slightly more general problem directly in its original form. We then give a pseudopolynomial algorithm for even more general problems.

关键词： integer quadratic programming SERIES-PARALLEL GRAPHS POLYNOMIAL ALGORITHMS PSEUDOPOLYNOMIAL ALGORITHMS BOX CONSTRAINTS DYNAMIC programming

来源：评论

学校读者我要写书评

暂无评论

The edge-preservation similarity for comparing rooted, unordered, node-labeled trees*

引用

PATTERN RECOGNITION LETTERS 2023年第1期167卷 189-195页

作者： Boria, Nicolas Kiederle, Jana Yger, Florian Blumenthal, David B. PSL Univ Univ Paris Dauphine LAMSADE CNRSUMR7243 Paris France Friedrich Alexander Univ Erlangen Nurnberg Dept Artificial Intelligence Biomed Engn Biomed Network Sci Lab Erlangen Germany Normandie Univ GREYC CNRS ENSICAENUMR 6072 Caen France

Rooted trees are ubiquitous data structures which are used to model hierarchical objects from a plethora of different application domains. For various downstream analysis tasks, measures are needed that quan-tify (dis-)similarity between rooted trees. Many such measures exist, e. g., the widely used tree edit dis-tance (TED). However, there are few algorithms to compute (dis-)similarity measures which are specifi-cally designed for rooted, unordered, node-labeled trees and support input trees of different orders. To close this gap in the literature, we introduce the edge-preservation similarity (EPS). We show how to exactly compute EPS via integer quadratic programming on small instances and present a scalable 4-approximation algorithm. An evaluation on tree representations of pseudoknotted RNA secondary struc-tures and acyclic molecular graphs shows that both exact and approximate (normalized) EPS better preserves functional similarities between the compared RNAs and molecules than the often-used TED. Python implementations of our algorithms and scripts to reproduce the results are available on GitHub: https://***/bionetslab/edge-preservation-similarity . (c) 2023 Elsevier B.V. All rights reserved.

关键词： Tree similarity measures integer quadratic programming Approximation algorithms RNA secondary structures

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：