scientific article
From MaRDI portal
Publication:3858016
zbMath0423.90045MaRDI QIDQ3858016
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
linear semi-infinite programmingcutting plane methodslinear rate of convergencecentral-cutting-plane algorithm
Related Items (16)
The CoMirror algorithm with random constraint sampling for convex semi-infinite programming ⋮ Convergent Algorithms for a Class of Convex Semi-infinite Programs ⋮ A relaxed cutting plane algorithm for solving fuzzy inequality systems ⋮ Some outer approximation methods for semi-infinite optimization problems ⋮ A logarithmic barrier cutting plane method for convex programming ⋮ 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 ⋮ 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 ⋮ A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming ⋮ On the computation of reference signal constraints for guaranteed tracking performance ⋮ 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 ⋮ Near-optimal solutions of convex semi-infinite programs via targeted sampling
This page was built for publication:
