On Extension of Fenchel Duality and its Application
From MaRDI portal
Publication:3395029
DOI10.1137/080716803zbMath1190.90249OpenAlexW2063449703MaRDI QIDQ3395029
Publication date: 20 August 2009
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/080716803
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34) Approximation with constraints (41A29) Convex sets in topological vector spaces (aspects of convex geometry) (52A07)
Related Items (22)
Farkas-type results for vector-valued functions with applications ⋮ Optimality theorems for linear fractional optimization problems involving integral functions defined on Cn [0,1] ⋮ Some characterizations of duality for DC optimization with composite functions ⋮ Robust linear semi-infinite programming duality under uncertainty ⋮ Zero duality gap conditions via abstract convexity ⋮ New strong duality results for convex programs with separable constraints ⋮ Exact SDP relaxations for classes of nonlinear semidefinite programming problems ⋮ Global error bounds for piecewise convex polynomials ⋮ Robust conjugate duality for convex optimization under uncertainty with application to data classification ⋮ Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty ⋮ Characterizing best approximation from a convex set without convex representation ⋮ Unnamed Item ⋮ On solving a class of fractional semi-infinite polynomial programming problems ⋮ Robust duality in parametric convex optimization ⋮ Robust Farkas' lemma for uncertain linear systems with applications ⋮ A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty ⋮ On robust duality for fractional programming with uncertainty data ⋮ Duality for Optimization Problems with Infinite Sums ⋮ Sectional convexity of epigraphs of conjugate mappings with applications to robust vector duality ⋮ A variable smoothing algorithm for solving convex optimization problems ⋮ A Unified Approach to Robust Farkas-Type Results with Applications to Robust Optimization Problems ⋮ Surrogate duality for robust optimization
This page was built for publication: On Extension of Fenchel Duality and its Application