✦ LIBER ✦

New decomposition and convexification algorithm for nonconvex large-scale primal-dual optimization

✍ Scribed by X. Feng; H. Mukai; R. H. Brown

Publisher: Springer
Year: 1990
Tongue: English
Weight: 849 KB
Volume: 67
Category: Article
ISSN: 0022-3239
DOI: 10.1007/bf00940477

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New dual-type decomposition algorithm fo

New dual-type decomposition algorithm for nonconvex separable optimization problems

✍ P. Tatjewski 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 776 KB

Although the augmented Lagrange function is not separable, suitable reformulation of this function and introduction of auxiliary variables lead to a decomposition algorithm with simple and efficient adjusting rules for upper level variables.

A Class of Large-Update and Small-Update

A Class of Large-Update and Small-Update Primal-Dual Interior-Point Algorithms for Linear Optimization

✍ Y. Q. Bai; G. Lesaja; C. Roos; G. Q. Wang; M. El Ghami 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 363 KB

A globally and superlinearly convergent

A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization

✍ Hiroshi Yamashita; Hiroshi Yabe; Takahito Tanabe 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 302 KB