Sufficient Fritz John optimality conditions for nondifferentiable convex programming-Reference-Cited by-同舟云学术

Sufficient Fritz John optimality conditions for nondifferentiable convex programming

Published:1976-12 Issue:4 Volume:19 Page:462-468
ISSN:0334-2700
Container-title:The Journal of the Australian Mathematical Society. Series B. Applied Mathematics
language:en
Short-container-title:J. Aust. Math. Soc. Series B, Appl. Math

Author:

Craven B. D.,Mond B.

Abstract

AbstractThe Fritz John necessary conditions for optimality of a differentiable nonlinear programming problem have been shown, given additional convexity hypotheses, to be also sufficient (by Gulati, Craven, and others). This sufficiency theorem is now extended to minimization (suitably defined) of a function taking values in a partially ordered space, and to (convex) objective and constraint functions which are not always differentiable. The results are expressed in terms of subgradients.

Publisher

Cambridge University Press (CUP)

Subject

Applied Mathematics

Reference13 articles.

1. [1] Bector C. R. , Chandra Suresh , and Gulati T. R. , Complex nonlinear programming with equality constraints, Proc. Fourth Manitoba Conference on Numerical Mathematics (1974), 205–216.

2. [2] Bector C. R. and Gulati T. R. , Sufficient optimality conditions in presence of quasiconvex equality and inequality constraints, Zeitschrift für Mathematische Operationsforschung und Statistik, to appear.

3. Conjugate Duality and Optimization

4. [9] Craven B. D. and Mond B. , Lagrangean conditions for quasidifferentiable optimization, University of Melbourne, School of Mathematical Sciences, Research Report No. 7 (1976).

5. [3] Borwein J. M. . Optimization with respect to partial orderings. D. Phil. thesis, Oxford, 1974.

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Geometric branch-and-bound methods for constrained global optimization problems;Journal of Global Optimization;2012-08-04

2. Duality in Vector Optimization;Vector Optimization;2009

3. A NOTE ON MOND-WEIR TYPE SECOND-ORDER SYMMETRIC DUALITY;Asia-Pacific Journal of Operational Research;2007-10

4. Mixed symmetric duality for nondifferentiable programming problems;OPSEARCH;2006-09

5. NONDIFFERENTIABLE SECOND-ORDER SYMMETRIC DUALITY;Asia-Pacific Journal of Operational Research;2005-03