✦ LIBER ✦

Convex programming for disjunctive convex optimization

✍ Scribed by Sebastián Ceria; João Soares

Publisher: Springer-Verlag
Year: 1999
Tongue: English
Weight: 148 KB
Volume: 86
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s101070050106

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sequential convexification in reverse co

Sequential convexification in reverse convex and disjunctive programming

✍ Egon Balas; Joseph M. Tama; Jørgen Tind 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 718 KB

Global optimization for special reverse

Global optimization for special reverse convex programming

✍ Yanjun Wang; Ying Lan 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 254 KB

A convex analysis approach for convex mu

A convex analysis approach for convex multiplicative programming

✍ Rúbia M. Oliveira; Paulo A. V. Ferreira 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 200 KB

On optimality in abstract convex program

On optimality in abstract convex programming

✍ L. I. Trudzik 📂 Article 📅 1983 🏛 Springer 🌐 English ⚖ 730 KB

An optimality condition for a nondiffere

An optimality condition for a nondifferentiable convex program

✍ Henry Wolkowicz 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

Optimality conditions for convex semi-in

Optimality conditions for convex semi-infinite programming problems

✍ A. Ben-Tal; L. Kerzner; S. Zlobec 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 923 KB

## Abstract This paper gives characterization of optimal Solutions for convex semiinfinite programming problems. These characterizations are free of a constraint qualification assumption. Thus they overcome the deficiencies of the semiinfinite versions of the Fritz John and the Kuhn‐Tucker theories