The following pages link to (Q3668370):
Displaying 12 items.
- A ladder method for linear semi-infinite programming (Q380573) (← links)
- On stable uniqueness in linear semi-infinite optimization (Q454262) (← links)
- Variational analysis on local sharp minima via exact penalization (Q505627) (← links)
- An interior semi-infinite programming method (Q1093544) (← links)
- Geometric fundamentals of the simplex method in semi-infinite programming (Q1117839) (← links)
- A semi-infinite programming method for approximating load duration curves by polynomials (Q1206798) (← links)
- Some outer approximation methods for semi-infinite optimization problems (Q1343650) (← links)
- An extension of the simplex algorithm for semi-infinite linear programming (Q1824547) (← links)
- A projected lagrangian algorithm for semi-infinite programming (Q3690591) (← links)
- An implementation of a discretization method for semi-infinite programming (Q3722265) (← links)
- Convergent Algorithms for a Class of Convex Semi-infinite Programs (Q5043283) (← links)
- Relax-and-split method for nonconvex inverse problems (Q5123708) (← links)
