The Fritz John and Kuhn-Tucker optimality conditions in continuous-time nonlinear programming
From MaRDI portal
Publication:1083380
DOI10.1016/0022-247X(85)90312-9zbMath0603.90135MaRDI QIDQ1083380
Publication date: 1985
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Banach spacesaddle point optimality conditionscontinuous-time programmingfirst order necessary optimality conditions
Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Programming in abstract spaces (90C48) Optimality conditions for problems in abstract spaces (49K27)
Related Items
Sufficient optimality criteria and duality for nondifferentiable fractional variational problems with generalized (F, ρ)-convexity, A constant rank constraint qualification in continuous-time nonlinear programming, New optimality criteria for convex continuous-time problems of vector optimization, Continuous-time optimization problems involving invex functions, Duality for a class of continuous-time homogeneous fractional programming problems, Theorems of the alternative for systems of convex inequalities, Motzkin's theorem of the alternative: a continuous-time generalization, Optimality conditions in a vector continuous-time optimization problem, Optimality criteria for nonsmooth continuous-time problems of multiobjective optimization, 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, Nonsmooth continuous-time optimization problems: Necessary conditions, Necessary conditions for continuous-time optimization under the Mangasarian–Fromovitz constraint qualification, KKT Optimality Conditions and Nonsmooth Continuous Time Optimization Problems, Saddle-point type optimality criteria, duality and a new approach for solving nonsmooth fractional continuous-time programming problems, Duality in continuous-time homogeneous programming, Sufficient optimality conditions in continuous-time nonlinear 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
- Optimality conditions and duality for a class of continuous-time programming problems with nonlinear operator equality and inequality constraints
- Duality in continuous-time homogeneous programming
- Sufficient optimality conditions in continuous-time nonlinear programming
- A continuous-time generalization of Gordan's transposition theorem
- Optimality conditions and Lagrangian duality in continuous-time nonlinear programming
- Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems
- Optimality conditions and duality in continuous programming. I: Convex programs and a theorem of the alternative
- Continuous time programming with nonlinear constraints
- Continuous time programming with nonlinear time-delayed constraints
- A class of continuous linear programming problems
- A class of continuous convex programming problems
- Lectures on mathematical theory of extremum problems. Translated from the Russian by D. Louvish
- Constraint qualifications in maximization problems
- A Decomposable Nonlinear Programming Approach
- Symmetric Duality for Continuous Linear Programs
- On constraint qualifications in nonlinear programming
- Constraint Qualifications Revisited
- Bottleneck Problems and Dynamic Programming
