Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints
type: Item
instance of: scholarly article
title: Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints
zbMATH Open document ID: 1414.90317
author: Outi Montonen
author: Kaisa Joki
published in: Journal of Global Optimization
publication date: 2018-12-07T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 6990987
zbMATH Keywords: multiobjective optimization
zbMATH Keywords: nonsmooth optimization
zbMATH Keywords: nonconvex optimization
zbMATH Keywords: DC programming
zbMATH Keywords: bundle methods
describes a project that uses: MPBNGC
describes a project that uses: PBNCGC
MaRDI profile type: Publication
full work available at URL: s10898-018-0651-0
OpenAlex ID: W2796925970
cites work: Optimizing sensor cover energy via DC programming
cites work: Introduction to Nonsmooth Optimization
cites work: A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
cites work: A Strongly Convergent Method for Nonsmooth Convex Minimization in Hilbert Spaces
cites work: Proximal Methods in Vector Optimization
cites work: Visualizing data as objects by DC (difference of convex) optimization
cites work: Optimization and nonsmooth analysis
cites work: Sufficient optimality condition for vector optimization problems under D.C. data
cites work: Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
cites work: On numerical solving the spherical separability problem
cites work: On functions representable as a difference of convex functions
cites work: Q3720308
cites work: A production-transportation problem with stochastic demand and concave production costs
cites work: DC programming: overview.
cites work: Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions
cites work: A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
cites work: Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming
cites work: An aggregate subgradient method for nonsmooth convex minimization
cites work: Q3678980
cites work: Proximity control in bundle methods for convex nondifferentiable minimization
cites work: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
cites work: The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
cites work: Q3346095
cites work: On Nonsmooth Multiobjective Optimality Conditions with Generalized Convexities
cites work: Q4004158
cites work: Nonlinear multiobjective optimization
cites work: Interactive bundle-based method for nondifferentiable multiobjeective optimization: nimbus§
cites work: Nonconvex optimization in mechanics. Algorithms, heuristics and engineering applications by the F. E. M
cites work: Q4040046
cites work: Algorithms for multicriterion optimization
cites work: Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
cites work: Convex analysis approach to d. c. programming: Theory, algorithms and applications
cites work: Multiobjective DC programs with infinite convex constraints
cites work: Nonsmooth multiobjective programming with quasi-Newton methods
cites work: A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
cites work: Q4470269
cites work: Optimality conditions for vector optimization problems of a difference of convex mappings
cites work: Q3208459
cites work: Q3032095
Wikidata QID: Q129983148
DOI: 10.1007/S10898-018-0651-0
description: scientific article; zbMATH DE number 6990987