scholarly journals A general sufficiency theorem for nonsmooth nonlinear programming

1983 ◽  
Vol 276 (1) ◽  
pp. 235-235 ◽  
Author(s):  
R. W. Chaney
Keyword(s):  
Nonlinear Programming ◽  
Sufficiency Theorem

scholarly journals Sufficient Fritz John optimality conditions for nondifferentiable convex programming

1976 ◽  
Vol 19 (4) ◽  
pp. 462-468 ◽  
Author(s):  
B. D. Craven ◽  
B. Mond
Keyword(s):  
Nonlinear Programming ◽  
Optimality Conditions ◽  
Programming Problem ◽  
Convex Programming ◽  
Necessary Conditions ◽  
Nonlinear Programming Problem ◽  
Necessary Conditions For Optimality ◽  
Ordered Space ◽  
Sufficiency Theorem ◽  
Fritz John Optimality Conditions

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.

Link Loss Inference Algorithm with Nonlinear Programming

2012 ◽  
Vol 34 (6) ◽  
pp. 1425-1431
Author(s):  
Ran Gu ◽  
Xue-song Qiu ◽  
Yan Qiao ◽  
Juan Li ◽  
Luo-ming Meng
Keyword(s):  
Nonlinear Programming ◽  
Inference Algorithm ◽  
Link Loss

User's Guide for NPSOL (Version 4.0): A Fortran Package for Nonlinear Programming.

1986 ◽  
Author(s):  
Philip E. Gill ◽  
Walter Murray ◽  
Michael A. Saunders ◽  
Margaret H. Wright
Keyword(s):  
Nonlinear Programming
Sign in / Sign up

Export Citation Format

Share Document