Zero duality gaps in infinite-dimensional programming

DOI10.1007/BF00939737zbMath0687.90077OpenAlexW2025212843MaRDI QIDQ1263531

Henry Wolkowicz, Vaithilingam Jeyakumar

Publication date: 1990

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00939737

zbMATH Keywords

duality gap semicontinuity value function infinite-dimensional programming convex infinitely constrained programs epsilon-subdifferentiability

Mathematics Subject Classification ID

Nonlinear programming (90C30) Programming in abstract spaces (90C48) Semi-infinite programming (90C34) Duality theory (optimization) (49N15)

Related Items

On duality gap with polynomial multipliers for polynomial optimization problems ⋮ Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs ⋮ Sufficient optimality conditions and duality in vector optimization with invex-convexlike functions ⋮ Invex-convexlike functions and duality ⋮ Semicontinuity and quasiconvex functions ⋮ A solution method for combined semi-infinite and semi-definite programming ⋮ Conjugate duality in set-valued vector optimization ⋮ Zero duality gap for convex programs: a generalization of the Clark-Duffin theorem ⋮ Characterizing global optimality for DC optimization problems under convex inequality constraints ⋮ Stability of the duality gap in linear optimization ⋮ Weak Fenchel and weak Fenchel-Lagrange conjugate duality for nonconvex scalar optimization problems ⋮ Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap ⋮ A solvability theorem and minimax fractional programming ⋮ New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs ⋮ Stable zero Lagrange duality for DC conic programming ⋮ Ensuring privacy with constrained additive noise by minimizing Fisher information ⋮ Robust envelope-constrained filter with orthonormal bases and semi-definite and semi-infinite programming ⋮ DC approach to weakly convex optimization and nonconvex quadratic optimization problems ⋮ New glimpses on convex infinite optimization duality ⋮ Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma ⋮ On epsilon-stability in optimization ⋮ Generalizations of Slater's constraint qualification for infinite convex programs ⋮ Convex composite multi-objective nonsmooth programming ⋮ Some applications of the image space analysis to the duality theory for constrained extremum problems ⋮ Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs ⋮ Nonlinear Lagrangian theory for nonconvex optimization. ⋮ Unnamed Item ⋮ Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality ⋮ Sequential Lagrangian conditions for convex programs with applications to semidefinite programming ⋮ Extended Lagrange And Penalty Functions in Continuous Optimization^* ⋮ Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations ⋮ Duality gap of the conic convex constrained optimization problems in normed spaces ⋮ Duality for Optimization Problems with Infinite Sums ⋮ Min-sup-type zero duality gap properties for DC composite optimization problem ⋮ On convex generalized systems ⋮ On the existence of a saddle value ⋮ Inequality systems and optimization ⋮ Infinite-dimensional convex programming with applications to constrained approximation

Cites Work