DocServer

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

Borwein, Jonathan M. (1980) A strong duality theorem for a minimum of a family of convex programs. Journal of Optimization Theory and Applications, 31 . pp. 453-478.

Full text not available from this repository.

Abstract

We produce a duality theorem for the minimum of an arbitrary family of convex programs. This duality theorem provides a single concave dual maximization and generalizes recent work in linear disjunctive programming. Homogeneous and symmetric formulations are studied in some detail, and a number of convex and nonconvex applications are given.

Item Type: Article
Subjects: UNSPECIFIED
Faculty: UNSPECIFIED
Depositing User: Mrs Naghmana Tehseen
Date Deposited: 23 Feb 2015 14:32
Last Modified: 23 Feb 2015 14:32
URI: https://docserver.carma.newcastle.edu.au/id/eprint/1657

Actions (login required)

View Item