𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A homotopy interior point method for semi-infinite programming problems

✍ Scribed by Guo-xin Liu

Publisher
Springer US
Year
2006
Tongue
English
Weight
239 KB
Volume
37
Category
Article
ISSN
0925-5001

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Optimality conditions for convex semi-in
Optimality conditions for convex semi-infinite programming problems
✍ A. Ben-Tal; L. Kerzner; S. Zlobec πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 923 KB

## Abstract This paper gives characterization of optimal Solutions for convex semiinfinite programming problems. These characterizations are free of a constraint qualification assumption. Thus they overcome the deficiencies of the semiinfinite versions of the Fritz John and the Kuhn‐Tucker theories

A globally convergent method for semi-in
A globally convergent method for semi-infinite linear programming
✍ H. Hu πŸ“‚ Article πŸ“… 1996 πŸ› Springer US 🌐 English βš– 541 KB

This paper presents a globally convergent method for solving a general semi-infinite linear programming problem. Some important features of this method include: It can solve a semi-infinite linear program having an unbounded feasible region. It requires an inexact solution to a nonlinear subproblem