A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming (Q644521): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Infinitely constrained optimization problems / 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: Global solution of semi-infinite programs / 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: Relaxation-Based Bounds for Semi-Infinite Programs / 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
Property / cites work
 
Property / cites work: Convex programs with an additional reverse convex constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659045 / rank
 
Normal rank

Latest revision as of 15:27, 4 July 2024

scientific article
Language Label Description Also known as
English
A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming
scientific article

    Statements