Pages that link to "Item:Q1343650"
From MaRDI portal
The following pages link to Some outer approximation methods for semi-infinite optimization problems (Q1343650):
Displaying 13 items.
- Scenario approximation of robust and chance-constrained programs (Q368719) (← links)
- A multi-local optimization algorithm (Q1265238) (← links)
- Convex semi-infinite parametric programming: Uniform convergence of the optimal value functions of discretized problems (Q1293961) (← links)
- A globally most violated cutting plane method for complex minimax problems with application to digital filter design (Q1315252) (← links)
- Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems (Q1372035) (← links)
- Approximate cutting plane approaches for exact solutions to robust optimization problems (Q2301927) (← links)
- Robust envelope-constrained filter with orthonormal bases and semi-definite and semi-infinite programming (Q2454635) (← links)
- A transformation-based discretization method for solving general semi-infinite optimization problems (Q2661756) (← links)
- Logarithmic Barrier Decomposition Methods for Semi-infinite Programming (Q3842985) (← links)
- A solution method for combined semi-infinite and semi-definite programming (Q4831772) (← links)
- An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence (Q5093681) (← links)
- A survey of nonlinear robust optimization (Q5882395) (← links)
- On the convergence of local solutions for the method quADAPT (Q6618212) (← links)
