Global optimization of generalized semi-infinite programs using disjunctive programming
type: Item
instance of: scholarly article
title: Global optimization of generalized semi-infinite programs using disjunctive programming
zbMATH Open document ID: 1417.90141
author: Peter Kirst
author: Oliver Stein
published in: Journal of Global Optimization
publication date: 2019-03-18T00:00:00Z
Mathematics Subject Classification ID: 90C34
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 7037608
zbMATH Keywords: generalized semi-infinite optimization
zbMATH Keywords: disjunctive optimization
zbMATH Keywords: global optimization
zbMATH Keywords: branch-and-bound
describes a project that uses: PROFIL/BIAS
describes a project that uses: GLPK
MaRDI profile type: Publication
full work available at URL: s10898-018-0690-6
OpenAlex ID: W2883225263
cites work: Semi-Infinite Programming: Theory, Methods, and Applications
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: Infinitely constrained optimization problems
cites work: Interval methods for semi-infinite programs
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: The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
cites work: The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
cites work: Global optimization of generalized semi-infinite programs via restriction of the right hand side
cites work: A transformation-based discretization method for solving general semi-infinite optimization problems
cites work: On the closure of the feasible set in generalized semi-infinite programming
cites work: General Semi-Infinite Programming: Symmetric Mangasarian–Fromovitz Constraint Qualification and the Closure of the Feasible Set
cites work: Review of nonlinear mixed-integer and disjunctive programming techniques
cites work: A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
cites work: Generalized semi-infinite programming: Theory and methods
cites work: Generalized semi-infinite programming: numerical aspects
cites work: A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
cites work: Feasible method for generalized semi-infinite programming
cites work: A branch-and-bound approach for solving a class of generalized semi-infinite programming problems
cites work: Global optimization of disjunctive programs
cites work: Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
cites work: Die zentrische Form in der Intervallarithmetik, ihre quadratische Konvergenz und ihre Inklusionsisotonie
cites work: Optimal centered forms
cites work: Disjunctive Cuts for Nonconvex MINLP
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
cites work: Interval Methods for Systems of Equations
cites work: Q4165152
cites work: Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs
cites work: A note on duality in disjunctive programming
cites work: PROFIL/BIAS - A fast interval library
cites work: Generalized semi-infinite optimization: A first order optimality condition and examples
cites work: Convex programming for disjunctive convex optimization
cites work: A branch-and-cut method for 0-1 mixed convex programming
DOI: 10.1007/S10898-018-0690-6
description: scientific article; zbMATH DE number 7037608