A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints

Giulio Galvan (), Marco Sciandrone () and Stefano Lucidi ()
Additional contact information
Giulio Galvan: DINFO, Università di Firenze
Marco Sciandrone: DINFO, Università di Firenze
Stefano Lucidi: DIAG, “Sapienza” Universitá di Roma

Computational Optimization and Applications, 2021, vol. 80, issue 1, No 2, 33-53

Abstract: Abstract In the present paper we propose to rewrite a nonsmooth problem subjected to convex constraints as an unconstrained problem. We show that this novel formulation shares the same global and local minima with the original constrained problem. Moreover, the reformulation can be solved with standard nonsmooth optimization methods if we are able to make projections onto the feasible sets. Numerical evidence shows that the proposed formulation compares favorably against state-of-art approaches. Code can be found at https://github.com/jth3galv/dfppm .

Keywords: Nonsmooth constrained optimization; Derivative-free (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10589-021-00296-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:80:y:2021:i:1:d:10.1007_s10589-021-00296-1

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

DOI: 10.1007/s10589-021-00296-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 ().