Global solution of semi-infinite programs with existence constraints
type: Item
instance of: scholarly article
title: Global solution of semi-infinite programs with existence constraints
zbMATH Open document ID: 1469.90151
author: Hatim Djelassi
author: Alexander Mitsos
published in: Journal of Optimization Theory and Applications
publication date: 2021-06-15T00:00:00Z
Mathematics Subject Classification ID: 90C34
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C33
zbMATH DE Number: 7359107
zbMATH Keywords: semi-infinite programming
zbMATH Keywords: multi-level programming
zbMATH Keywords: nonlinear programming
zbMATH Keywords: nonconvex
zbMATH Keywords: global optimization
describes a project that uses: MAiNGO
MaRDI profile type: Publication
full work available at URL: s10957-021-01813-2
OpenAlex ID: W3127671907
cites work: Adjustable robust solutions of uncertain linear programs
cites work: Adjustable robust optimization models for a nonlinear two-period system
cites work: Robust capacity expansion of network flows
cites work: Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
cites work: A smoothing algorithm for finite min-max-min problems
cites work: Semi-Infinite Programming: Theory, Methods, and Applications
cites work: Q3840143
cites work: Semi-infinite programming
cites work: Generalized semi-infinite programming: a tutorial
cites work: How to solve a semi-infinite optimization problem
cites work: A hybrid algorithm for infinitely constrained optimization
cites work: Interval methods for 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: The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
cites work: Infinitely constrained optimization problems
cites work: Global solution of semi-infinite programs
cites work: Global optimization of semi-infinite programs via restriction of the right-hand side
cites work: Global optimization of generalized semi-infinite programs via restriction of the right hand side
cites work: A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming
cites work: A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
cites work: A nonconvex max-min problem
cites work: Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints
DOI: 10.1007/S10957-021-01813-2
description: scientific article; zbMATH DE number 7359107