Strong duality for generalized convex optimization problems
From MaRDI portal
Publication:948630
DOI10.1007/s10957-005-6392-5zbMath1158.90420OpenAlexW2016306996MaRDI QIDQ948630
Gert Wanka, Radu Ioan Boţ, Gábor Kassay
Publication date: 17 October 2008
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-005-6392-5
Related Items (28)
A comparison of alternative c-conjugate dual problems in infinite convex optimization ⋮ Fenchel-Lagrange duality versus geometric duality in convex optimization ⋮ Farkas-type results for fractional programming problems ⋮ Conjugate dual problems in constrained set-valued optimization and applications ⋮ Farkas-type results for max-functions and applications ⋮ Unnamed Item ⋮ Weak Fenchel and weak Fenchel-Lagrange conjugate duality for nonconvex scalar optimization problems ⋮ The value of cooperation in interregional transmission planning: a noncooperative equilibrium model approach ⋮ Necessary optimality conditions for vector reverse convex minimization problems via a conjugate duality ⋮ Necessary and sufficient conditions for strong Fenchel-Lagrange duality via a coupling conjugation scheme ⋮ An extended conjugate duality for generalized semi-infinite programming problems via a convex decomposition ⋮ Saddle points and gap functions for vector equilibrium problems via conjugate duality in vector optimization ⋮ Some new Farkas-type results for inequality systems with DC functions ⋮ Optimality conditions for weak efficiency to vector optimization problems with composed convex functions ⋮ New constraint qualification and conjugate duality for composed convex optimization problems ⋮ Fenchel's duality theorem for nearly convex functions ⋮ Duality for almost convex optimization problems via the perturbation approach ⋮ A closedness condition and its applications to DC programs with convex constraints ⋮ Optimality conditions of vector set-valued optimization problem involving relative interior ⋮ A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces. ⋮ An alternative formulation for a new closed cone constraint qualification ⋮ Farkas-type results for inequality systems with composed convex functions via conjugate duality ⋮ Conjugate Duality in Constrained Set-Valued Vector Optimization Problems ⋮ Some Farkas-type results for fractional programming problems with DC functions ⋮ Different conjugate dual problems in vector optimization and their relations ⋮ Scalar and Vector Optimization with Composed Objective Functions and Constraints ⋮ Gap functions for generalized vector equilibrium problems via conjugate duality and applications ⋮ An Extended Fenchel--Lagrange Duality Approach and Optimality Conditions for Strong Bilevel Programming Problems
Cites Work
This page was built for publication: Strong duality for generalized convex optimization problems
