Abstract
We study two dualities that can be applied to quasiconvex problems. They are conjugacies deduced from polarities. They are characterized by the polar sets of sublevel sets. We give some calculus rules for the associated subdifferentials and we relate the subdifferentials to known subdifferentials. We adapt the general duality schemes in terms of Lagrangians or in terms of perturbations to two specific problems. First a general mathematical programming problem and then a programming problem with linear constraints.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
