Fix and bound: an efficient approach for solving large-scale quadratic programming problems with box constraints (Q6960027)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 8063089
Language Label Description Also known as
default for all languages
No label defined
    English
    Fix and bound: an efficient approach for solving large-scale quadratic programming problems with box constraints
    scientific article; zbMATH DE number 8063089

      Statements

      Fix and bound: an efficient approach for solving large-scale quadratic programming problems with box constraints (English)
      0 references
      0 references
      0 references
      0 references
      14 July 2025
      0 references
      nonconvex quadratic programming
      0 references
      global optimization
      0 references
      semidefinite programming
      0 references
      branch-and-bound
      0 references
      variable fixing
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references