A multiplicative weights update algorithm for MINLP
Luca Mencarelli, Youcef Sahraoui, Leo Liberti
EURO Journal on Computational Optimization · 2017
doi:10.1007/s13675-016-0069-8 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
We discuss an application of the well-known multiplicative weights update (MWU) algorithm to non-convex and mixed-integer non-linear programming. We present applications to: (a) the distance geometry problem, which arises in the positioning of mobile sensors and in protein conformation; (b) a hydro unit commitment problem arising in the energy industry, and (c) a class of Markowitz’ portfolio selection problems. The interest of the MWU with respect to one of its closest competitors (classic multi-start) is that it provides a relative approximation guarantee on a certain quality measure of the solution.
Abstract licence: CC BY-NC-ND
References43
43 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.