An efficient descent method for locally Lipschitz multiobjective optimization problems
From MaRDI portal
Publication:2031935
DOI10.1007/s10957-020-01803-wzbMath1469.90130arXiv2004.11578OpenAlexW3120048863MaRDI QIDQ2031935
Sebastian Peitz, Bennet Gebken
Publication date: 15 June 2021
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.11578
Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56) Nonsmooth analysis (49J52)
Related Items
An incremental descent method for multi-objective optimization, Approximations for Pareto and proper Pareto solutions and their KKT conditions, Newton’s method for uncertain multiobjective optimization problems under finite uncertainty sets, Twenty years of continuous multiobjective optimization in the twenty-first century, 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
- Discovering governing equations from data by sparse identification of nonlinear dynamical systems
- A dynamic gradient approach to Pareto optimization with nonsmooth convex objective functions
- Stochastic method for the solution of unconstrained vector optimization problems
- Proximity control in bundle methods for convex nondifferentiable minimization
- Multiobjective optimization problems with equilibrium constraints
- Steepest descent methods for multicriteria optimization.
- Covering Pareto sets by multilevel subdivision techniques
- An effective nonsmooth optimization algorithm for locally Lipschitz functions
- Methods of descent for nondifferentiable optimization
- A subgradient method for multiobjective optimization
- On the hierarchical structure of Pareto critical sets
- Atomic Decomposition by Basis Pursuit
- On the differentiability check in gradient sampling methods
- An adaptive gradient sampling algorithm for non-smooth optimization
- On Nonsmooth Multiobjective Optimality Conditions with Generalized Convexities
- A Nonderivative Version of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Proximity Maps for Convex Sets
- Newton's Method for Multiobjective Optimization
- Optimization and nonsmooth analysis
- Optimization of lipschitz continuous functions
- Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization
- Extended Newton Methods for Multiobjective Optimization: Majorizing Function Technique and Convergence Analysis
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Proximal Methods in Vector Optimization
- A Subgradient Method for Vector Optimization Problems
