scientific article; zbMATH DE number 3677558

MaRDI QIDQ3873909zbMATH OpenFDO

Authors Klaus Roleff

Publication date 1979

zbMATH Keywords

computational comparisonsdual problemsemi-infinite programmingsimplex algorithmstable multiple exchange algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Specification and verification (program logics, model checking, etc.) (68Q60) Linear programming (90C05)

Cited in

(15)

• A comparative study of several semi-infinite nonlinear programming algorithms
• Geometric fundamentals of the simplex method in semi-infinite programming
• A purification algorithm for semi-infinite programming
• A multi-local optimization algorithm
• New descent rules for solving the linear semi-infinite programming problem
• A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming
• An extension of the simplex algorithm for semi-infinite linear programming
• An algorithm for calculating -minimax decision rules under generalized moment conditions.
• 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 smoothing Levenberg-Marquardt algorithm for semi-infinite programming
• Solving semi-infinite programs by smoothing projected gradient method
• Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
• A new smoothing Newton-type algorithm for 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 Q3873909)