Global optimization of semi-infinite programs via restriction of the right-hand side
From MaRDI portal
Publication:3111137
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
Cites work
- A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
- A polyhedral branch-and-cut approach to global optimization
- BARON: A general purpose global optimization software package
- Generalized semi-infinite programming: a tutorial
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Global solution of bilevel programs with a nonconvex inner program
- Global solution of nonlinear mixed-integer bilevel programs
- Global solution of semi-infinite programs
- Infinitely constrained optimization problems
- Interval methods for semi-infinite programs
- McCormick-Based Relaxations of Algorithms
- 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
- Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
- Relaxation-Based Bounds for Semi-Infinite Programs
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semi-infinite programming
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
Cited in
(35)- Near-optimal solutions of convex semi-infinite programs via targeted sampling
- A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
- Convergent upper bounds in global minimization with nonlinear equality constraints
- How to solve a semi-infinite optimization problem
- Global solution of semi-infinite programs
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
- Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints
- Local optimization of dynamic programs with guaranteed satisfaction of path constraints
- Global solution of semi-infinite programs with existence constraints
- A new approach for nonconvex SIP
- On the convergence of local solutions for the method quADAPT
- Interval methods for semi-infinite programs
- Convergent Algorithms for a Class of Convex Semi-infinite Programs
- How to solve a design centering problem
- A branch and bound algorithm for quantified quadratic programming
- A standard branch-and-bound approach for nonlinear semi-infinite problems
- Global optimization of generalized semi-infinite programs using disjunctive programming
- Optimal deterministic algorithm generation
- Lower level duality and the global solution of generalized semi-infinite programs
- Recent advances in nonconvex semi-infinite programming: applications and algorithms
- Relaxation-Based Bounds for Semi-Infinite Programs
- Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints
- Dynamic optimization of state-dependent switched systems with free switching sequences
- A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
- Integration of expert knowledge into radial basis function surrogate models
- On sample average approximation for two-stage stochastic programs without relatively complete recourse
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming
- Towards rigorous robust optimal control via generalized high-order moment expansion
- An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence
- Feasible method for semi-infinite programs
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- EAGO.jl: easy advanced global optimization in Julia
- Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables
- Guaranteed satisfaction of inequality state constraints in PDE-constrained optimization
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)
