Theorems of the alternative for systems of convex inequalities

DOI10.1007/s11228-017-0406-yOpenAlexW2594571411MaRDI QIDQ2416613

Yanyan Li

Publication date: 23 May 2019

Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11228-017-0406-y

zbMATH Keywords

solvability conditionstheorem of the alternativesystems of convex inequalities

Mathematics Subject Classification ID

Convex programming (90C25) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Motzkin's theorem of the alternative: a continuous-time generalization
• Continuous-time optimization problems involving invex functions
• Vector continuous-time programming without differentiability
• 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
• Continuous-time multiobjective optimization problems via invexity
• Second-Order Analysis of Polyhedral Systems in Finite and Infinite Dimensions with Applications to Robust Stability of Variational Inequalities
• Systems of Inequalities Involving Convex Functions
• Optimization and nonsmooth analysis
• Set-valued analysis
• Nonsmooth continuous-time optimization problems: Necessary conditions

This page was built for publication: Theorems of the alternative for systems of convex inequalities