A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming

DOI10.1016/0898-1221(95)00025-TzbMath0831.90113MaRDI QIDQ1894948

Soon-Yi Wu, Shu-Cherng Fang, Ruey-Lin Sheu

Publication date: 25 February 1996

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

linear semi-infinite programmingprimal-dual infeasible-interior-point method

Mathematics Subject Classification ID

Linear programming (90C05) Semi-infinite programming (90C34)

Related Items (3)

A new smoothing Newton-type algorithm for semi-infinite programming ⋮ Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme ⋮ Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints

Cites Work

• Infinite programming. Proceedings of an International Symposium on Infinite Dimensional Linear Programming, Churchill College, Cambridge, United Kingdom, September 7-10, 1984
• A primal-dual infeasible-interior-point algorithm for linear programming
• Semi-infinite programming and applications. An International Symposium, Austin, Texas, September 8-10, 1981
• Ein Konstruktionsverfahren bei allgemeiner linearer Approximation
• The continuous complementarity problem
• An inexact approach to solving linear semi-infinite programming problems
• On Linear Semi-Infinite Programming Problems: An Algorithm
• Numerical treatment of a class of semi‐infinite programming problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming