A strong duality theorem for the minimum of a family of convex programs
type: Item
instance of: scholarly article
title: A strong duality theorem for the minimum of a family of convex programs
zbMATH Open document ID: 0418.90070
DOI: 10.1007/BF00934472
published in: Journal of Optimization Theory and Applications
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 3652089
zbMATH Keywords: strong duality theorem
zbMATH Keywords: single concave dual maximization
zbMATH Keywords: linear disjunctive programming
zbMATH Keywords: homogeneous and symmetric formulations
zbMATH Keywords: families of programs
Wikidata QID: Q56936041
author: Jonathan M. Borwein
MaRDI profile type: Publication
cites work: A note on duality in disjunctive programming
cites work: Explicit duality for convex homogeneous programs
cites work: Q4085497
cites work: Convex Analysis
cites work: Necessary and sufficient conditions for a penalty method to be exact
cites work: Q4187595
cites work: Sufficient conditions for duality in homogeneous programming
cites work: Q4103324
cites work: Q4079324
cites work: Disjunctive Programming
cites work: The Cutting-Plane Method for Solving Convex Programs
cites work: Cutting-planes for programs with disjunctive constraints
cites work: Cutting-Planes for Complementarity Constraints
cites work: Stability theorems for infinitely constrained mathematical programs
description: scientific article; zbMATH DE number 3652089