✦ LIBER ✦

Feasible directions algorithms for optimization problems with equality and inequality constraints

✍ Scribed by D. Q. Mayne; E. Polak

Publisher: Springer-Verlag
Year: 1976
Tongue: English
Weight: 704 KB
Volume: 11
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01580371

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A feasible directions algorithm for time

A feasible directions algorithm for time-lag optimal control problems with control and terminal inequality constraints

✍ K. L. Teo; K. H. Wong; D. J. Clements 📂 Article 📅 1985 🏛 Springer 🌐 English ⚖ 939 KB

On using equality-constraint algorithms

On using equality-constraint algorithms for inequality constrained problems

✍ J. P. Evans; F. J. Gould 📂 Article 📅 1972 🏛 Springer-Verlag 🌐 English ⚖ 262 KB

Convergence of a feasible directions alg

Convergence of a feasible directions algorithm for a distributed optimal control problem of parabolic type with terminal inequality constraints

✍ K. L. Teo; S. J. Wilson 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 541 KB

On Abnormal Optimal Control Problems wit

On Abnormal Optimal Control Problems with Mixed Equality and Inequality Constraints

✍ U. Ledzewicz 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 673 KB

Algorithms for optimization problems wit

Algorithms for optimization problems with exclusion constraints

✍ D. Q. Mayne; E. Polak 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 788 KB

FEASIBLE DESCENT CONE METHODS FOR INEQUA

FEASIBLE DESCENT CONE METHODS FOR INEQUALITY CONSTRAINED OPTIMIZATION PROBLEMS

✍ J. A. SNYMAN; N. STANDER 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 784 KB

A new Feasible Descent Cone (FDC) method for constrained optimization, previously restricted to linear objectives, is here generalized to include non-linear objective functions as well. In the basic and exact algorithm a sequence of descent steps is taken through the interior of the feasible region