Relaxation-Based Bounds for Semi-Infinite Programs
From MaRDI portal
Recommendations
Cited in
(35)- Global solution of bilevel programs with a nonconvex inner program
- A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
- Interval methods for semi-infinite programs
- Global solution of semi-infinite programs
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
- An algorithm for semi-infinite polynomial optimization
- A generalization of the classical BB convex underestimation via diagonal and nondiagonal quadratic terms
- A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
- Global solution of nonlinear mixed-integer bilevel programs
- Global solution of semi-infinite programs with existence constraints
- Fault tolerant time optimization for a class of time-varying switched infinite dimensional linear systems
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
- Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables
- How to solve a semi-infinite optimization problem
- Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints
- A standard branch-and-bound approach for nonlinear semi-infinite problems
- Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints
- Lower level duality and the global solution of generalized semi-infinite programs
- Global optimization of semi-infinite programs via restriction of the right-hand side
- Towards rigorous robust optimal control via generalized high-order moment expansion
- Feasible method for semi-infinite programs
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- MPEC methods for bilevel optimization problems
- Recent advances in nonconvex semi-infinite programming: applications and algorithms
- A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming
- Min-max and robust polynomial optimization
- Convergence rate of McCormick relaxations
- Bounding-focused discretization methods for the global optimization of nonconvex semi-infinite programs
- Discretization algorithms for generalized semi-infinite programs with coupling equality constraints under local solution stability
- Derivative-enhanced lower-Bounding in adaptive discretization for the global solution of semi-infinite optimization problems
- A provable semi-infinite programming approach for solving constrained dynamic games
- A review of recent advances in global optimization
- Towards global bilevel dynamic optimization
- Local optimization of dynamic programs with guaranteed satisfaction of path constraints
This page was built for publication: Relaxation-Based Bounds for Semi-Infinite Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608973)
