A continuous-time generalization of Gordan's transposition theorem
From MaRDI portal
Publication:1072454
DOI10.1016/0022-247X(85)90339-7zbMath0586.90094MaRDI QIDQ1072454
Publication date: 1985
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Related Items
The Fritz John and Kuhn-Tucker optimality conditions in continuous-time nonlinear programming ⋮ 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 ⋮ 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 ⋮ On estimates for solutions of systems of convex inequalities ⋮ Unnamed Item ⋮ Weak efficiency for multiobjective variational problems. ⋮ Unnamed Item ⋮ Continuous-time multiobjective optimization problems via invexity ⋮ Vector continuous-time programming without differentiability ⋮ 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 ⋮ Sufficient optimality conditions in continuous-time nonlinear programming ⋮ Optimality conditions and Lagrangian duality in continuous-time nonlinear programming
Cites Work
- Unnamed Item
- Unnamed Item
- Sufficient optimality conditions in continuous-time nonlinear programming
- Optimality conditions and Lagrangian duality in continuous-time nonlinear programming
- The Fritz John and Kuhn-Tucker optimality conditions in continuous-time nonlinear programming
- A complex transposition theorem with applications to complex programming
- Some generalizations and applications of a comples transposition theorem
- Theorems of the alternative for complex linear inequalities
- Systems of Inequalities Involving Convex Functions
- 100 Jahre gordanscher alternativsatz für lineare ungleichungen
- Strenge line-are Ungleichugen bezüglich kegelhalbordnungen
- Duality Theorems and Theorems of the Alternative
- New conditions for the validity of the LAGRANGE multiplier rule I
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
- Transposition Theorems for Cone-Convex Functions