Abstract
This paper presents a randomized polynomial time algorithm to nearly minimize a linear function over an up-monotone convex set in the positive orthant given only by a membership oracle. Our original motivation for this is a stochastic optimization problem called the component commonality problem in the literature.
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 call
