Showing math.OCShow all
3 papers · 1 filter
math.OC2025
Quantum and Simulated Annealing-Based Iterative Algorithms for QUBO Relaxations of the Sparsest -Subgraph Problem
Omkar Bihani, Roman Kužel, Janez Povh +1
In this paper, we introduce three QUBO (Quadratic Unconstrained Binary Optimization) relaxations for the sparsest -subgraph (SkS) problem: a quadratic penalty relaxation, a Lagr…
math.OC2020
MADAM: A parallel exact solver for Max-Cut based on semidefinite programming and ADMM
Timotej Hrga, Janez Povh
We present MADAM, a parallel semidefinite based exact solver for Max-Cut, a problem of finding the cut with maximum weight in a given graph. The algorithm uses branch and bound par…
math.OC2020
A Block Coordinate Descent-based Projected Gradient Algorithm for Orthogonal Non-negative Matrix Factorization
Soodabeh Asadi, Janez Povh
This article utilizes the projected gradient method (PG) for a non-negative matrix factorization problem (NMF), where one or both matrix factors must have orthonormal columns or ro…