Global solution of semi-infinite programs

DOI10.1007/s10107-005-0583-6zbMath1090.90188WikidataQ62732502 ScholiaQ62732502MaRDI QIDQ1780954

William H. Green, Paul I. Barton, Panayiotis Lemonidis, Binita Bhattacharjee

Publication date: 14 June 2005

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-005-0583-6

zbMATH Keywords

branch-and-bound; heuristic; semi-infinite programs

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90C34: Semi-infinite programming

Related Items

Feasible method for generalized semi-infinite programming, A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming, Convergence rate of McCormick relaxations, Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems, A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems, A review of recent advances in global optimization, Towards global bilevel dynamic optimization, Generalized semi-infinite programming: a tutorial, Global solution of bilevel programs with a nonconvex inner program, The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets, A lifting method for generalized semi-infinite programs based on lower level Wolfe duality, An augmented Lagrangian algorithm for solving semiinfinite programming, Global solution of nonlinear mixed-integer bilevel programs, Nonlinear robust optimization via sequential convex bilevel programming, Global optimization of semi-infinite programs via restriction of the right-hand side, Obtaining accurate solutions using reduced chemical kinetic models: a new model reduction method for models rigorously validated over ranges

Uses Software

• NPSOL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global solution of optimization problems with parameter-embedded linear dynamic systems.
• A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
• Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
• Optimal centered forms
• Optimization. Algorithms and consistent approximations
• Bi-level strategies in semi-infinite programming.
• Interval analysis: Theory and applications
• Interval methods for semi-infinite programs
• Generalized semi-infinite programming: Theory and methods
• Semi-Infinite Programming: Theory, Methods, and Applications
• A projected lagrangian algorithm for semi-infinite programming
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems