scientific article
From MaRDI portal
Publication:3873909
zbMath0434.90057MaRDI QIDQ3873909
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
dual problemsimplex algorithmsemi-infinite programmingcomputational comparisonsstable multiple exchange algorithm
Numerical mathematical programming methods (65K05) Linear programming (90C05) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (15)
New descent rules for solving the linear semi-infinite programming problem ⋮ A comparative study of several semi-infinite nonlinear programming algorithms ⋮ Geometric fundamentals of the simplex method in semi-infinite programming ⋮ Global convergence of a class of smooth penalty methods for semi-infinite programming ⋮ Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method ⋮ On the numerical treatment of linearly constrained semi-infinite optimization problems ⋮ A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming ⋮ Solving semi-infinite programs by smoothing projected gradient method ⋮ A purification algorithm for semi-infinite programming ⋮ A new smoothing Newton-type algorithm for semi-infinite programming ⋮ Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme ⋮ A multi-local optimization algorithm ⋮ An extension of the simplex algorithm for semi-infinite linear programming ⋮ An algorithm for calculating \(\Gamma\)-minimax decision rules under generalized moment conditions. ⋮ A smoothing Levenberg-Marquardt algorithm for semi-infinite programming
This page was built for publication:
