Decomposition methods for solving nonconvex quadratic programs via branch and bound (Q811889): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-004-6095-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2049974979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for global minimization of linearly constrained quadratic functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global and local quadratic minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition method for global and local quadratic minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite algorithm for solving general quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite algorithm for a particular D.C. quadratic programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Separable Nonconvex Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3720308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for nonconvex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the convergence of an algorithm for nonconvex programming problems / 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: Maximization of A convex quadratic function under linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for indefinite quadratic programming with convex constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization of indefinite quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization algorithms for linearly constrained indefinite quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization of large-scale constrained concave quadratic problems by separable programming / rank
 
Normal rank

Latest revision as of 10:30, 24 June 2024

scientific article
Language Label Description Also known as
English
Decomposition methods for solving nonconvex quadratic programs via branch and bound
scientific article

    Statements

    Decomposition methods for solving nonconvex quadratic programs via branch and bound (English)
    0 references
    0 references
    0 references
    23 January 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    branch and bound
    0 references
    d.c. decomposition
    0 references
    quadratic programming
    0 references
    0 references