Smoothing characterizations of nonsmooth multiobjective optimization problems
From MaRDI portal
Cites work
- A class of smoothing functions for nonlinear and mixed complementarity problems
- A descent method for nonsmooth multiobjective optimization in Hilbert spaces
- A gradient-based search method for multi-objective optimization problems
- A non-monotone proximal gradient algorithm for solving nonsmooth multiobjective optimization problems with an extending application to robust multiobjective optimization
- A smoothing method for solving bilevel multiobjective programs with convex scalar program at the lower level
- A smoothing-out technique for min—max optimization
- An effective subgradient algorithm via Mifflin's line search for nonsmooth nonconvex multiobjective optimization
- An efficient descent method for locally Lipschitz multiobjective optimization problems
- An implementable descent method for nonsmooth multiobjective optimization on Riemannian manifolds
- Convex Analysis
- Degrees of Efficiency and Degrees of Minimality
- Extended Newton methods for multiobjective optimization: majorizing function technique and convergence analysis
- First-order methods in optimization
- Gradient-based algorithms for multi-objective bi-level optimization
- scientific article; zbMATH DE number 3737398 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 53965 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- Introductory lectures on convex optimization. A basic course.
- Minimization of unsmooth functionals
- Multicriteria Optimization
- Objective function approximations in mathematical programming
- Proximal point method with Bregman regularization for multiobjective optimization problems on Hadamard manifolds
- Smooth minimization of non-smooth functions
- Smoothing and first order methods: a unified framework
- Smoothing methods for nonsmooth, nonconvex minimization
- Steepest descent methods for multicriteria optimization.
- Vector optimization. Set-valued and variational analysis.
This page was built for publication: Smoothing characterizations of nonsmooth multiobjective optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7314206)
