Improve-and-branch algorithm for the global optimization of nonconvex NLP problems (Q2494301): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q924749
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Pío A. Aguirre / 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.1007/s10898-005-4386-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2042642065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\alpha BB\): A global optimization method for general constrained nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4165315 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-relaxed dual global optimization approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analytical approach to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all solutions of nonlinearly constrained systems of equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization algorithm for linear fractional and bilinear 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: A new reformulation-linearization technique for bilinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxations of fractional programs via novel convexification techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms / rank
 
Normal rank

Latest revision as of 16:27, 24 June 2024

scientific article
Language Label Description Also known as
English
Improve-and-branch algorithm for the global optimization of nonconvex NLP problems
scientific article

    Statements

    Improve-and-branch algorithm for the global optimization of nonconvex NLP problems (English)
    0 references
    0 references
    0 references
    0 references
    26 June 2006
    0 references
    concave terms
    0 references
    convex hull
    0 references
    underestimating problem
    0 references

    Identifiers