✦ LIBER ✦

On the application of sequential quadratic programming to state constrained optimal control problems

✍ Scribed by J.L de Jong; K.C.P Machielsen

Publisher: Elsevier Science
Year: 1985
Weight: 750 KB
Volume: 13
Category: Article
ISSN: 0066-4138
DOI: 10.1016/0066-4138(85)90460-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the orthogonal collocation and mathem

On the orthogonal collocation and mathematical programming approach for state constrained optimal control problems

✍ O.E Abdelrahman; B.M Abuelnasr 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 606 KB

An application of duality to distributed

An application of duality to distributed optimal control problems with constraints on the control and the state

✍ J Mossino 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 767 KB

A state constrained optimal control prob

A state constrained optimal control problem related to the sterilization of canned foods

✍ A. Bermudez; A. Martinez 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 766 KB

Optimal control methods are used to improve the industrial process for sterilization of canned foods. The objective is to minimize degradation of nutrients and to save energy.

Applications of the exterior penalty met

Applications of the exterior penalty method in constrained optimal control problems

✍ An-Qing Xing; Chung-Lie Wang 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 508 KB

State parameterization approach to the s

State parameterization approach to the solution of optimal control problems

✍ H. R. Sirisena; F. S. Chou 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 558 KB

The FETI family of domain decomposition

The FETI family of domain decomposition methods for inequality-constrained quadratic programming: Application to contact problems with conforming and nonconforming interfaces

✍ Philip Avery; Charbel Farhat 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 372 KB

Two domain decomposition methods with Lagrange multipliers for solving iteratively quadratic programming problems with inequality constraints are presented. These methods are based on the FETI and FETI-DP substructuring algorithms. In the case of linear constraints, they do not perform any Newton-li