✦ LIBER ✦

A feasible direction algorithm for convex optimization: Global convergence rates

✍ Scribed by J. C. Allwright

Publisher: Springer
Year: 1980
Tongue: English
Weight: 842 KB
Volume: 30
Category: Article
ISSN: 0022-3239
DOI: 10.1007/bf00934585

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Convergence rates of a global optimizati

Convergence rates of a global optimization algorithm

✍ Regina Hunter Mladineo 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 460 KB

Global convergence rates for descent alg

Global convergence rates for descent algorithms: Improved results for strictly convex problems

✍ J. C. Allwright 📂 Article 📅 1978 🏛 Springer 🌐 English ⚖ 223 KB

New convergence theorems for a class of

New convergence theorems for a class of feasible directions algorithms

✍ E. Polak; S. Tishyadhigama 📂 Article 📅 1982 🏛 Springer 🌐 English ⚖ 603 KB

A globally convergent interior point alg

A globally convergent interior point algorithm for non-convex nonlinear programming

✍ Xiaona Fan 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 393 KB

A simple feasible SQP method for inequal

A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence

✍ Zhong Jin; Yuqing Wang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 750 KB

In this paper, a simple feasible SQP method for nonlinear inequality constrained optimization is presented. At each iteration, we need to solve one QP subproblem only. After solving a system of linear equations, a new feasible descent direction is designed. The Maratos effect is avoided by using a h

Convergence of a feasible directions alg

Convergence of a feasible directions algorithm for relaxed controls in time-lag systems

✍ S. J. Wilson; K. H. Wong 📂 Article 📅 1987 🏛 Springer 🌐 English ⚖ 572 KB