A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
From MaRDI portal
Publication:1675550
Recommendations
- Global optimization of semi-infinite programs via restriction of the right-hand side
- Global solution of semi-infinite programs
- Two algorithm frameworks based on discretization method and local reduction for semi-infinite programming
- Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables
- A combined descent gradient method and discretization method for convex SIP
Cites work
- 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 polyhedral branch-and-cut approach to global optimization
- A semi-infinite approach to design centering
- BARON: A general purpose global optimization software package
- Feasible method for generalized semi-infinite programming
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- 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
- scientific article; zbMATH DE number 1186924 (Why is no real title available?)
- Infinitely constrained optimization problems
- Interval methods for semi-infinite programs
- On generalized semi-infinite optimization and bilevel optimization
- Relaxation-Based Bounds for Semi-Infinite Programs
- Semi-infinite programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
Cited in
(18)- Estimating the robust domain of attraction for non-smooth systems using an interval Lyapunov equation
- Global solution of semi-infinite programs with existence constraints
- 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
- Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints
- Global optimization of semi-infinite programs via restriction of the right-hand side
- scientific article; zbMATH DE number 4170652 (Why is no real title available?)
- A combined descent gradient method and discretization method for convex SIP
- Two algorithm frameworks based on discretization method and local reduction for semi-infinite programming
- Recent advances in nonconvex semi-infinite programming: applications and algorithms
- Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming
- 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
- Convex semi-infinite programming algorithms with inexact separation oracles
- Optimizing flexibility in power systems by maximizing the region of manageable uncertainties
- Derivative-enhanced lower-Bounding in adaptive discretization for the global solution of semi-infinite optimization problems
This page was built for publication: A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675550)
