A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs (Q1675550): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: GAMS / 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-016-0476-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2548706375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval methods for semi-infinite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global solution of semi-infinite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinitely constrained optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-Infinite Programming: Theory, Methods, and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global solution of nonlinear mixed-integer bilevel programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of semi-infinite programs via restriction of the right-hand side / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global solution of bilevel programs with a nonconvex inner program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxation-Based Bounds for Semi-Infinite Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of generalized semi-infinite programs via restriction of the right hand side / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840143 / rank
 
Normal rank
Property / cites work
 
Property / cites work: BARON: A general purpose global optimization software package / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semi-infinite approach to design centering / rank
 
Normal rank
Property / cites work
 
Property / cites work: The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized semi-infinite optimization and bilevel optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasible method for generalized semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral branch-and-cut approach to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems / rank
 
Normal rank

Latest revision as of 15:34, 14 July 2024

scientific article
Language Label Description Also known as
English
A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
scientific article

    Statements

    A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs (English)
    0 references
    0 references
    0 references
    2 November 2017
    0 references
    SIP
    0 references
    NLP
    0 references
    nonconvex
    0 references
    feasible point method
    0 references
    global optimization
    0 references
    0 references
    0 references
    0 references

    Identifiers