Farkas-Type Results With Conjugate Functions

DOI10.1137/030602332zbMath1114.90147OpenAlexW2064205847MaRDI QIDQ5317511

Radu Ioan Boţ, Gert Wanka

Publication date: 16 September 2005

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/030602332

zbMATH Keywords

conjugate dualityFarkas-type resultsfinitely and infinitely many convex constraints

Mathematics Subject Classification ID

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

Related Items (29)

The stable duality of DC programs for composite convex functions ⋮ Farkas-type results for fractional programming problems ⋮ Efficient and weakly efficient solutions for the vector topical optimization ⋮ New differential properties of sup-type functions ⋮ Farkas-type results for max-functions and applications ⋮ Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization ⋮ Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splitting ⋮ Duality and Farkas-type results for extended Ky Fan inequalities with DC functions ⋮ Characterizations of \(\varepsilon\)-duality gap statements for constrained optimization problems ⋮ Farkas-Type Theorems and Applications: From IPH Functions to ICR Functions ⋮ Some new Farkas-type results for inequality systems with DC functions ⋮ Complete characterizations of stable Farkas' lemma and cone-convex programming duality ⋮ Farkas' lemma in random locally convex modules and Minkowski-Weyl type results in \(L^0(\mathcal F,R^n)\) ⋮ Optimality conditions for weak efficiency to vector optimization problems with composed convex functions ⋮ New constraint qualification and conjugate duality for composed convex optimization problems ⋮ A closedness condition and its applications to DC programs with convex constraints ⋮ Duality and Farkas-type results for DC fractional programming with DC constraints ⋮ A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces. ⋮ New Farkas-type constraint qualifications in convex infinite programming ⋮ An alternative formulation for a new closed cone constraint qualification ⋮ Vector topical functions and Farkas type theorems with applications ⋮ Farkas-type results for inequality systems with composed convex functions via conjugate duality ⋮ The stable Farkas lemma for composite convex functions in infinite dimensional spaces ⋮ On robust duality for fractional programming with uncertainty data ⋮ Some Farkas-type results for fractional programming problems with DC functions ⋮ New Farkas-type results for vector-valued functions: a non-abstract approach ⋮ Strong and total Lagrange dualities for quasiconvex programming ⋮ Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming ⋮ Farkas lemma for convex systems revisited and applications to sublinear-convex optimization problems

This page was built for publication: Farkas-Type Results With Conjugate Functions