Duality bound method for the general quadratic programming problem with quadratic constraints (Q5925726): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Convergent Algorithms for Minimizing a Concave Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization of large-scale constrained concave quadratic problems by separable programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained global optimization: algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: DC programming: overview. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization by reducing the duality gap / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrange duality and partitioning techniques in nonconvex global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence and application of a decomposition method using duality bounds for nonconvex global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondifferentiable optimization and polynomial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new semidefinite programming bound for indefinite quadratic forms over a simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4833806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relaxation method for nonconvex quadratically constrained quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for solving the general quadratic programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplicial branch-and-bound method for solving nonconvex all-quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jointly Constrained Biconvex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jointly constrained bilinear programs and related problems: An overview / rank
 
Normal rank

Latest revision as of 14:09, 3 June 2024

scientific article; zbMATH DE number 1566512
Language Label Description Also known as
English
Duality bound method for the general quadratic programming problem with quadratic constraints
scientific article; zbMATH DE number 1566512

    Statements

    Duality bound method for the general quadratic programming problem with quadratic constraints (English)
    0 references
    0 references
    19 February 2001
    0 references
    global optimization
    0 references
    branch-and-bound algorithm
    0 references
    duality bounds
    0 references
    quadratically constrained quadratic programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references