✦ LIBER ✦

An Interior Point Constrained Trust Region Method for a Special Class of Nonlinear Semidefinite Programming Problems

✍ Scribed by Leibfritz, F.; Mostafa, E. M. E.

Book ID: 118205039
Publisher: Society for Industrial and Applied Mathematics
Year: 2002
Tongue: English
Weight: 283 KB
Volume: 12
Category: Article
ISSN: 1052-6234
DOI: 10.1137/s1052623400375865

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A trust region method based on interior

A trust region method based on interior point techniques for nonlinear programming

✍ Richard H. Byrd; Jean Charles Gilbert; Jorge Nocedal 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 225 KB

A primal-dual interior point method for

A primal-dual interior point method for parametric semidefinite programming problems

✍ Wang Zhemin; Zhou Kunping; Huang Zhenghai 📂 Article 📅 2000 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 431 KB

Interior point projected reduced Hessian

Interior point projected reduced Hessian method with trust region strategy for nonlinear constrained optimization

✍ Detong Zhu 📂 Article 📅 2004 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 663 KB

An Interior-Point Method for a Class of

An Interior-Point Method for a Class of Saddle-Point Problems

✍ B.V. Halldórsson; R.H. Tütüncü 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 169 KB

Local and superlinear convergence of a p

Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming

✍ Hiroshi Yamashita; Hiroshi Yabe 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 293 KB

Parallel computational issues of an inte

Parallel computational issues of an interior point method for solving large bound-constrained quadratic programming problems

✍ M. D’Apuzzo; M. Marino 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 181 KB

This paper deals with a parallel implementation of an interior point algorithm for solving sparse convex quadratic programs with bound constraints. The parallelism is introduced at the linear algebra level. Concerning the solution of the linear system arising at each step of the considered algorithm