METHOD AND SYSTEM FOR SOLVING THE LAGRANGIAN DUAL OF A BINARY POLYNOMIALLY CONSTRAINED POLYNOMIAL PROGRAMMING PROBLEM USING A QUANTUM ANNEALER
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
N/A
Issued Date -
N/A
app pub date -
Feb 23, 2016
filing date -
Feb 23, 2016
priority date (Note) -
Published
status (Latency Note)
Importance
Abstract
A method for solving the Lagrangian dual of a binary polynomially constrained polynomial programming problem comprises obtaining a binary polynomially constrained polynomial programming problem; until a convergence is detected, iteratively, providing a set of Lagrange multipliers, providing an unconstrained binary quadratic programming problem representative of the Lagrangian relaxation of the binary polynomially constrained polynomial programming problem at these Lagrange multipliers, providing the unconstrained binary quadratic programming problem to a quantum annealer, obtaining from the quantum annealer at least one corresponding solution, using the at least one corresponding solution to generate a new set of Lagrange multipliers; and providing all corresponding best-known primal-dual pairs and best-known feasible solutions after convergence.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully