Sufficient optimality conditions in continuous-time nonlinear programming

DOI10.1016/0022-247X(85)90206-9MaRDI QIDQ1067197zbMATH OpenFDO

Authors G. J. Zalmai

Publication date 1985

Published in Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

continuous-time nonlinear programmingsufficient optimality criteria

Mathematics Subject Classification ID

Fractional programming (90C32) Nonlinear programming (90C30) Optimality conditions for problems involving ordinary differential equations (49K15) Nonlinear systems in control theory (93C10) Optimality conditions for free problems in two or more independent variables (49K10)

Recommendations

• Optimality criteria and duality for nonlinear fractional continuous-time programming
• Sufficient Fritz John optimality criteria and duality for continuous programming problems
• Optimality conditions and Lagrangian duality in continuous-time nonlinear programming
• Sufficiency in nonlinear programming: A unified theorem
• The Fritz John and Kuhn-Tucker optimality conditions in continuous-time nonlinear programming

Cites work

• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 3662900 (Why is no real title available?)
• scientific article; zbMATH DE number 3456685 (Why is no real title available?)
• scientific article; zbMATH DE number 3438637 (Why is no real title available?)
• scientific article; zbMATH DE number 3448348 (Why is no real title available?)
• scientific article; zbMATH DE number 3238722 (Why is no real title available?)
• scientific article; zbMATH DE number 3308846 (Why is no real title available?)
• scientific article; zbMATH DE number 3337329 (Why is no real title available?)
• scientific article; zbMATH DE number 3347917 (Why is no real title available?)
• scientific article; zbMATH DE number 3417267 (Why is no real title available?)
• A class of continuous convex programming problems
• A continuous-time generalization of Gordan's transposition theorem
• A lagrangian approach to duality for complex nonlinear fractional programming over cones
• A modified Fritz John optimality criterion
• A sufficient condition for global constrained extrema†
• A sufficient optimality criterion in continuous time programming for generalized convex functions
• Continuous time programming with nonlinear constraints
• Continuous time programming with nonlinear time-delayed constraints
• Generalization of some duality theorems in nonlinear programming
• Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems
• Mathematical programming problems with quasi-convex objective functions
• Optimality conditions and Lagrangian duality in continuous-time nonlinear programming
• Quasi-convexity, strictly quasi-convexity and pseudo-convexity of composite objective functions
• Seven Kinds of Convexity
• Sufficient optimality criteria in non-linear programming in the presence of convex equality and inequality constraints
• The Fritz John and Kuhn-Tucker optimality conditions in continuous-time nonlinear programming
• The use of pseudo-convexity and quasi-convexity in sufficient conditions for global constrained extrema†

Cited in

(21)

• A continuous-time generalization of Gordan's transposition theorem
• Optimality conditions and Lagrangian duality in continuous-time nonlinear programming
• The Fritz John and Kuhn-Tucker optimality conditions in continuous-time nonlinear programming
• Nonsmooth continuous-time optimization problems: Sufficient conditions
• A constant rank constraint qualification in continuous-time nonlinear programming
• New optimality criteria for convex continuous-time problems of vector optimization
• Nonsmooth continuous-time optimization problems: Necessary conditions
• Duality in continuous-time homogeneous programming
• Optimality conditions and duality for a class of continuous-time programming problems with nonlinear operator equality and inequality constraints
• Necessary conditions for continuous-time optimization under the Mangasarian-Fromovitz constraint qualification
• Carathéodory-John--type sufficiency criteria in continuous-time nonlinear programming under generalized \((\alpha,\rho)-(\eta,\theta)-\)type I invexity
• Continuous-time optimization problems involving invex functions
• Vector continuous-time programming without differentiability
• Continuous Time Multiobjective Duality Theory
• scientific article; zbMATH DE number 7685229 (Why is no real title available?)
• Sufficient Fritz John optimality criteria and duality for continuous programming problems
• A survey of recent[1985-1995]advances in generalized convexity with applications to duality theory and optimality conditions
• Continuous-time multiobjective optimization problems via invexity
• Continuous-time linear programming problems revisited: a perturbation approach
• Generalized sufficiency criteria in continuous-time programming with application to a class of variational-type inequalities
• Optimality criteria and duality for nonlinear fractional continuous-time programming

This page was built for publication: Sufficient optimality conditions in continuous-time nonlinear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1067197)