English

Parallel Branch and Bound Algorithm for Computing Maximal Structured Singular Value

Optimization and Control 2008-05-13 v1 Dynamical Systems
Authors: Xinjia Chen , Kemin Zhou
View on arXiv ↗ PDF ↗

Abstract

In this paper, we have developed a parallel branch and bound algorithm which computes the maximal structured singular value μ\mu without tightly bounding μ\mu for each frequency and thus significantly reduce the computational complexity.

Keywords

linear programming matrix algorithms

Cite

@article{arxiv.0805.1669,
  title  = {Parallel Branch and Bound Algorithm for Computing Maximal Structured Singular Value},
  author = {Xinjia Chen and Kemin Zhou},
  journal= {arXiv preprint arXiv:0805.1669},
  year   = {2008}
}

Comments

10 pages, 4 figures

Related papers

View all related →
Data Structures and Algorithms · Computer Science
A Parallel Branch and Bound Algorithm for the Maximum Labelled Clique Problem
Ciaran McCreesh, Patrick Prosser
2014-11-18
Distributed, Parallel, and Cluster Computing · Computer Science
The Shape of the Search Tree for the Maximum Clique Problem, and the Implications for Parallel Branch and Bound
Ciaran McCreesh, Patrick Prosser
2014-09-05
Optimization and Control · Mathematics
A branch and bound algorithm for the robust parall machine scheduling
Lei Liu, Canrong Zhang
2017-12-05
Data Structures and Algorithms · Computer Science
An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum $s$-Bundle Problem
Jinghui Xue, Jiongzhi Zheng, Mingming Jin, Kun He
2024-02-07
Data Structures and Algorithms · Computer Science
Targeted Branching for the Maximum Independent Set Problem
Demian Hespe, Sebastian Lamm, Christian Schorr
2021-03-30
Optimization and Control · Mathematics
A Geometric Branch and Bound Method for a Class of Robust Maximization Problems of Convex Functions
Fengqiao Luo, Sanjay Mehrotra
2019-11-21
Data Structures and Algorithms · Computer Science
Optimal (Randomized) Parallel Algorithms in the Binary-Forking Model
Guy E. Blelloch, Jeremy T. Fineman, Yan Gu, Yihan Sun
2020-06-26
Quantum Physics · Physics
Variational Quantum Algorithm for Constrained Topology Optimization
Jungin E. Kim, Yan Wang
2025-03-05
Machine Learning · Computer Science
Improved Branch and Bound for Neural Network Verification via Lagrangian Decomposition
Alessandro De Palma, Rudy Bunel, Alban Desmaison, Krishnamurthy Dvijotham +3
2021-04-15
Data Structures and Algorithms · Computer Science
Efficient Branch-and-Bound for Submodular Function Maximization under Knapsack Constraint
Yimin Hao, Yi Zhou, Chao Xu, Zhang-Hua Fu
2025-07-16
Numerical Analysis · Mathematics
Computing singular and near-singular integrals over curved boundary elements: The strongly singular case
Hadrien Montanelli, Francis Collino, Houssem Haddar
2024-06-24
Data Structures and Algorithms · Computer Science
Maximum Flows in Parametric Graph Templates
Tal Ben-Nun, Lukas Gianinazzi, Torsten Hoefler, Yishai Oltchik
2023-07-18
Numerical Analysis · Mathematics
A Fully Parallelized and Budgeted Multi-Level Monte Carlo Method and the Application to Acoustic Waves
Niklas Baumgarten, Sebastian Krumscheid, Christian Wieners
2023-07-21
Computer Science and Game Theory · Computer Science
Optimal Solutions for Multi-Unit Combinatorial Auctions: Branch and Bound Heuristics
Rica Gonen, Daniel Lehmann
2007-05-23
Distributed, Parallel, and Cluster Computing · Computer Science
Massively Parallel Construction of Radix Tree Forests for the Efficient Sampling of Discrete Probability Distributions
Nikolaus Binder, Alexander Keller
2019-09-02
Optimization and Control · Mathematics
Accelerating Deterministic Global Optimization via GPU-parallel Interval Arithmetic
Hongzhen Zhang, Tim Kerkenhoff, Neil Kichler, Manuel Dahmen +3
2025-07-29
Optimization and Control · Mathematics
Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem
Xuan-Zhao Gao, Yi-Jia Wang, Pan Zhang, Jin-Guo Liu
2024-12-11
Distributed, Parallel, and Cluster Computing · Computer Science
Parallel Random Search Algorithm of Constrained Pseudo-Boolean Optimization for Some Distinctive Large-Scale Problems
Lev Kazakovtsev
2012-09-03
Data Structures and Algorithms · Computer Science
Scalable Distributed Algorithms for Size-Constrained Submodular Maximization in the MapReduce and Adaptive Complexity Models
Yixin Chen, Tonmoy Dey, Alan Kuhnle
2024-09-17
Optimization and Control · Mathematics
Branch-and-bound algorithm for efficient reliability analysis of general coherent systems
Ji-Eun Byun, Hyeuk Ryu, Daniel Straub
2024-10-31
Logic in Computer Science · Computer Science
On Complexity Bounds and Confluence of Parallel Term Rewriting
Thaïs Baudon, Carsten Fuhs, Laure Gonnord
2026-04-08
Distributed, Parallel, and Cluster Computing · Computer Science
Parallel Combining: Benefits of Explicit Synchronization
Vitaly Aksenov, Petr Kuznetsov, Anatoly Shalyto
2018-11-14
Databases · Computer Science
Worst-Case Optimal Algorithms for Parallel Query Processing
Paul Beame, Paraschos Koutris, Dan Suciu
2016-04-08
Distributed, Parallel, and Cluster Computing · Computer Science
A Multi-signal Variant for the GPU-based Parallelization of Growing Self-Organizing Networks
Giacomo Parigi, Angelo Stramieri, Danilo Pau, Marco Piastra
2015-03-31
Optimization and Control · Mathematics
Parabolic optimal control problems with combinatorial switching constraints -- Part III: Branch-and-bound algorithm
Christoph Buchheim, Alexandra Grütering, Christian Meyer
2024-01-19
R2 v1 2026-06-21T10:39:33.787Z