SMS scnews item created by Andrew Mathas at Wed 24 Apr 2013 0920
Modified: Wed 24 Apr 2013 1409; Fri 26 Apr 2013 1954
Expiry: 13 May 2013
Calendar1: 13 May 2013 1500-1600
CalLoc1: AGR Carslaw 829
CalTitle1: AGR Seminar: Conditions for zero duality gap in convex programming
Auth: firstname.lastname@example.org in SMS-auth
Conditions for zero duality gap in convex programming
A/Prof Regina Burachik, The University of South Australia
University of South Australia
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.
If you would like to attend this seminar in our access grid room then please check to see if the grid is already booked at this time and send an email to email@example.com to let the CSOs know that you would like to attend.