Global optimization of semi-infinite programs via restriction of the right-hand side
From MaRDI portal
Publication:3111137
DOI10.1080/02331934.2010.527970zbMATH Open1231.90361OpenAlexW1974300932MaRDI QIDQ3111137FDOQ3111137
Authors: Alexander Mitsos 
Publication date: 18 January 2012
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2010.527970
Recommendations
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- Global solution of semi-infinite programs
- A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
- Relaxation-Based Bounds for Semi-Infinite Programs
- Interval methods for semi-infinite programs
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Mixed integer programming (90C11) Semi-infinite programming (90C34)
Cites Work
- BARON: A general purpose global optimization software package
- McCormick-Based Relaxations of Algorithms
- Global solution of bilevel programs with a nonconvex inner program
- Infinitely constrained optimization problems
- A polyhedral branch-and-cut approach to global optimization
- On generalized semi-infinite optimization and bilevel optimization
- Global solution of nonlinear mixed-integer bilevel programs
- Semi-Infinite Programming: Theory, Methods, and Applications
- A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
- Semi-infinite programming
- Global solution of semi-infinite programs
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Generalized semi-infinite programming: a tutorial
- Interval methods for semi-infinite programs
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- Relaxation-Based Bounds for Semi-Infinite Programs
- Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
- Obtaining accurate solutions using reduced chemical kinetic models: a new model reduction method for models rigorously validated over ranges
Cited In (35)
- Convergent upper bounds in global minimization with nonlinear equality constraints
- On sample average approximation for two-stage stochastic programs without relatively complete recourse
- A branch and bound algorithm for quantified quadratic programming
- A new approach for nonconvex SIP
- Recent advances in nonconvex semi-infinite programming: applications and algorithms
- Optimal deterministic algorithm generation
- An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence
- Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints
- 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
- Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming
- Relaxation-Based Bounds for Semi-Infinite Programs
- Integration of expert knowledge into radial basis function surrogate models
- 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
- EAGO.jl: easy advanced global optimization in Julia
- A standard branch-and-bound approach for nonlinear semi-infinite problems
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- Global solution of semi-infinite programs
- Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables
- 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
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- Guaranteed satisfaction of inequality state constraints in PDE-constrained optimization
- Convergent Algorithms for a Class of Convex Semi-infinite Programs
- Dynamic optimization of state-dependent switched systems with free switching sequences
- Feasible method for semi-infinite programs
- How to solve a semi-infinite optimization problem
- How to solve a design centering problem
- Towards rigorous robust optimal control via generalized high-order moment expansion
- Interval methods for semi-infinite programs
- Lower level duality and the global solution of generalized semi-infinite programs
- Global optimization of generalized semi-infinite programs using disjunctive programming
- Near-optimal solutions of convex semi-infinite programs via targeted sampling
Uses Software
This page was built for publication: Global optimization of 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 Q3111137)
