A strong duality theorem for the minimum of a family of convex programs

DOI10.1007/BF00934472zbMath0418.90070WikidataQ56936041 ScholiaQ56936041MaRDI QIDQ1131953

Jonathan M. Borwein

Publication date: 1980

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

zbMATH Keywords

strong duality theoremfamilies of programshomogeneous and symmetric formulationslinear disjunctive programmingsingle concave dual maximization

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (6)

Duality in disjunctive programming via vector optimization ⋮ Parametric disjunctive programming: One-sided differentiability of the value function ⋮ Characterizations of Robust and Stable Duality for Linearly Perturbed Uncertain Optimization Problems ⋮ Quasiconvex minimization on a locally finite union of convex sets ⋮ Optimality conditions for disjunctive optimization in reflexive Banach spaces ⋮ Convexity and concavity properties of the optimal value function in parametric nonlinear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stability theorems for infinitely constrained mathematical programs
• A note on duality in disjunctive programming
• Sufficient conditions for duality in homogeneous programming
• Cutting-planes for programs with disjunctive constraints
• The Cutting-Plane Method for Solving Convex Programs
• Disjunctive Programming
• Necessary and sufficient conditions for a penalty method to be exact
• Explicit duality for convex homogeneous programs
• Cutting-Planes for Complementarity Constraints
• Convex Analysis

This page was built for publication: A strong duality theorem for the minimum of a family of convex programs