Continuous-time optimization problems involving invex functions
From MaRDI portal
Publication:860670
DOI10.1016/j.jmaa.2006.05.005zbMath1160.90005OpenAlexW1965162695MaRDI QIDQ860670
Publication date: 9 January 2007
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2006.05.005
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Related Items (12)
On sufficient optimality conditions for multiobjective control problems ⋮ A constant rank constraint qualification in continuous-time nonlinear programming ⋮ KT-invexity in optimal control problems ⋮ New optimality conditions for nonsmooth control problems ⋮ Theorems of the alternative for systems of convex inequalities ⋮ Optimality conditions and duality for nonsmooth fractional continuous-time problems ⋮ Unnamed Item ⋮ Continuous-time multiobjective optimization problems via invexity ⋮ Vector continuous-time programming without differentiability ⋮ Optimality and invexity in optimization problems in Banach algebras (spaces) ⋮ KKT Optimality Conditions and Nonsmooth Continuous Time Optimization Problems ⋮ Optimality conditions and duality for continuous-time programming with multiple interval-valued objective functions
Cites Work
- Unnamed Item
- Unnamed Item
- The essence of invexity
- 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
- 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
- Duality in infinite-dimensional mathematical programming: Convex integral functionals
- Nonsmooth continuous-time optimization problems: Sufficient conditions
- A class of continuous linear programming problems
- A class of continuous convex programming problems
- Continuous programming. I: Linear objectives
- Some Properties of a Class of Continuous Linear Programs
- Nondifferentiable optimization by smooth approximations
- An Algorithm for a Class of Continuous Linear Programs
- On the Solutions of a Class of Continuous Linear Programs
- A Duality Theory for Separated Continuous Linear Programs
- An Extended Duality Theorem for Continuous Linear Programming Problems
- A Duality Theorem for a Class of Continuous Linear Programming Problems
- Symmetric Duality for Continuous Linear Programs
- Bottleneck Problems and Dynamic Programming
- Nonsmooth continuous-time optimization problems: Necessary conditions
This page was built for publication: Continuous-time optimization problems involving invex functions
