Abstract
We establish a duality formula for the problem Minimize f(x)+g(x) for h(x)+k(x)<0 where g, k are extended-real-valued convex functions and f, h belong to the class of functions that can be written as the lower envelope of an arbitrary family of convex functions. Applications in d.c. and Lipschitzian optimization are given.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 callMore From: Journal of global optimization : an international journal dealing with theoretical and computational aspects of seeking global optima and their applications in science, management and engineering
Paper Title
Journal
Date
