Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization
From MaRDI portal
Publication:4639123
DOI10.1080/02331934.2017.1387259zbMath1398.90158OpenAlexW2763957516WikidataQ109595609 ScholiaQ109595609MaRDI QIDQ4639123
No author found.
Publication date: 3 May 2018
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2017.1387259
Related Items
An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems ⋮ Descent algorithm for nonsmooth stochastic multiobjective optimization ⋮ A Newton-type proximal gradient method for nonlinear multi-objective optimization problems ⋮ Conditional gradient method for multiobjective optimization ⋮ An efficient descent method for locally Lipschitz multiobjective optimization problems ⋮ Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds ⋮ A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiple-gradient descent algorithm (MGDA) for multiobjective optimization
- Proximity control in bundle methods for convex nondifferentiable minimization
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Nonconvex optimization in mechanics. Algorithms, heuristics and engineering applications by the F. E. M
- Nonlinear multiobjective optimization
- Steepest descent methods for multicriteria optimization.
- A steepest descent method for vector optimization
- Quasi-Newton's method for multiobjective optimization
- Nonsmooth multiobjective programming with quasi-Newton methods
- Methods of descent for nondifferentiable optimization
- A subgradient method for multiobjective optimization
- Inexact projected gradient method for vector optimization
- Minimization of functions having Lipschitz continuous first partial derivatives
- Introduction to Nonsmooth Optimization
- On Nonsmooth Multiobjective Optimality Conditions with Generalized Convexities
- An aggregate subgradient method for nonsmooth convex minimization
- A Strongly Convergent Method for Nonsmooth Convex Minimization in Hilbert Spaces
- Newton's Method for Multiobjective Optimization
- Optimization and nonsmooth analysis
- Algorithms for multicriterion optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- An Algorithm for Constrained Optimization with Semismooth Functions
- Survey of Bundle Methods for Nonsmooth Optimization
- Interactive bundle-based method for nondifferentiable multiobjeective optimization: nimbus§
- Multicriteria Optimization
- Proximal Methods in Vector Optimization
- A Subgradient Method for Vector Optimization Problems
- Nonlinear Programming
- Convex Analysis
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- Benchmarking optimization software with performance profiles.
