Information processing device, information processing system, and information processing program

By determining a penalty coefficient for a quadratic programming problem using a dual variable from a relaxed problem, the method addresses the challenge of specifying an optimal solution in annealing methods, thereby improving the performance of the annealing method and efficiently solving constrained quadratic programming problems.

WO2025115289A1 Publication Date: 2025-06-05HITACHI LTD
4 Cites 1 Cited by

Patent Information

Application Number
PCT/JP2024/026906
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Priority Date
2023-11-29
Filing Date
2024-07-29
Publication Date
2025-06-05

AI Technical Summary

Technical Problem

Conventional annealing methods for solving quadratic programming problems with constraints face challenges in determining an appropriate penalty coefficient, which affects the performance of the annealing method and makes it difficult to specify the optimal solution among executable solutions.

Method used

The proposed solution involves determining a penalty coefficient for a quadratic programming problem without constraints based on a dual variable obtained by solving a relaxed problem. This approach improves the performance of the annealing method by optimizing the objective function while satisfying the constraints.

Benefits of technology

By using the dual variable to calculate an appropriate penalty coefficient, the method efficiently obtains a solution to the constrained quadratic programming problem, enhancing the performance of the annealing method and ensuring optimal solution identification.

✦ Generated by Eureka AI based on patent content.
Patent Text Reader

Abstract

Provided is an information processing means that makes it possible to improve the performance of an annealing method and efficiently obtain the solution to a constrained quadratic programming problem.　The information processing device includes: a problem generation unit into which a conversion function and a constrained quadratic programming problem having an objective function and a linear constraint are input, and that uses the constrained quadratic programming problem as a basis to generate a relaxation problem and an unconstrained quadratic programming problem in which the linear constraint is replaced with a penalty term; a relaxation unit that calculates a dual variable by solving the relaxation problem; a penalty management unit that calculates a penalty coefficient corresponding to the linear constraint of the constrained quadratic programming problem on the basis of the conversion function and the dual variable; and an annealing calculation unit that determines an executable solution satisfying the linear constraint by using an annealing method to solve the unconstrained quadratic programming problem in which the penalty coefficient is applied to the penalty term.
Need to check novelty before this filing date? Find Prior Art