On duality gap in linear conic problems

DOI10.1007/S11590-011-0282-6zbMATH Open1280.90085OpenAlexW2290719478MaRDI QIDQ691369FDOQ691369

Authors: Constantin Zălinescu 

Publication date: 30 November 2012

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-011-0282-6

Recommendations

• Universal duality in conic convex optimization
• On duality theory of conic linear problems.
• Duality gap in convex programming
• Duality gap of the conic convex constrained optimization problems in normed spaces
• Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap

zbMATH Keywords

duality gaplinear conic problems

Mathematics Subject Classification ID

Linear programming (90C05)

Cites Work

• Title not available (Why is that?)
• Convex Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Zero Duality Gap and the Farkas Lemma for Conic Programming
• A note on d-stability of convex programs and limiting Lagrangians

Cited In (9)

• Revisiting some rules of convex analysis
• Preprocessing and regularization for degenerate semidefinite programs
• Title not available (Why is that?)
• Descent methods with computational errors in Banach spaces
• A new necessary and sufficient condition for the strong duality and the infinite dimensional Lagrange multiplier rule
• An exact explicit dual for the linear copositive programming problem
• Dual Linear Programming Problem and One-Dimensional Gromov Minimal Fillings of Finite Metric Spaces
• On duality theory of conic linear problems.
• On Zero Duality Gap and the Farkas Lemma for Conic Programming

This page was built for publication: On duality gap in linear conic problems

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