✦ LIBER ✦

Local saddle point and a class of convexification methods for nonconvex optimization problems

✍ Scribed by Tao Li; Yanjun Wang; Zhian Liang; Panos M. Pardalos

Publisher: Springer US
Year: 2006
Tongue: English
Weight: 436 KB
Volume: 38
Category: Article
ISSN: 0925-5001
DOI: 10.1007/s10898-006-9090-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Convexification and existence of a saddl

Convexification and existence of a saddle point in a pth-power reformulation for nonconvex constrained optimization

✍ D. Li; X.L. Sun 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 369 KB

It is well-known that saddle point criteria is a sufficient optimality condition for constrained optimization problems. Convexity is a basic requirement for the development of duality theory and saddle point optimality. In this paper we show that, under some mild conditions, the local convexity of L

A class of iterative methods for solving

A class of iterative methods for solving saddle point problems

✍ Randolph E. Bank; Bruno D. Welfert; Harry Yserentant 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 829 KB

Convexification and Concavification for

Convexification and Concavification for a General Class of Global Optimization Problems

✍ Z. Y. Wu; F. S. Bai; L. S. Zhang 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 406 KB

A Class of Smoothers for Saddle Point Pr

A Class of Smoothers for Saddle Point Problems

✍ Walter Zulehner 📂 Article 📅 2000 🏛 Springer Vienna 🌐 English ⚖ 182 KB

Homotopy method for a class of nonconvex

Homotopy method for a class of nonconvex Brouwer fixed-point problems

✍ Bo Yu; Zhenghua Lin 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 400 KB

Zero duality gap for a class of nonconve

Zero duality gap for a class of nonconvex optimization problems

✍ D. Li 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 524 KB