A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
type: Item
instance of: scholarly article
title: A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
zbMATH Open document ID: 1380.90267
author: Hatim Djelassi
author: Alexander Mitsos
published in: Journal of Global Optimization
publication date: 2017-11-02T00:00:00Z
Mathematics Subject Classification ID: 90C34
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6802484
zbMATH Keywords: SIP
zbMATH Keywords: NLP
zbMATH Keywords: nonconvex
zbMATH Keywords: feasible point method
zbMATH Keywords: global optimization
describes a project that uses: BARON
describes a project that uses: GAMS
MaRDI profile type: Publication
full work available at URL: s10898-016-0476-7
OpenAlex ID: W2548706375
cites work: Interval methods for semi-infinite programs
cites work: Global solution of semi-infinite programs
cites work: Infinitely constrained optimization problems
cites work: The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
cites work: Semi-Infinite Programming: Theory, Methods, and Applications
cites work: Semi-infinite programming
cites work: Global solution of nonlinear mixed-integer bilevel programs
cites work: Global optimization of semi-infinite programs via restriction of the right-hand side
cites work: Global solution of bilevel programs with a nonconvex inner program
cites work: Relaxation-Based Bounds for Semi-Infinite Programs
cites work: Global optimization of generalized semi-infinite programs via restriction of the right hand side
cites work: Q3840143
cites work: BARON: A general purpose global optimization software package
cites work: A semi-infinite approach to design centering
cites work: The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
cites work: On generalized semi-infinite optimization and bilevel optimization
cites work: Feasible method for generalized semi-infinite programming
cites work: A polyhedral branch-and-cut approach to global optimization
cites work: A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming
cites work: A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
DOI: 10.1007/S10898-016-0476-7
description: scientific article; zbMATH DE number 6802484