The following pages link to (Q3858016):
Displayed 16 items.
- An inexact primal-dual algorithm for semi-infinite programming (Q784788) (← links)
- The CoMirror algorithm with random constraint sampling for convex semi-infinite programming (Q828836) (← links)
- On the computation of reference signal constraints for guaranteed tracking performance (Q1195802) (← links)
- Some outer approximation methods for semi-infinite optimization problems (Q1343650) (← links)
- A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming (Q1433470) (← links)
- A logarithmic barrier cutting plane method for convex programming (Q1904709) (← links)
- An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems (Q1935707) (← links)
- Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method (Q1963110) (← links)
- Relaxed cutting plane method for solving linear semi-infinite programming problems (Q1969533) (← links)
- Near-optimal solutions of convex semi-infinite programs via targeted sampling (Q2095909) (← links)
- A nonsmooth Levenberg-Marquardt method for solving semi-infinite programming problems (Q2390009) (← links)
- A relaxed cutting plane algorithm for solving the Vasicek-type forward interest rate model (Q2655624) (← links)
- A relaxed cutting plane algorithm for solving fuzzy inequality systems (Q4265518) (← links)
- Convergent Algorithms for a Class of Convex Semi-infinite Programs (Q5043283) (← links)
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme (Q5936072) (← links)
- Solving fuzzy variational inequalities over a compact set (Q5936077) (← links)