𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on an implementation of a method for quadratic semi-infinite programming

✍ Scribed by R. Hettich; G. Gramlich

Publisher
Springer-Verlag
Year
1990
Tongue
English
Weight
217 KB
Volume
46
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A dual parameterization algorithm for li
A dual parameterization algorithm for linear quadratic semi-infinite programming problems
✍ 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

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

A smoothing Newton method for a type of
A smoothing Newton method for a type of inverse semi-definite quadratic programming problem
✍ Xiantao Xiao; Liwei Zhang; Jianzhong Zhang πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 629 KB

We consider an inverse problem arising from the semi-definite quadratic programming (SDQP) problem. We represent this problem as a cone-constrained minimization problem and its dual (denoted ISDQD) is a semismoothly differentiable (SC 1 ) convex programming problem with fewer variables than the orig