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

@@ Property / author @@
+Berc Rustem
@@ Property / author: Berc Rustem / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11590-010-0236-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2045079596
@@ Property / OpenAlex ID: W2045079596 / rank @@
+Normal rank
@@ Property / cites work @@
+Infinitely constrained optimization problems
@@ Property / cites work: Infinitely constrained optimization problems / rank @@
+Normal rank
@@ Property / cites work @@
+Semi-Infinite Programming: Theory, Methods, and Applications
+Normal rank
@@ Property / cites work @@
+Global solution of semi-infinite programs
@@ Property / cites work: Global solution of semi-infinite programs / rank @@
+Normal rank
@@ Property / cites work @@
+The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
+Normal rank
@@ Property / cites work @@
+Relaxation-Based Bounds for Semi-Infinite Programs
+Normal rank
@@ Property / cites work @@
+A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
+Normal rank
@@ Property / cites work @@
+Convex programs with an additional reverse convex constraint
+Normal rank
@@ Property / cites work @@
+Q4889854
@@ Property / cites work: Q4889854 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3659045
@@ Property / cites work: Q3659045 / rank @@
+Normal rank