✦ LIBER ✦

Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems

✍ Scribed by Ting-Jang Shiu, Soon-Yi Wu

Book ID: 118797852
Publisher: Springer US
Year: 2012
Tongue: English
Weight: 758 KB
Volume: 53
Category: Article
ISSN: 0926-6003
DOI: 10.1007/s10589-011-9452-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Relaxed Cutting Plane Method for Solving

Relaxed Cutting Plane Method for Solving Linear Semi-Infinite Programming Problems

✍ S. Y. Wu; S. C. Fang; C. J. Lin 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 622 KB

An Analytic Center Cutting Plane Method

An Analytic Center Cutting Plane Method for Solving Semi-Infinite Variational Inequality Problems

✍ Shu-Cherng Fang; Soon-Yi Wu; Jie Sun 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 102 KB

Cutting Plane Algorithms for Nonlinear S

Cutting Plane Algorithms for Nonlinear Semi-Definite Programming Problems with Applications

✍ Hiroshi Konno; Naoya Kawadai; Hoang Tuy 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 244 KB

A perturbation method for solving linear

A perturbation method for solving linear semi-infinite programming problems

✍ M.-H. Wang; Y.-E. Kuo 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 938 KB

Norm-relaxed method of feasible directio

Norm-relaxed method of feasible directions for solving nonlinear programming problems

✍ M. E. Cawood; M. M. Kostreva 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 364 KB

Solving convex programs with infinitely

Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method

✍ Soon-Yi Wu; S.-C. Fang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 541 KB

One of the major computational bottlenecks of using the conventional cutting plane approach to solve convex programming problems with infinitely many linear constraints lies in finding a global optimizer of a nonlinear and nonconvex program. This paper presents a relaxed scheme to generate a new cut