Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems
From MaRDI portal
Optimality conditions for problems in abstract spaces (49K27) Optimality conditions (49K99) Numerical methods based on nonlinear programming (49M37) Convex programming (90C25) Nonlinear programming (90C30) Programming in abstract spaces (90C48) Methods of successive quadratic programming type (90C55)
Cites work
- A class of continuous convex programming problems
- A class of continuous linear programming problems
- A Duality Theorem for a Class of Continuous Linear Programming Problems
- Constrained optimization problems in Banach space
- Continuous time programming with nonlinear constraints
- Convergence Conditions for Nonlinear Programming Algorithms
- Duality in continuous linear programming
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 3133020 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- scientific article; zbMATH DE number 3313523 (Why is no real title available?)
- scientific article; zbMATH DE number 3320765 (Why is no real title available?)
- scientific article; zbMATH DE number 3374409 (Why is no real title available?)
- scientific article; zbMATH DE number 3067835 (Why is no real title available?)
- Nonlinear Programming in Banach Space
- On the existence and nonexistence of Lagrange multipliers in Banach spaces
- Optimality conditions and constraint qualifications in Banach space
- Symmetric Duality for Continuous Linear Programs
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
Cited in
(26)- Sufficient optimality conditions in continuous-time nonlinear programming
- A class of nondifferentiable continuous programming problems
- Optimality conditions and Lagrangian duality in continuous-time nonlinear programming
- The Fritz John and Kuhn-Tucker optimality conditions in continuous-time nonlinear programming
- Some remarks concerning duality for continuous-time programming problems
- Optimality conditions and duality in continuous programming. I: Convex programs and a theorem of the alternative
- Second-order duality for the variational problems
- Duality for nonsmooth continuous-time problems of vector optimization
- Optimality conditions and duality for continuous-time programming with multiple interval-valued objective functions
- Numerical method for solving the continuous-time linear programming problems with time-dependent matrices and piecewise continuous functions
- Continuous-time multiobjective optimization problems via invexity
- Generalized sufficiency criteria in continuous-time programming with application to a class of variational-type inequalities
- Optimality conditions and duality for a class of continuous-time generalized fractional programming problems
- Approximate Solutions and Duality Theorems for Continuous-Time Linear Fractional Programming Problems
- KKT optimality conditions and nonsmooth continuous time optimization problems
- Lagrangian duality for a class of infinite programming problems
- Using the parametric approach to solve the continuous-time linear fractional Max-min problems
- OPTIMALITY CONDITIONS AND DUALITY MODELS FOR A CLASS OF NONSMOOTH CONTINUOUS-TIME GENERALIZED FRACTIONAL PROGRAMMING PROBLEMS
- Continuous-time linear programming problems revisited: a perturbation approach
- Nonsmooth continuous-time optimization problems: Necessary conditions
- scientific article; zbMATH DE number 7685229 (Why is no real title available?)
- Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems
- Continuous time non-smooth optimization through quasi efficiency
- Optimality conditions and duality for a class of continuous-time programming problems with nonlinear operator equality and inequality constraints
- A constant rank constraint qualification in continuous-time nonlinear programming
- Continuous-time optimization problems involving invex functions
This page was built for publication: Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1141356)
