๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Smoothing Newton Method for Semi-Infinite Programming

โœ Scribed by Dong-Hui Li; Liqun Qi; Judy Tam; Soon-Yi Wu

Publisher
Springer US
Year
2004
Tongue
English
Weight
180 KB
Volume
30
Category
Article
ISSN
0925-5001

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

A one-step smoothing Newton method for s
A one-step smoothing Newton method for second-order cone programming
โœ Xiaoni Chi; Sanyang Liu ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 500 KB

A new smoothing function for the second-order cone programming is given by smoothing the symmetric perturbed Fischer-Burmeister function. Based on this new function, a one-step smoothing Newton method is presented for solving the second-order cone programming. The proposed algorithm solves only one

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