✦ LIBER ✦

A subgradient selection method for minimizing convex functions subject to linear constraints

✍ Scribed by Kryzstof C. Kiwiel

Publisher: Springer Vienna
Year: 1987
Tongue: English
Weight: 581 KB
Volume: 39
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02239973

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A constraint linearization method for no

A constraint linearization method for nondifferentiable convex minimization

✍ Krzysztof C. Kiwiel 📂 Article 📅 1987 🏛 Springer-Verlag 🌐 English ⚖ 934 KB

Minimizing a quasi-concave function subj

Minimizing a quasi-concave function subject to a reverse convex constraint

✍ L. V. Dien 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 429 KB

On the minimization of a quasi-concave f

On the minimization of a quasi-concave function subject to linear constraints

✍ Ubaldo García-Palomares; William Colmenares 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 300 KB

Convergence of a Tuy-type algorithm for

Convergence of a Tuy-type algorithm for concave minimization subject to linear inequality constraints

✍ Stephen E. Jacobsen 📂 Article 📅 1981 🏛 Springer 🌐 English ⚖ 539 KB

A class of methods for solving large, co

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

✍ Eugene K. Yang; Jon W. Tolle 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 335 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