Global optimization of generalized semi-infinite programs via restriction of the right hand side
From MaRDI portal
(Redirected from Publication:486720)
Recommendations
- Global optimization of semi-infinite programs via restriction of the right-hand side
- Global optimization of generalized semi-infinite programs using disjunctive programming
- Global solution of semi-infinite programs
- Feasible method for generalized semi-infinite programming
- Generalized semi-infinite programming: numerical aspects
Cites work
- scientific article; zbMATH DE number 3810823 (Why is no real title available?)
- scientific article; zbMATH DE number 1186924 (Why is no real title available?)
- scientific article; zbMATH DE number 1047616 (Why is no real title available?)
- A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
- A hybrid algorithm for infinitely constrained optimization
- A nonconvex max-min problem
- A polyhedral branch-and-cut approach to global optimization
- A review of recent advances in global optimization
- Application of general semi-infinite programming to lapidary cutting problems
- Bi-level strategies in semi-infinite programming.
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Extensions of the Kuhn--Tucker Constraint Qualification to Generalized Semi-infinite Programming
- Feasible method for generalized semi-infinite programming
- First-order optimality conditions in generalized semi-infinite programming
- General semi-infinite programming: symmetric Mangasarian-Fromovitz constraint qualification and the closure of the feasible set
- Generalized semi-infinite optimization: A first order optimality condition and examples
- Generalized semi-infinite programming: Theory and methods
- Generalized semi-infinite programming: a tutorial
- Global optimisation of pessimistic bi-level problems
- Global optimization of semi-infinite programs via restriction of the right-hand side
- Global solution of bilevel programs with a nonconvex inner program
- Global solution of nonlinear mixed-integer bilevel programs
- Global solution of semi-infinite programs
- How to solve a semi-infinite optimization problem
- Infinitely constrained optimization problems
- Interval methods for semi-infinite programs
- Multivariate McCormick relaxations
- Obtaining accurate solutions using reduced chemical kinetic models: a new model reduction method for models rigorously validated over ranges
- On generalized semi-infinite optimization and bilevel optimization
- On linear and linearized generalized semi-infinite optimization problems
- On the closure of the feasible set in generalized semi-infinite programming
- Pessimistic bilevel optimization
- Relaxation-Based Bounds for Semi-Infinite Programs
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Robust optimization-methodology and applications
- Second-order optimality conditions in generalized semi-infinite programming
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
Cited in
(23)- Convergent upper bounds in global minimization with nonlinear equality constraints
- A branch and bound algorithm for quantified quadratic programming
- Adjustable robust optimal control for industrial \(2\)-Mercaptobenzothiazole production processes under uncertainty
- Recent advances in nonconvex semi-infinite programming: applications and algorithms
- An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence
- A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
- Global optimization of semi-infinite programs via restriction of the right-hand side
- Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming
- An algorithm based on semidefinite programming for finding minimax optimal designs
- A transformation-based discretization method for solving general semi-infinite optimization problems
- Global solution of semi-infinite programs with existence constraints
- Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints
- On the convergence of local solutions for the method quADAPT
- Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables
- Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization
- Local optimization of dynamic programs with guaranteed satisfaction of path constraints
- A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
- Feasible method for semi-infinite programs
- How to solve a design centering problem
- Lower level duality and the global solution of generalized semi-infinite programs
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
- Global optimization of generalized semi-infinite programs using disjunctive programming
This page was built for publication: Global optimization of generalized semi-infinite programs via restriction of the right hand side
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q486720)
