Global optimization of generalized semi-infinite programs via restriction of the right hand side
From MaRDI portal
Publication:486720
DOI10.1007/s10898-014-0146-6zbMath1312.90063MaRDI QIDQ486720
Angelos Tsoukalas, Alexander Mitsos
Publication date: 16 January 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/105462
Related Items
An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence, Recent advances in nonconvex semi-infinite programming: applications and algorithms, Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming, Global optimization of generalized semi-infinite programs using disjunctive programming, A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs, Local optimization of dynamic programs with guaranteed satisfaction of path constraints, An algorithm based on semidefinite programming for finding minimax optimal designs, A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs, Convergent upper bounds in global minimization with nonlinear equality constraints, Global solution of semi-infinite programs with existence constraints, Adjustable robust optimal control for industrial \(2\)-Mercaptobenzothiazole production processes under uncertainty, A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming, Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization, Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables, Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints, A branch and bound algorithm for quantified quadratic programming, How to solve a design centering problem, A transformation-based discretization method for solving general semi-infinite optimization problems, Lower level duality and the global solution of generalized semi-infinite programs, Feasible Method for Semi-Infinite Programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Feasible method for generalized semi-infinite programming
- A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming
- 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
- Generalized semi-infinite programming: a tutorial
- Application of general semi-infinite programming to lapidary cutting problems
- On the closure of the feasible set in generalized semi-infinite programming
- Global solution of bilevel programs with a nonconvex inner program
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- Infinitely constrained optimization problems
- Generalized semi-infinite optimization: A first order optimality condition and examples
- First-order optimality conditions in generalized semi-infinite programming
- Bi-level strategies in semi-infinite programming.
- Interval methods for semi-infinite programs
- A polyhedral branch-and-cut approach to global optimization
- Global solution of semi-infinite programs
- Generalized semi-infinite programming: Theory and methods
- On generalized semi-infinite optimization and bilevel optimization
- Robust optimization-methodology and applications
- Review of nonlinear mixed-integer and disjunctive programming techniques
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
- Global solution of nonlinear mixed-integer bilevel programs
- Multivariate McCormick relaxations
- How to solve a semi-infinite optimization problem
- General Semi-Infinite Programming: Symmetric Mangasarian–Fromovitz Constraint Qualification and the Closure of the Feasible Set
- Global optimization of semi-infinite programs via restriction of the right-hand side
- A hybrid algorithm for infinitely constrained optimization
- Obtaining accurate solutions using reduced chemical kinetic models: a new model reduction method for models rigorously validated over ranges
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- Relaxation-Based Bounds for Semi-Infinite Programs
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A nonconvex max-min problem
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
- Pessimistic Bilevel Optimization
- Extensions of the Kuhn--Tucker Constraint Qualification to Generalized Semi-infinite Programming
- Second-order optimality conditions in generalized semi-infinite programming
- On linear and linearized generalized semi-infinite optimization problems
