✦ LIBER ✦

A quadratically-convergent algorithm for general nonlinear programming problems

✍ Scribed by Stephen M. Robinson

Publisher: Springer-Verlag
Year: 1972
Tongue: English
Weight: 458 KB
Volume: 3-3
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01584986

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A globally and quadratically convergent

A globally and quadratically convergent algorithm for general nonlinear programming problems

✍ M. J. Best; J. Bräuninger; K. Ritter; S. M. Robinson 📂 Article 📅 1981 🏛 Springer Vienna 🌐 English ⚖ 625 KB

A globally convergent version of Robinso

A globally convergent version of Robinson's algorithm for general nonlinear programming problems without using derivatives

✍ J. Bräuninger 📂 Article 📅 1981 🏛 Springer 🌐 English ⚖ 815 KB

A quadratically convergent O((sqrt n )L)

A quadratically convergent O((sqrt n )L)-iteration algorithm for linear programming

✍ Y. Ye; O. Güler; R. A. Tapia; Y. Zhang 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 643 KB

Convergence conditions for nonlinear pro

Convergence conditions for nonlinear programming algorithms

✍ E. A. Nurminskii 📂 Article 📅 1974 🏛 Springer US 🌐 English ⚖ 228 KB

Convergence bounds for nonlinear program

Convergence bounds for nonlinear programming algorithms

✍ Robert Mifflin 📂 Article 📅 1975 🏛 Springer-Verlag 🌐 English ⚖ 892 KB

Quadratic programming algorithms for obs

Quadratic programming algorithms for obstacle problems

✍ Doukhovni, Ilia ;Givoli, Dan 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 446 KB

The numerical solution of problems involving frictionless contact between an elastic body and a rigid obstacle is considered. The elastic body may undergo small or large deformation. Finite element discretization and repetitive linearization lead to a sequence of quadratic programming (QP) problems