Conditions for zero duality gap in convex programming

Host Institution:

University of South Australia

Title of Seminar:

Conditions for zero duality gap in convex programming

Speaker's Name:

A/Prof Regina Burachik

Speaker's Institution:

The University of South Australia

Time and Date:

Monday 13 May, 3.30pm (AEST)

Seminar Abstract:

We introduce and study a new dual condition which characterizes zero duality gap in nonsmooth convex optimization. We prove that our condition is weaker than all existing constraint qualifications, including the closed epigraph condition. Our dual condition was inspired by, and is weaker than, the so-called Bertsekas’ condition for monotropic programming problems. We give several corollaries of our result and special cases as applications.  We pay special attention to the polyhedral and sublinear cases, and their implications in convex optimization.

This research is a joint work with Jonathan M. Borwein and Liangjin Yao.

Seminar Convenor:

This email address is being protected from spambots. You need JavaScript enabled to view it.

AGR IT support:

This email address is being protected from spambots. You need JavaScript enabled to view it.