𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parametric linear semi-infinite programming

✍ Scribed by C.-J. Lin; S.-C. Fang; Soon-Yi Wu


Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
503 KB
Volume
9
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A globally convergent method for semi-in
✍ 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

Solving min-max problems and linear semi
✍ S.-C. Fang; Soon-Yi Wu πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 309 KB

For a min-max problem in the form of minxEx maxtET {A(X)}, the nondi\_fferentiability of the max function F(x) --maxtET {ft(x)} presents special difficulty in finding optimal solutions. We show that an entropic regularization procedure can provide a smooth approximation Fp(x) that uniformly converge

A dual parameterization algorithm for li
✍ Y. Liu; K.L. Teo πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 461 KB

In this paper, we consider a class of \(\mathrm{LQ}\) semi-infinite programming (SIP) problems where the objective function is positive quadratic and the linear infinite constraint functions continuously depend on its index variable on a compact set. By using the dual parameterization technique, thi