𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Global optimization for special reverse convex programming

✍ Scribed by Yanjun Wang; Ying Lan

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
254 KB
Volume
55
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A nonisolated optimal solution for speci
A nonisolated optimal solution for special reverse convex programming problems
✍ Pei-Ping Shen; Yong-Qiang Chen; Yuan Ma πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 696 KB

In this paper, an efficient algorithm is proposed for globally solving special reverse convex programming problems with more than one reverse convex constraints. The proposed algorithm provides a nonisolated global optimal solution which is also stable under small perturbations of the constraints, a

Characterizing global optimality for DC
Characterizing global optimality for DC optimization problems under convex inequality constraints
✍ V. Jeyakumar; B. M. Glover πŸ“‚ Article πŸ“… 1996 πŸ› Springer US 🌐 English βš– 801 KB

Characterizations of global optimality are given for general difference convex (DC) optimization problems involving convex inequality constraints. These results are obtained in terms of E-subdifferentials of the objective and constraint functions and do not require any regularity condition. An exten

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

Accelerating method of global optimizati
Accelerating method of global optimization for signomial geometric programming
✍ Pei-Ping Shen; Xiao-ai Li; Hong-Wei Jiao πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 179 KB

Signomial geometric programming (SGP) has been an interesting problem for many authors recently. Many methods have been provided for finding locally optimal solutions of SGP, but little progress has been made for global optimization of SGP. In this paper we propose a new accelerating method for glob