A bundle method for nonsmooth DC programming with application to chance-constrained problems

W. Ackooij, S. Demassey, P. Javal (), H. Morais, W. Oliveira and B. Swaminathan
Additional contact information
W. Ackooij: EDF R&D
S. Demassey: PSL – Research University
P. Javal: EDF R&D
H. Morais: Universidade de Lisboa
W. Oliveira: PSL – Research University
B. Swaminathan: EDF R&D

Computational Optimization and Applications, 2021, vol. 78, issue 2, No 5, 490 pages

Abstract: Abstract This work considers nonsmooth and nonconvex optimization problems whose objective and constraint functions are defined by difference-of-convex (DC) functions. We consider an infeasible bundle method based on the so-called improvement functions to compute critical points for problems of this class. Our algorithm neither employs penalization techniques nor solves subproblems with linearized constraints. The approach, which encompasses bundle methods for nonlinearly-constrained convex programs, defines trial points as solutions of strongly convex quadratic programs. Different stationarity definitions are investigated, depending on the functions’ structures. The approach is assessed in a class of nonsmooth DC-constrained optimization problems modeling chance-constrained programs.

Keywords: DC programming; Nonsmooth optimization; Variational analysis; Chance constraints (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://link.springer.com/10.1007/s10589-020-00241-8 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:78:y:2021:i:2:d:10.1007_s10589-020-00241-8

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

DOI: 10.1007/s10589-020-00241-8

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 ().