A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming
type: Item
instance of: scholarly article
title: A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming
zbMATH Open document ID: 1469.90144
author: Jie Shen
author: Jia-Tong Li
author: Fangfang Guo
author: Na Xu
published in: Journal of Numerical Mathematics
publication date: 2021-09-10T00:00:00Z
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 7394128
zbMATH Keywords: nonlinear nonsmooth optimization
zbMATH Keywords: redistributed bundle method
zbMATH Keywords: DC programming
zbMATH Keywords: locally Lipschitz continuous
MaRDI profile type: Publication
full work available at URL: jnma-2019-0049
OpenAlex ID: W3179597857
cites work: Margin maximization in spherical separation
cites work: A Method for Minimization of Quasidifferentiable Functions
cites work: Introduction to Nonsmooth Optimization
cites work: Codifferential method for minimizing nonsmooth DC functions
cites work: Optimization and nonsmooth analysis
cites work: Identifying Structure of Nonsmooth Convex Functions by the Bundle Technique
cites work: Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
cites work: A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
cites work: A Redistributed Proximal Bundle Method for Nonconvex Optimization
cites work: A proximal bundle method for nonsmooth nonconvex functions with inexact information
cites work: A production-transportation problem with stochastic demand and concave production costs
cites work: DC programming: overview.
cites work: A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
cites work: Proximity control in bundle methods for convex nondifferentiable minimization
cites work: Survey of Bundle Methods for Nonsmooth Optimization
cites work: Q4004158
cites work: Solution of the multisource Weber and conditional Weber problems by d. -c. programming
cites work: Q3028166
cites work: Convex Analysis
cites work: Variational Analysis
cites work: A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
cites work: An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions
cites work: A proximal bundle method with inexact data for convex nondifferentiable minimization
cites work: Global convergence of a proximal linearized algorithm for difference of convex functions
cites work: The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
cites work: Convex analysis and global optimization
DOI: 10.1515/JNMA-2019-0049
description: scientific article; zbMATH DE number 7394128