✦ LIBER ✦

Nonlinear rescaling vs. smoothing technique in convex optimization

✍ Scribed by Roman A. Polyak

Publisher: Springer-Verlag
Year: 2002
Tongue: English
Weight: 310 KB
Volume: 92
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s101070100293

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Geodesic convexity in nonlinear optimiza

Geodesic convexity in nonlinear optimization

✍ T. Rapcsák 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 721 KB

Computation of Lyapunov functions for sm

Computation of Lyapunov functions for smooth nonlinear systems using convex optimization

✍ Tor A. Johansen 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 731 KB

Linearly parameterized non-quadratic Lyapunov-functions for smooth nonlinear systems are computed numerically using large-scale linear or quadratic programming.

Optimal processes in smooth-convex minim

Optimal processes in smooth-convex minimization problems

✍ Z. A. Tsintsadze 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 633 KB

Smoothing Technique and its Applications

Smoothing Technique and its Applications in Semidefinite Optimization

✍ Yurii Nesterov 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 154 KB

Directional derivatives of optimal solut

Directional derivatives of optimal solutions in smooth nonlinear programming

✍ J. F. Bonnans 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 827 KB

Quasi-convex functions and applications

Quasi-convex functions and applications to optimality conditions in nonlinear programming

✍ A. Hassouni; A. Jaddar 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 214 KB

## Communicated by F. Clarke Abstract--We establish necessary and sufficient optimality conditions for quasi-convex programming. First, we treat some properties of the normal cone to the level set of a lower semicontinuous quasi-convex function defined on a Banach space. Next, we get our condition