Farkas-type results for max-functions and applications

DOI10.1007/S11117-005-0003-4zbMATH Open1110.49031OpenAlexW2008790278MaRDI QIDQ865005FDOQ865005

Authors Radu I. Boţ, Gert Wanka

Publication date 13 February 2007

Published in Positivity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11117-005-0003-4

zbMATH Keywords

dualityFarkas-type resultsminmax programmingset containmenttheorems of the alternative

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)

Recommendations

• A note on maximum-type functions
• Farkas' theorem of nonconvex type and its application to a min-max problem
• The \(F\)-theorem and \(F\)-maximization
• Maximum theorems with strict quasi-concavity and applications
• A unifying approach for certain class of maximal functions
• scientific article; zbMATH DE number 750721
• An Aleksandrov-Bakelman type maximum principle and applications
• Maximal inequalities and some applications
• New estimates for the maximal functions and applications
• On Generalized Maximal Functions

Cites work

• scientific article; zbMATH DE number 3606241 (Why is no real title available?)
• scientific article; zbMATH DE number 477581 (Why is no real title available?)
• scientific article; zbMATH DE number 3308846 (Why is no real title available?)
• Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
• Convex Analysis
• Duality for minmax programs
• Farkas-Type Results With Conjugate Functions
• Fenchel-Lagrange duality versus geometric duality in convex optimization
• Set containment characterization
• Strong duality for generalized convex optimization problems

Cited in

(8)

• New Farkas-type results for vector-valued functions: a non-abstract approach
• Farkas' theorem of nonconvex type and its application to a min-max problem
• Theorems of the alternative for multivalued mappings and applications to mixed convex \(\backslash\) concave systems of inequalities
• Dual characterizations of the set containments with strict cone-convex inequalities in Banach spaces
• Farkas-type theorems and applications: from IPH functions to ICR functions
• Dual semidefinite programs without duality gaps for a class of convex minimax programs
• Convex robust sum optimization problems with conic and set constraints: duality and optimality conditions revisited
• Some new Farkas-type results for inequality systems with DC functions

This page was built for publication: Farkas-type results for max-functions and applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q865005)