A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data
From MaRDI portal
Publication:2066220
DOI10.1007/s11075-021-01128-3zbMath1483.90152OpenAlexW3170718144MaRDI QIDQ2066220
Publication date: 13 January 2022
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-021-01128-3
nonsmooth optimizationproximal bundle methodinexact informationconstrained programmingmultiobjective problem
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 ⋮ Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems ⋮ New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On approximations with finite precision in bundle methods for nonsmooth optimization
- Cutting plane oracles to minimize non-smooth non-convex functions
- Divide to conquer: decomposition methods for energy optimization
- Nonlinear multiobjective optimization
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
- 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
- An efficient descent method for locally Lipschitz multiobjective optimization problems
- An incremental bundle method for portfolio selection problem under second-order stochastic dominance
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- Introduction to Nonsmooth Optimization
- A Redistributed Proximal Bundle Method for Nonconvex Optimization
- Approximate convexity in vector optimisation
- A Bibliography on the Applications of Mathematical Programming Multiple-objective Methods
- Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming
- Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization
- Proximal Methods in Vector Optimization
- Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values
- A proximal bundle method based on approximate subgradients
- Benchmarking optimization software with performance profiles.
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
