Maximization of many functions is done efficiently via a recursive process that involve optimization of auxiliary concave functions at intermediate steps. In the paper we describe a process that allows constructively build concave auxiliary functions. This process can be applied to optimization of exponential families and to recently introduced A-functions.
By: Dimitri Kanevsky
Published in: RC25183 in 2011
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .