A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming

DOI10.1007/s11590-010-0236-4zbMath1228.90134OpenAlexW2045079596MaRDI QIDQ644521

Angelos Tsoukalas, Berc Rustem

Publication date: 4 November 2011

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-010-0236-4

zbMATH Keywords

global optimizationsemi-infinite programmingfeasible point method

Mathematics Subject Classification ID

Semi-infinite programming (90C34)

Related Items (12)

A branch and bound algorithm for quantified quadratic programming ⋮ Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization ⋮ Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables ⋮ A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs ⋮ An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence ⋮ Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems ⋮ Recent advances in nonconvex semi-infinite programming: applications and algorithms ⋮ Local optimization of dynamic programs with guaranteed satisfaction of path constraints ⋮ Global optimization of generalized semi-infinite programs via restriction of the right hand side ⋮ Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints ⋮ A standard branch-and-bound approach for nonlinear semi-infinite problems ⋮ Global solution of semi-infinite programs with existence constraints

Cites Work

• A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
• Convex programs with an additional reverse convex constraint
• Infinitely constrained optimization problems
• Global solution of semi-infinite programs
• Semi-Infinite Programming: Theory, Methods, and Applications
• The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
• Relaxation-Based Bounds for Semi-Infinite Programs
• Unnamed Item
• Unnamed Item

This page was built for publication: A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming