On subgradient duality with strong and weak convex functions
- 9 April 1986
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
- Vol. 40 (2) , 143-152
- https://doi.org/10.1017/s1446788700027130
Abstract
A duality theorem of Wolfe for nonlinear differentiable programs is extended to nondifferentiable programs with strong and weak convex functions, by replacing gradients by local subgradient. A converse duality theorem is also proved.Keywords
This publication has 10 references indexed in Scilit:
- Strong and Weak Convexity of Sets and FunctionsMathematics of Operations Research, 1983
- Strong convexity of sets and functionsJournal of Mathematical Economics, 1982
- More on subgradient dualityJournal of Mathematical Analysis and Applications, 1979
- Regularity and stability for the mathematical programming problem in Banach spacesApplied Mathematics & Optimization, 1979
- Mathematical Programming and Control TheoryPublished by Springer Nature ,1978
- A subgradient duality theoremJournal of Mathematical Analysis and Applications, 1977
- A New Approach to Lagrange MultipliersMathematics of Operations Research, 1976
- Geometric Functional Analysis and its ApplicationsPublished by Springer Nature ,1975
- Technical Note—On Converse Duality in Nonlinear ProgrammingOperations Research, 1971
- A duality theorem for non-linear programmingQuarterly of Applied Mathematics, 1961