Some convex programs without a duality gap

DOI10.1007/S10107-007-0110-ZzbMATH Open1176.90464OpenAlexW2062932190MaRDI QIDQ959958FDOQ959958

Authors: Paul Tseng 

Publication date: 16 December 2008

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-007-0110-z

Recommendations

• Ordinary convex programs without a duality gap
• Some robust convex programs without a duality gap
• Dual semidefinite programs without duality gaps for a class of convex minimax programs
• scientific article; zbMATH DE number 3847230
• Duality gap in convex programming
• scientific article; zbMATH DE number 3934789
• Duality theorems for separable convex programming without qualifications
• Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality
• Zero duality gap for a class of nonconvex optimization problems
• Zero duality gap for convex programs: a generalization of the Clark-Duffin theorem

zbMATH Keywords

duality gaprecession directionHoffman's error boundseparable convex programweakly analytic function

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

• Convex Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Proximal Minimization Methods with Generalized Bregman Functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Convex analysis and nonlinear optimization. Theory and examples
• Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
• Existence of optimal solutions and duality results under weak conditions
• Title not available (Why is that?)
• Penalty/Barrier Multiplier Methods for Convex Programming Problems
• Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
• Duality gap in convex programming
• Title not available (Why is that?)
• A sufficient condition for lower semicontinuity of solution sets of systems of convex inequalities
• An ϵ-Out-of-Kilter Method for Monotropic Programming
• Ordinary convex programs without a duality gap
• Title not available (Why is that?)
• Stochastic programming duality: \({\mathcal L}^\infty\) multipliers for unbounded constraints with an application to mathematical finance

Cited In (27)

• New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs
• Duality gap of the conic convex constrained optimization problems in normed spaces
• Title not available (Why is that?)
• Convex Functions with Unbounded Level Sets and Applications to Duality Theory
• On the absence of duality gap for Lagrange-type functions
• A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints
• Some robust convex programs without a duality gap
• A note on d-stability of convex programs and limiting Lagrangians
• Duality gap in convex programming
• Ordinary convex programs without a duality gap
• Dual semidefinite programs without duality gaps for a class of convex minimax programs
• Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap
• Duality theorems for separable convex programming without qualifications
• Further study on strong Lagrangian duality property for invex programs via penalty functions
• New strong duality results for convex programs with separable constraints
• Farkas' lemma for separable sublinear inequalities without qualifications
• Title not available (Why is that?)
• Dual characterizations of set containments involving uncertain polyhedral sets in Banach spaces with applications
• Conditions for zero duality gap in convex programming
• Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements
• Stable zero Lagrange duality for DC conic programming
• Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
• Characterizing robust set containments and solutions of uncertain linear programs without qualifications
• Extended monotropic programming and duality
• Title not available (Why is that?)
• Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint
• On the lower semicontinuity of the value function and existence of solutions in quasiconvex optimization

This page was built for publication: Some convex programs without a duality gap

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q959958)