Alternative KKT conditions for (semi)infinite convex optimization
From MaRDI portal
Publication:6618207
DOI10.1080/02331934.2023.2256752MaRDI QIDQ6618207
Marco A. López, Abderrahim Hantoute, Rafael Correa
Publication date: 14 October 2024
Published in: Optimization (Search for Journal in Brave)
Convex programming (90C25) Programming in abstract spaces (90C48) Convex functions and convex programs in convex geometry (52A41) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analysis II. Convex analysis and approximation theory. Transl. from the Russian by D. Newton
- Locally Farkas-Minkowski linear inequality systems
- A note on subdifferentials of pointwise suprema
- Locally Farkas-Minkowski systems in convex semi-infinite programming
- Subdifferential of the supremum via compactification of the index set
- Alternative representations of the normal cone to the domain of supremum functions and subdifferential calculus
- Weaker conditions for subdifferential calculus of convex functions
- Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
- Subdifferential Calculus Rules for Supremum Functions in Convex Analysis
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- Valadier-like formulas for the supremum function II: The compactly indexed case
- On Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space
- New Farkas-type constraint qualifications in convex infinite programming
- On Representations of Semi-Infinite Programs which Have No Duality Gaps
- Convex Analysis
- Fundamentals of Convex Analysis and Optimization
This page was built for publication: Alternative KKT conditions for (semi)infinite convex optimization
