A decomposition approach for global optimum search in QP, NLP and MINLP problems (Q2638940): Difference between revisions

From MaRDI portal
Changed an 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 / Wikidata QID
 
Property / Wikidata QID: Q114859334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jointly Constrained Biconvex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5630864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4744068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4744069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outer-approximation algorithm for a class of mixed-integer nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Successive Underestimation Method for Concave Minimization Problems / 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: A Decomposition Strategy for Global Optimum Search in the Pooling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for nonconvex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for solving bilinear programs / 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: The Indefinite Quadratic Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for Solving the Indefinite Quadratic Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained global optimization: algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: APROS: Algorithmic Development Methodology for Discrete-Continuous Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain / 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: An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent Algorithms for Minimizing a Concave Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur les inégalités linéaires / 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: The bilinear programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Maximization of a Convex Function with Linear Inequality Constraints / rank
 
Normal rank

Latest revision as of 12:50, 21 June 2024

scientific article
Language Label Description Also known as
English
A decomposition approach for global optimum search in QP, NLP and MINLP problems
scientific article

    Statements

    A decomposition approach for global optimum search in QP, NLP and MINLP problems (English)
    0 references
    1990
    0 references
    decomposition of the constraint set
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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