A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming
type: Item
instance of: scholarly article
title: A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming
zbMATH Open document ID: 1228.90134
author: Angelos Tsoukalas
author: Berç Rustem
published in: Optimization Letters
publication date: 2011-11-04T00:00:00Z
Mathematics Subject Classification ID: 90C34
zbMATH DE Number: 5968156
zbMATH Keywords: semi-infinite programming
zbMATH Keywords: feasible point method
zbMATH Keywords: global optimization
MaRDI profile type: Publication
full work available at URL: s11590-010-0236-4
OpenAlex ID: W2045079596
cites work: Infinitely constrained optimization problems
cites work: Semi-Infinite Programming: Theory, Methods, and Applications
cites work: Global solution of semi-infinite programs
cites work: The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
cites work: Relaxation-Based Bounds for Semi-Infinite Programs
cites work: A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
cites work: Convex programs with an additional reverse convex constraint
cites work: Q4889854
cites work: Q3659045
DOI: 10.1007/S11590-010-0236-4
description: scientific article; zbMATH DE number 5968156