Nonsmooth continuous-time optimization problems: Necessary conditions
From MaRDI portal
Publication:5948800
DOI10.1016/S0898-1221(01)00112-2zbMath1017.90124MaRDI QIDQ5948800
Marko A. Rojas-Medar, Geraldo Nunes Silva, Adilson J. V. Brandão
Publication date: 12 November 2001
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
90C46: Optimality conditions and duality in mathematical programming
49J52: Nonsmooth analysis
90C48: Programming in abstract spaces
49K15: Optimality conditions for problems involving ordinary differential equations
Related Items
Continuous-time optimization problems involving invex functions, The approximation algorithm for solving a sort of non-smooth programming
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Sur la fonction d'appui des ensembles convexes dans un espace localement convexe
- 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
- Set-valued analysis
