An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems
From MaRDI portal
Publication:2150773
DOI10.1007/s10479-020-03808-0zbMath1490.90272OpenAlexW3092312723MaRDI QIDQ2150773
N. Hoseini Monjezi, Soghra Nobakhtian
Publication date: 30 June 2022
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-020-03808-0
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonsmooth analysis (49J52)
Related Items
A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions ⋮ New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiple-gradient descent algorithm (MGDA) for multiobjective optimization
- On approximations with finite precision in bundle methods for nonsmooth optimization
- Cutting plane oracles to minimize non-smooth non-convex functions
- A multi-objective evolutionary optimization approach for an integrated location-inventory distribution network problem under vendor-managed inventory systems
- Divide to conquer: decomposition methods for energy optimization
- Incremental-like bundle methods with application to energy planning
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Nonlinear multiobjective optimization
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- Robust multiobjective optimization with application to Internet routing
- Approximations in proximal bundle methods and decomposition of convex programs
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
- A filter proximal bundle method for nonsmooth nonconvex constrained optimization
- Nonsmooth multiobjective programming with quasi-Newton methods
- Methods of descent for nondifferentiable optimization
- Multi-objective machine learning
- A subgradient method for multiobjective optimization
- Level bundle methods for oracles with on-demand accuracy
- On Nonsmooth Multiobjective Optimality Conditions with Generalized Convexities
- A Redistributed Proximal Bundle Method for Nonconvex Optimization
- Approximate convexity in vector optimisation
- Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization
- Proximal Methods in Vector Optimization
- New limited memory bundle method for large-scale nonsmooth optimization
- Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values
- A proximal bundle method based on approximate subgradients
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
