Derivative-free methods for mixed-integer nonsmooth constrained optimization
Tommaso Giovannelli (),
Giampaolo Liuzzi (),
Stefano Lucidi () and
Francesco Rinaldi ()
Additional contact information
Tommaso Giovannelli: Lehigh University
Giampaolo Liuzzi: Sapienza Università di Roma and Istituto di Analisi dei Sistemi e Informatica (IASI), CNR
Stefano Lucidi: Sapienza Università di Roma
Francesco Rinaldi: Università di Padova
Computational Optimization and Applications, 2022, vol. 82, issue 2, No 1, 293-327
Abstract:
Abstract In this paper, mixed-integer nonsmooth constrained optimization problems are considered, where objective/constraint functions are available only as the output of a black-box zeroth-order oracle that does not provide derivative information. A new derivative-free linesearch-based algorithmic framework is proposed to suitably handle those problems. First, a scheme for bound constrained problems that combines a dense sequence of directions to handle the nonsmoothness of the objective function with primitive directions to handle discrete variables is described. Then, an exact penalty approach is embedded in the scheme to suitably manage nonlinear (possibly nonsmooth) constraints. Global convergence properties of the proposed algorithms toward stationary points are analyzed and results of an extensive numerical experience on a set of mixed-integer test problems are reported.
Keywords: Derivative-free optimization; Nonsmooth optimization; Mixed-integer nonlinear programming; 90C11; 90C56; 65K05 (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)
Downloads: (external link)
http://link.springer.com/10.1007/s10589-022-00363-1 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:82:y:2022:i:2:d:10.1007_s10589-022-00363-1
Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589
DOI: 10.1007/s10589-022-00363-1
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 ().