A branch-and-bound approach for solving a class of generalized semi-infinite programming problems
From MaRDI portal
Publication:1272992
DOI10.1023/A:1008245113420zbMath0912.90274OpenAlexW1499343918MaRDI QIDQ1272992
E. S. Levitin, Rainer Tichatschke
Publication date: 2 December 1998
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008245113420
branch-and-boundnondifferentiable optimizationnonconvex generalized semi-infinite programmingparametric max-functionsparametric quadratic problems
Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Nonsmooth analysis (49J52) Semi-infinite programming (90C34)
Related Items (16)
A conceptual method for solving generalized semi-infinite programming problems via global optimization by exact discontinuous penalization ⋮ Convergent Algorithms for a Class of Convex Semi-infinite Programs ⋮ Solving disjunctive optimization problems by generalized semi-infinite optimization techniques ⋮ A review of recent advances in global optimization ⋮ Feasible method for generalized semi-infinite programming ⋮ A lifting method for generalized semi-infinite programs based on lower level Wolfe duality ⋮ Nonsmooth semi-infinite programming problem using limiting subdifferentials ⋮ Generalized semi-infinite programming: a tutorial ⋮ Generalized semi-infinite programming: numerical aspects ⋮ Global optimization of generalized semi-infinite programs using disjunctive programming ⋮ Solving generalized semi-infinite programs by reduction to simpler problems ⋮ An algorithm constructing solutions for a family of linear semi-infinite problems. ⋮ Lower level duality and the global solution of generalized semi-infinite programs ⋮ Generalized semi-infinite programming: Theory and methods ⋮ Optimality conditions and duality for nondifferentiable multiobjective semi-infinite programming problems with generalized \((C,\alpha,\rho,d)\)-convexity ⋮ On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems
This page was built for publication: A branch-and-bound approach for solving a class of generalized semi-infinite programming problems
