✦ LIBER ✦

A class of methods for solving large, convex quadratic programs subject to box constraints

✍ Scribed by Eugene K. Yang; Jon W. Tolle

Publisher: Springer-Verlag
Year: 1991
Tongue: English
Weight: 335 KB
Volume: 51
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01586934

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A class of methods for solving large con

A class of methods for solving large convex systems

✍ Ubaldo M. García-Palomares 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 347 KB

A sequential method for a class of box c

A sequential method for a class of box constrained quadratic programming problems

✍ Riccardo Cambini; Claudio Sodini 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 244 KB

Decomposition methods for solving a clas

Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions

✍ Le Dung Muu; Thai Quynh Phong; Pham Dinh Tao 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 704 KB

An algorithm for a singly constrained cl

An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds

✍ P. M. Pardalos; N. Kovoor 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 355 KB

A projection and contraction method for

A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming

✍ Bingsheng He 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 607 KB

Numerical method for a class of optimal

Numerical method for a class of optimal control problems subject to nonsmooth functional constraints

✍ C.Z. Wu; K.L. Teo; Yi Zhao 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 181 KB

In this paper, we consider a class of optimal control problems which is governed by nonsmooth functional inequality constraints involving convolution. First, we transform it into an equivalent optimal control problem with smooth functional inequality constraints at the expense of doubling the dimens