Generalized concavity and duality with a square root term
- 1 January 1985
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 16 (5) , 653-662
- https://doi.org/10.1080/02331938508843062
Abstract
Duality results for a class of nondifferentiable mathematical programming problems are given. These results allow for the weakening of the usual convexity conditions required for duality to hold. A pair of symmetric and self dual nondifferentiable programs under weaker convexity conditions are also given. A subgradient symmetric duality is proposed and its limitations discussed. Finally, a pair of nondifferentiable mathematical programs containing arbitrary norms is presented.Keywords
This publication has 16 references indexed in Scilit:
- An optimality condition for a nondifferentiable convex programNaval Research Logistics Quarterly, 1983
- Symmetric dual nondifferentiable programsBulletin of the Australian Mathematical Society, 1981
- More on subgradient dualityJournal of Mathematical Analysis and Applications, 1979
- A class of programming problems whose objective function contains a normJournal of Approximation Theory, 1978
- A note on the sum of a linear and linear‐fractional functionNaval Research Logistics Quarterly, 1977
- On a constraint qualification in a nondifferentiable programming problemNaval Research Logistics Quarterly, 1976
- A programming problem with anLpnorm in the objective functionThe Journal of the Australian Mathematical Society. Series B. Applied Mathematics, 1976
- A class of nondifferentiable mathematical programming problemsJournal of Mathematical Analysis and Applications, 1974
- Symmetric dual nonlinear programsPacific Journal of Mathematics, 1965
- Supports of a convex functionBulletin of the American Mathematical Society, 1962