v0.5.7 (May 9, 2021)

  • Improve performance.

  • Improve precision of internal calculations.

  • Add support of penalty function inputs.

    • Automatically calibrate multipliers of penalty functions.

    • Return feasibilities parameter which shows whether each solution is feasible.

  • Extend execution parameter outputs

    • timeout to show the input timeout value.

    • num_iterations to indicate the number of iterations of optimization until timeout.

    • penalty_calibration to show whether automatic calibration of penalty functions is enabled.

    • penalty_multipliers to show (calibrated) multipliers of penalty functions.

  • Extend polynomial parameter to accept a constant value.

v0.4.5 (Nov. 17, 2020)

  • Improves performance for problems with variables that do not contain interactions.

v0.3.5 (Sep. 9, 2020)

  • Improve performance.

  • Accept upper and lower triangular matrix for matrix key of the request parameter.

  • Accept encoded request and response body compressed by deflate or gzip. See example commands.

  • Set the value of num_unit_steps to 10 as default.

v0.2.3 (July 16, 2020)

  • Improve performance.

  • Increase maximum problem size.

    • Fully connected (matrix): 65,536 bits

    • Sparse (polynomial): 4,294,967,296 elements

v0.1.0 (Dec. 25, 2019)

  • Initial release 🎄