A new bound-and-reduce approach of nonconvex quadratic programming problems (Q902837): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.amc.2014.10.077 / rank
Normal rank
 
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.1016/j.amc.2014.10.077 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2060254153 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing Nonlinear Functional Constraints with Applications to the Pooling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilinear programming and structured stochastic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained global optimization: algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of signomial geometric programming using linear relaxation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearization method of global optimization for generalized geometric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some NP-complete problems in quadratic and nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking local optimality in constrained quadratic programming is NP- hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization of a difference of two convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to global optimization / 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: An algorithm for global minimization of linearly constrained quadratic functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel algorithm for constrained concave quadratic global minimization / 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: Global optimization of multiplicative programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-reduce approach to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5866777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AMC.2014.10.077 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:54, 10 December 2024

scientific article
Language Label Description Also known as
English
A new bound-and-reduce approach of nonconvex quadratic programming problems
scientific article

    Statements

    A new bound-and-reduce approach of nonconvex quadratic programming problems (English)
    0 references
    0 references
    0 references
    4 January 2016
    0 references
    nonconvex quadratic programming
    0 references
    global optimization
    0 references
    branch-and-bound
    0 references
    relaxation technique
    0 references
    hyper-rectangle reducing
    0 references

    Identifiers