A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data
type: Item
instance of: scholarly article
title: A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data
zbMATH Open document ID: 1483.90152
author: Yanyan Li
published in: Numerical Algorithms
publication date: 2022-01-13T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 49J52
zbMATH DE Number: 7456991
zbMATH Keywords: multiobjective problem
zbMATH Keywords: inexact information
zbMATH Keywords: nonsmooth optimization
zbMATH Keywords: proximal bundle method
zbMATH Keywords: constrained programming
MaRDI profile type: Publication
full work available at URL: s11075-021-01128-3
OpenAlex ID: W3170718144
cites work: Introduction to Nonsmooth Optimization
cites work: Proximal Methods in Vector Optimization
cites work: Q4375488
cites work: Benchmarking optimization software with performance profiles.
cites work: Q4387168
cites work: An efficient descent method for locally Lipschitz multiobjective optimization problems
cites work: Approximate convexity in vector optimisation
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 proximal bundle method based on approximate subgradients
cites work: Q3923954
cites work: A filter proximal bundle method for nonsmooth nonconvex constrained optimization
cites work: A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
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: Q3678980
cites work: Approximations in proximal bundle methods and decomposition of convex programs
cites work: Q4182270
cites work: An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
cites work: An incremental bundle method for portfolio selection problem under second-order stochastic dominance
cites work: Nonlinear multiobjective optimization
cites work: Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization
cites work: Cutting plane oracles to minimize non-smooth non-convex functions
cites work: Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values
cites work: Divide to conquer: decomposition methods for energy optimization
cites work: On approximations with finite precision in bundle methods for nonsmooth optimization
cites work: A Bibliography on the Applications of Mathematical Programming Multiple-objective Methods
DOI: 10.1007/S11075-021-01128-3
Recommended article: An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems
Recommended article: A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems
Recommended article: A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
Recommended article: A proximal bundle method for nonsmooth and nonconvex constrained optimization
Recommended article: A proximal bundle method with inexact data for convex nondifferentiable minimization
Recommended article: A proximal bundle method for nonsmooth nonconvex functions with inexact information
Recommended article: A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems
Recommended article: A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization
Recommended article: A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
Recommended article: Q3381090
description: scientific article; zbMATH DE number 7456991