Sufficient optimality conditions in continuous-time nonlinear programming
From MaRDI portal
Publication:1067197
DOI10.1016/0022-247X(85)90206-9zbMath0579.49019MaRDI QIDQ1067197
Publication date: 1985
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Nonlinear programming (90C30) Fractional programming (90C32) Nonlinear systems in control theory (93C10) Optimality conditions for problems involving ordinary differential equations (49K15) Optimality conditions for free problems in two or more independent variables (49K10)
Related Items (17)
The Fritz John and Kuhn-Tucker optimality conditions in continuous-time nonlinear programming ⋮ A constant rank constraint qualification in continuous-time nonlinear programming ⋮ New optimality criteria for convex continuous-time problems of vector optimization ⋮ Generalized sufficiency criteria in continuous-time programming with application to a class of variational-type inequalities ⋮ Continuous-time optimization problems involving invex functions ⋮ A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions] ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Continuous-time multiobjective optimization problems via invexity ⋮ Continuous Time Multiobjective Duality Theory ⋮ Continuous-time linear programming problems revisited: A perturbation approach ⋮ Vector continuous-time programming without differentiability ⋮ Nonsmooth continuous-time optimization problems: Necessary conditions ⋮ Nonsmooth continuous-time optimization problems: Sufficient conditions ⋮ Duality in continuous-time homogeneous programming ⋮ A continuous-time generalization of Gordan's transposition theorem ⋮ Optimality conditions and Lagrangian duality in continuous-time nonlinear programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modified Fritz John optimality criterion
- 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
- Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems
- Continuous time programming with nonlinear constraints
- A sufficient optimality criterion in continuous time programming for generalized convex functions
- Continuous time programming with nonlinear time-delayed constraints
- A class of continuous convex programming problems
- The use of pseudo-convexity and quasi-convexity in sufficient conditions for global constrained extrema†
- Sufficient optimality criteria in non-linear programming in the presence of convex equality and inequality constraints
- Generalization of some duality theorems in nonlinear programming
- A lagrangian approach to duality for complex nonlinear fractional programming over cones
- Seven Kinds of Convexity
- Mathematical programming problems with quasi-convex objective functions
- A sufficient condition for global constrained extrema†
- Quasi-convexity, strictly quasi-convexity and pseudo-convexity of composite objective functions
This page was built for publication: Sufficient optimality conditions in continuous-time nonlinear programming
