5 results
On subgradient duality with strong and weak convex functions
-
- Journal:
- Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics / Volume 40 / Issue 2 / April 1986
- Published online by Cambridge University Press:
- 09 April 2009, pp. 143-152
- Print publication:
- April 1986
-
- Article
-
- You have access
- Export citation
Duality theorems for convex programming without constraint qualification
-
- Journal:
- Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics / Volume 36 / Issue 2 / April 1984
- Published online by Cambridge University Press:
- 09 April 2009, pp. 253-266
- Print publication:
- April 1984
-
- Article
-
- You have access
- Export citation
Duality theorems and an optimality condition for non-differentiable convex programming
-
- Journal:
- Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics / Volume 32 / Issue 3 / June 1982
- Published online by Cambridge University Press:
- 09 April 2009, pp. 369-379
- Print publication:
- June 1982
-
- Article
-
- You have access
- Export citation
Facial reduction for a cone-convex programming problem
-
- Journal:
- Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics / Volume 30 / Issue 3 / February 1981
- Published online by Cambridge University Press:
- 09 April 2009, pp. 369-380
- Print publication:
- February 1981
-
- Article
-
- You have access
- Export citation
Optimality conditions for a cone-convex programming problem
-
- Journal:
- Journal of the Australian Mathematical Society. Series A. Pure Mathematics / Volume 27 / Issue 2 / March 1979
- Published online by Cambridge University Press:
- 09 April 2009, pp. 141-162
- Print publication:
- March 1979
-
- Article
-
- You have access
- Export citation