Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach (Q1652420): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Introduction to Interval Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4851610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Nonconvex Optimization Problems in Systems and Control: A Polynomial B-spline Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4277813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4445267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GloptiPoly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test examples for nonlinear programming codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods for bounding the range of a polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval approximation of higher order to the ranges of functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the range of values of real functions using B-spline form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3207999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for global optimization using the Taylor-Bernstein form as inclusion function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the selection of subdivision directions in interval branch-and-bound methods for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral branch-and-cut approach to global optimization / rank
 
Normal rank

Revision as of 02:13, 16 July 2024

scientific article
Language Label Description Also known as
English
Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach
scientific article

    Statements

    Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach (English)
    0 references
    0 references
    0 references
    0 references
    11 July 2018
    0 references
    polynomial B-spline
    0 references
    global optimization
    0 references
    polynomial optimization
    0 references
    unconstrained optimization
    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