Density Matrix Minimization Meets a Combinatorial Optimization Problem

2023/03/27 by Yasuharu Okamoto, Okamoto, Yasuharu
Computer Science · Mathematics · #Advanced Optimization Algorithms Research #FOS: Physical sciences #Materials Science (cond-mat.mtrl-sci) #Metaheuristic Optimization Algorithms Research

paper · pdf · doi:10.48550/arxiv.2303.15643

openalex publication_date 2023/03/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This study investigates a new hybrid method for solving the combinatorial problem of optimizing fractional functions with 0-1 binary variables. The method combines density matrix minimization (DMM), tabu search (TS), and the Dinkelbach algorithm to optimize fractional functions. Although DMM alone did not provide a sufficiently accurate solution, combining DMM with TS significantly improved the accuracy.

Related

• An Accelerated Newton-Dinkelbach Method and its Application to Two Variables Per Inequality Systems
• An exact method for optimizing two linear fractional functions over the efficient set of a Multiobjective Integer Linear Fractional Program
• Quadratic Transform for Fractional Programming in Signal Processing and Machine Learning: A unified approach for solving optimization problems involving ratios
• ADMM for Structured Fractional Minimization
• Hyperbolic Optimization over the Integer Efficient Set of MOILFP