Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization
From MaRDI portal
Publication:4991677
DOI10.1287/moor.2020.1057zbMath1469.90097OpenAlexW3086620436WikidataQ114598548 ScholiaQ114598548MaRDI QIDQ4991677
Immanuel M. Bomze, Markus Leitner, Michael Kahr
Publication date: 3 June 2021
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.2020.1057
Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47) Nonlinear programming (90C30) Quadratic programming (90C20) Robustness in mathematical programming (90C17)
Related Items (3)
Optimization under uncertainty and risk: quadratic and copositive approaches ⋮ Two-stage stochastic standard quadratic optimization ⋮ A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Predicting missing links via local information
- Copositive optimization -- recent developments and applications
- Robust portfolio optimization: a conic programming approach
- Graph clustering
- Solving the maximum edge weight clique problem via unconstrained quadratic programming
- Robust portfolios: contributions from operations research and finance
- On standard quadratic optimization problems
- Robust solutions of uncertain linear programs
- Dominant-set clustering: a review
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Recent advances in robust optimization: an overview
- Robustness analysis in decision aiding, optimization, and analytics
- Robust maximum weighted independent-set problems on interval graphs
- Deriving robust counterparts of nonlinear uncertain inequalities
- Robust Convex Optimization
- Theory and Applications of Robust Optimization
- Communities in Networks
- Continuous Characterizations of the Maximum Clique Problem
- Robust Truss Topology Design via Semidefinite Programming
- Graph Partitioning and Graph Clustering
- First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Introduction to global optimization.
- Special issue: Selected papers of the international workshop on global optimization, GO '99. Firenze, Italy, 1999
This page was built for publication: Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization
