Feasible method for generalized semi-infinite programming (Q604267): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Solving Semi-Infinite Optimization Problems with Interior Point Techniques / 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: Bi-level strategies in semi-infinite programming. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized semi-infinite programming: a tutorial / 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: Q4889854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directional Derivatives for Extremal-Value Functions with Applications to the Completely Convex Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global solution of semi-infinite programs / 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: Q4332850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering and Economic Applications of Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear optimization: Characterization of structural stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing methods for convex inequalities and linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A smoothing method for mathematical programs with equilibrium constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified relaxation scheme for mathematical programs with complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower-order penalty methods for mathematical programs with complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of quasi-Newton methods to mathematical programs with complementarity con\-straints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting mathematical programs with complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On NCP-functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5440595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound approach for solving a class of generalized semi-infinite programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3134873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the classical logarithmic barrier function method for a class of smooth convex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5395213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3775324 / rank
 
Normal rank

Revision as of 10:35, 3 July 2024

scientific article
Language Label Description Also known as
English
Feasible method for generalized semi-infinite programming
scientific article

    Statements

    Feasible method for generalized semi-infinite programming (English)
    0 references
    10 November 2010
    0 references
    mathematical program with equilibrium constraints
    0 references
    bilevel programming
    0 references
    design centering
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers