Zero duality gap for convex programs: a generalization of the Clark-Duffin theorem
From MaRDI portal
Publication:378279
DOI10.1007/s10957-013-0287-7zbMath1274.90260MaRDI QIDQ378279
Publication date: 11 November 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-013-0287-7
Related Items
Unnamed Item, Relaxed Lagrangian duality in convex infinite optimization: reducibility and strong duality, New glimpses on convex infinite optimization duality, Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap, On the lower semicontinuity of the value function and existence of solutions in quasiconvex optimization, On weak conjugacy, augmented Lagrangians and duality in nonconvex optimization, On the existence of a saddle value, Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint
Cites Work
- Unnamed Item
- Unnamed Item
- Generalized Courant-Beltrami penalty functions and zero duality gap for conic convex programs
- Slice-continuous sets in reflexive Banach spaces: convex constrained optimization and strict convex separation
- Convex analysis and nonlinear optimization. Theory and examples.
- Duality gap of the conic convex constrained optimization problems in normed spaces
- Clark's theorem for semi-infinite convex programs
- On the inner aperture and intersections of convex sets
- The inner aperture of a convex set
- Zero duality gaps in infinite-dimensional programming
- On closed convex sets without boundary rays and asymptotes
- Duality gap in convex programming
- Convex functions with continuous epigraph or continuous level sets
- Integrals which are convex functionals
- Systems of Inequalities Involving Convex Functions
- A geometric description of the inner aperture of a convex set
- Clark's Theorem on linear programs holds for convex programs
- Continuous Convex Sets.
