A proximal-point outer approximation algorithm

Massimo De Mauri (), Joris Gillis, Jan Swevers and Goele Pipeleers
Additional contact information
Massimo De Mauri: KU Leuven and Flanders Make - DMMS_M
Joris Gillis: KU Leuven and Flanders Make - DMMS_M
Jan Swevers: KU Leuven and Flanders Make - DMMS_M
Goele Pipeleers: KU Leuven and Flanders Make - DMMS_M

Computational Optimization and Applications, 2020, vol. 77, issue 3, No 7, 755-777

Abstract: Abstract Many engineering and scientific applications, e.g. resource allocation, control of hybrid systems, scheduling, etc., require the solution of mixed-integer non-linear problems (MINLPs). Problems of such class combine the high computational burden arising from considering discrete variables with the complexity of non-linear functions. As a consequence, the development of algorithms able to efficiently solve medium-large MINLPs is still an interesting field of research. In the last decades, several approaches to tackle MINLPs have been developed. Some of such approaches, usually defined as exact methods, aim at finding a globally optimal solution for a given MINLP at expense of a long execution time, while others, generally defined as heuristics, aim at discovering suboptimal feasible solutions in the shortest time possible. Among the various proposed paradigms, outer approximation (OA) and feasibility pump (FP), respectively as exact method and as heuristic, deserve a special mention for the number of relevant publications and successful implementations related to them. In this paper we present a new exact method for convex mixed-integer non-linear programming called proximal outer approximation (POA). POA blends the fundamental ideas behind FP into the general OA scheme that attepts to yield faster and more robust convergence with respect to OA while retaining the good performances in terms of fast generation of feasible solutions of FP.

Keywords: Feasibility pump; Linear outer approximation; Mixed-integer non-linear optimization; Mixed-integer programming (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10589-020-00216-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:coopap:v:77:y:2020:i:3:d:10.1007_s10589-020-00216-9

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-020-00216-9

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().