An Algorithm for Maximizing a Convex Function Based on Its Minimum

Aharon Ben-Tal () and Ernst Roos ()
Additional contact information
Aharon Ben-Tal: Faculty of Industrial Engineering and Management, Technion – Israel Institute of Technology, Haifa 32000, Israel; Shenkar College, Ramat Gan 50200, Israel
Ernst Roos: ORTEC, 2719 EA Zoetermeer, Netherlands

INFORMS Journal on Computing, 2022, vol. 34, issue 6, 3200-3214

Abstract: In this paper, an algorithm for maximizing a convex function over a convex feasible set is proposed. The algorithm, called CoMax, consists of two phases: in phase 1, a feasible starting point is obtained that is used in a gradient ascent algorithm in phase 2. The main contribution of the paper is connected to phase 1; five different methods are used to approximate the original NP-hard problem of maximizing a convex function (MCF) by a tractable convex optimization problem. All the methods use the minimizer of the convex objective function in their construction. In phase 2, the gradient ascent algorithm yields stationary points to the MCF problem. The performance of CoMax is tested on a wide variety of MCF problems, demonstrating its efficiency.

Keywords: global optimization; convex maximization; gradient ascent; hidden convexity (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/ijoc.2022.1238 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orijoc:v:34:y:2022:i:6:p:3200-3214

Access Statistics for this article

More articles in INFORMS Journal on Computing from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().