Motzkin's theorem of the alternative: a continuous-time generalization

DOI10.1007/s11590-012-0513-5zbMath1311.90102MaRDI QIDQ395828

Saša V. Raković, Boban Marinković, Vladimir Janković

Publication date: 30 January 2014

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-012-0513-5

zbMATH Keywords

convex programming; continuous-time optimization; Motzkin's theorem of the alternative

Mathematics Subject Classification ID

90C25: Convex programming

Related Items

Theorems of the alternative for systems of convex inequalities

Cites Work

• Unnamed Item
• Unnamed Item
• Generalized Motzkin theorems of the alternative and vector optimization problems
• Revisiting some duality theorems via the quasirelative interior in convex optimization
• Vector continuous-time programming without differentiability
• Quasi-relative interior-type constraint qualifications ensuring strong Lagrange duality for optimization problems with cone and affine constraints
• 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
• Partially finite convex programming. I: Quasi relative interiors and duality theory
• Notions of relative interior in Banach spaces
• Separation theorem based on the quasirelative interior and application to duality theory
• Continuous time matrix programming
• On general infinite dimensional complementarity problems
• Infinite dimensional duality and applications
• Regularity Conditions via Quasi-Relative Interior in Convex Programming
• Nonsmooth continuous-time optimization problems: Necessary conditions