- Title
- An unconstrained convex programming approach to convex semi-infinite programming
- Creator
- Wu, Zhiyou; Sun, C.R.
- Date
- 2010
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/35111
- Identifier
- vital:4450
- Identifier
- ISSN:1492-8760
- Abstract
- A smooth convex penalty function method for solving a semi-infinite convex programming problem is proposed in this paper. The semi-finite convex programming problem can be successively solved by a sequence of smooth unconstrained convex programming problems, whose optimal solutions are convergent to the optimal set of the original problem. Some other convegence results are also established in this paper, and several numerical examples are included to illustrate our approach.
- Relation
- Dynamics of Continuous Discrete and Impulsive Systems Series B: Applications and Algorithms Vol. 17, no. 4 (2010), p. 581-598
- Rights
- Copyright Watam Press
- Rights
- This metadata is freely available under a CCO license
- Subject
- 0102 Applied Mathematics; Semi-infinite convex programming; Penalty function; Unconstrained convex programming approach
- Reviewed
- Hits: 512
- Visitors: 455
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|