Mixed symmetric duality in nondifferentiable mathematical programming
Abstract
A mixed symmetric dual formulation is presented for a class of nondifferentiable nonlinear programming problems with multiple arguments. Weak, strong and converse duality theorems are established. The mixed symmetric dual formulation unifies the two existing symmetric dual formulations in the literature.
Citation
Yang, Xin and Teo, Kok and Yang, Xiao. 2003. Mixed symmetric duality in nondifferentiable mathematical programming. Indian Journal of Pure and Applied Mathematics. 34 (5): pp. 805-815.
Source Title
Indian Journal of Pure and Applied Mathematics
ISSN
Faculty
School of Science and Computing
Department of Mathematics and Statistics
Faculty of Science and Engineering
Collection
Related items
Showing items related by title, author, creator and subject.
-
Su, Chao; Wang, Wei; Liu, M.; Tadé, Moses; Shao, Zongping (2015)Symmetrical solid oxide fuel cells (SOFCs) have attracted increasing attention due to their potential for improved thermomechanical compatibility of the electrolyte and the electrodes, reduced fabrication cost, and enhanced ...
-
Zhang, G.; Wang, S.; Liu, Wan-quan; Zuo, Z. (2009)This paper deals with the problem of H∞ norm computation for general symmetric systems and descriptor symmetric systems. The computation of H∞ norm for state-space symmetric systems is extended to descriptor symmetric ...
-
Gamble, Gregory; Simpson, Jamie (2013)A collection of sets is symmetric-difference-free, respectively symmetric difference-closed, if the symmetric difference of any two sets in the collection lies outside, respectively inside, the collection. Recently Buck ...