✦ LIBER ✦

A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones

✍ Scribed by Xiao-Hong Liu; Zheng-Hai Huang

Publisher: Springer
Year: 2008
Tongue: English
Weight: 258 KB
Volume: 70
Category: Article
ISSN: 0340-9422
DOI: 10.1007/s00186-008-0274-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The convergence of a one-step smoothing

The convergence of a one-step smoothing Newton method for -NCP based on a new smoothing NCP-function

✍ Changfeng Ma; Xiaohong Chen 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 180 KB

The nonlinear complementarity problem (denoted by NCP(F)) can be reformulated as the solution of a nonsmooth system of equations. By introducing a new smoothing NCP-function, the problem is approximated by a family of parameterized smooth equations. A one-step smoothing Newton method is proposed for

A Full-Newton Step Infeasible Interior-P

A Full-Newton Step Infeasible Interior-Point Algorithm for Linear Programming Based on a Kernel Function

✍ Zhongyi Liu; Wenyu Sun; Fangbao Tian 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 340 KB

A polynomial-time algorithm for linear o

A polynomial-time algorithm for linear optimization based on a new class of kernel functions

✍ M. El Ghami; I. Ivanov; J.B.M. Melissen; C. Roos; T. Steihaug 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 721 KB

Polynomial-time algorithms for linear pr

Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function

✍ Robert M. Freund 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 826 KB