Continuous-time optimization problems involving invex functions
From MaRDI portal
The authors study continuous-time nonlinear programming problem and show that the notion of Karush-Kuhn-Tucker (KKT) invexity, introduced by \textit{D. H. Martin} [J. Optimization Theory Appl. 47, 65--76 (1985; Zbl 0552.90077)] is a necessary and sufficient condition for a global optimality of a KKT point. It is also proved that Martins notion of weak duality invexity is a necessary and sufficient condition for weak duality.
Recommendations
- Contiuous time inverse vector optimization problems
- Continuous-time multiobjective optimization problems via invexity
- Continuous-time inverse quadratic optimal control problem
- Invexity and optimization
- Optimization with generalized invexity
- On interval-valued optimization problems with generalized invex functions
- Continuous optimization and variational inequalities
- Nonsmooth invex functions and sufficient optimality conditions
- On the optimality of some classes of invex problems
- Invex functions and their application to mathematical programming
Cites work
- A class of continuous convex programming problems
- A class of continuous linear programming problems
- A continuous-time generalization of Gordan's transposition theorem
- A Duality Theorem for a Class of Continuous Linear Programming Problems
- A Duality Theory for Separated Continuous Linear Programs
- An Algorithm for a Class of Continuous Linear Programs
- An Extended Duality Theorem for Continuous Linear Programming Problems
- Bottleneck Problems and Dynamic Programming
- Continuous programming. I: Linear objectives
- Continuous time programming with nonlinear constraints
- Duality in continuous-time homogeneous programming
- Duality in infinite-dimensional mathematical programming: Convex integral functionals
- Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems
- scientific article; zbMATH DE number 3662900 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- Nondifferentiable optimization by smooth approximations
- Nonsmooth continuous-time optimization problems: Necessary conditions
- Nonsmooth continuous-time optimization problems: Sufficient conditions
- On the Solutions of a Class of Continuous Linear Programs
- Optimality conditions and Lagrangian duality in continuous-time nonlinear programming
- Some Properties of a Class of Continuous Linear Programs
- Sufficient optimality conditions in continuous-time nonlinear programming
- Symmetric Duality for Continuous Linear Programs
- The essence of invexity
- The Fritz John and Kuhn-Tucker optimality conditions in continuous-time nonlinear programming
Cited in
(18)- Optimality conditions and duality for continuous-time programming with multiple interval-valued objective functions
- Invex optimization revisited
- Optimality in continuous-time multiobjective optimization and vector variational-like inequalities
- Theorems of the alternative for systems of convex inequalities
- Optimality conditions and duality for nonsmooth fractional continuous-time problems
- Continuous-time multiobjective optimization problems via invexity
- On sufficient optimality conditions for multiobjective control problems
- Duality for a class of continuous-time programming problems
- KKT optimality conditions and nonsmooth continuous time optimization problems
- New optimality conditions for nonsmooth control problems
- Contiuous time inverse vector optimization problems
- scientific article; zbMATH DE number 2064185 (Why is no real title available?)
- Carathéodory-John--type sufficiency criteria in continuous-time nonlinear programming under generalized (,)-(,)-type I invexity
- scientific article; zbMATH DE number 7685229 (Why is no real title available?)
- Optimality and invexity in optimization problems in Banach algebras (spaces)
- A constant rank constraint qualification in continuous-time nonlinear programming
- KT-invexity in optimal control problems
- Vector continuous-time programming without differentiability
This page was built for publication: Continuous-time optimization problems involving invex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860670)
