A bundle method for nonsmooth DC programming with application to chance-constrained problems
type: Item
instance of: scholarly article
title: A bundle method for nonsmooth DC programming with application to chance-constrained problems
zbMATH Open document ID: 1469.90115
author: Wim van Ackooij
author: Sophie Demassey
author: P. Javal
author: H. Morais
author: Welington de Oliveira
author: B. Swaminathan
published in: Computational Optimization and Applications
publication date: 2021-06-01T00:00:00Z
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 7353234
zbMATH Keywords: DC programming
zbMATH Keywords: nonsmooth optimization
zbMATH Keywords: variational analysis
zbMATH Keywords: chance constraints
MaRDI profile type: Publication
full work available at URL: s10589-020-00241-8
OpenAlex ID: W3110176297
cites work: Convergence analysis of a proximal point algorithm for minimizing differences of functions
cites work: Mixed $H_2/H_\infty$ Control via Nonsmooth Optimization
cites work: Accelerating the DC algorithm for smooth functions
cites work: Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
cites work: A general double-proximal gradient algorithm for d.c. programming
cites work: Q3569180
cites work: Q3996569
cites work: Proximal bundle methods for nonsmooth DC programming
cites work: An inertial algorithm for DC programming
cites work: Benchmarking optimization software with performance profiles.
cites work: Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
cites work: A joint model of probabilistic/robust constraints for gas transport management in stationary networks
cites work: On the quantification of nomination feasibility in stationary gas networks with random load
cites work: A proximal bundle method for nonsmooth nonconvex functions with inexact information
cites work: Sequential Convex Approximations to Joint Chance Constrained Programs: A Monte Carlo Approach
cites work: Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming
cites work: DC programming and DCA: thirty years of developments
cites work: Variations and extension of the convex-concave procedure
cites work: Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints
cites work: Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality
cites work: Computing B-Stationary Points of Nonsmooth DC Programs
cites work: Q4838490
cites work: A local search method for optimization problem with d.c. inequality constraints
cites work: Convex analysis and global optimization
cites work: Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
cites work: (Sub-)Gradient Formulae for Probability Functions of Random Inequality Systems under Gaussian Distribution
cites work: Level bundle methods for constrained convex optimization with various oracles
cites work: Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies
cites work: Constrained Bundle Methods for Upper Inexact Oracles with Application to Joint Chance Constrained Energy Problems
cites work: A proximal difference-of-convex algorithm with extrapolation
DOI: 10.1007/S10589-020-00241-8
description: scientific article; zbMATH DE number 7353234