A class of nondifferentiable complex programming problems
- 1 January 1975
- journal article
- research article
- Published by Taylor & Francis in Mathematische Operationsforschung und Statistik
- Vol. 6 (4) , 581-591
- https://doi.org/10.1080/02331887508801238
Abstract
Duality relations for various classes of complex nonlinear programming problems have recently appeared in the literaure. These problems are special cases of a complex programming problem whose objective function includes the square root of a quadratic form, and so may not be differentiable. For this problem, necessary and sufficient conditions are obtained for the existence of an optimal solution, and appropriate duality theorems are established.Keywords
This publication has 19 references indexed in Scilit:
- Nonlinear complex programmingJournal of Mathematical Analysis and Applications, 1973
- On duality in complex linear programmingJournal of the Australian Mathematical Society, 1973
- Nonlinear programming in complex spaceJournal of Mathematical Analysis and Applications, 1973
- Nonlinear programming in complex space: Sufficient conditions and dualityJournal of Mathematical Analysis and Applications, 1972
- Nonlinear Programming in Complex Space: Necessary ConditionsSIAM Journal on Control, 1971
- Nonlinear Nondifferentiable Programming in Complex SpacePublished by Elsevier ,1970
- A duality theorem for complex quadratic programmingJournal of Optimization Theory and Applications, 1969
- Nonlinear programming in complex spaceJournal of Mathematical Analysis and Applications, 1969
- Duality for nonlinear programming in complex spaceJournal of Mathematical Analysis and Applications, 1969
- Quadratic programming in complex spaceJournal of Mathematical Analysis and Applications, 1967