scientific article; zbMATH DE number 3659282
From MaRDI portal
Publication:3858016
Cited in
(16)- On the computation of reference signal constraints for guaranteed tracking performance
- Some outer approximation methods for semi-infinite optimization problems
- A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming
- A logarithmic barrier cutting plane method for convex programming
- An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems
- Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method
- Relaxed cutting plane method for solving linear semi-infinite programming problems
- Near-optimal solutions of convex semi-infinite programs via targeted sampling
- A nonsmooth Levenberg-Marquardt method for solving semi-infinite programming problems
- A relaxed cutting plane algorithm for solving the Vasicek-type forward interest rate model
- A relaxed cutting plane algorithm for solving fuzzy inequality systems
- Convergent Algorithms for a Class of Convex Semi-infinite Programs
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
- Solving fuzzy variational inequalities over a compact set
- An inexact primal-dual algorithm for semi-infinite programming
- The CoMirror algorithm with random constraint sampling for convex semi-infinite programming
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3858016)
