A scalarization proximal point method for quasiconvex multiobjective minimization
From MaRDI portal
Publication:905757
DOI10.1007/s10898-015-0367-3zbMath1357.90127arXiv1403.0150OpenAlexW2154167715MaRDI QIDQ905757
Paulo Roberto Oliveira, Erik Alex Papa Quiroz, Hellena Christina Fernandes Apolinário
Publication date: 28 January 2016
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.0150
quasiconvex functionsClarke subdifferentialproximal point methodsFejér convergencemultiobjective minimizationPareto-Clarke critical point
Related Items (17)
The proximal point method with a vectorial Bregman regularization in multiobjective DC programming ⋮ Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm ⋮ An inexact scalarization proximal point method for multiobjective quasiconvex minimization ⋮ Proximal algorithm with quasidistances for multiobjective quasiconvex minimization in Riemannian manifolds ⋮ Inexact proximal point algorithm for quasiconvex optimization problems on Hadamard manifolds ⋮ On the convergence rate of a proximal point algorithm for vector function on Hadamard manifolds ⋮ Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds ⋮ Global optimization for non-convex programs via convex proximal point method ⋮ The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem ⋮ Proximal point method for a special class of nonconvex multiobjective optimization functions ⋮ A linear scalarization proximal point method for quasiconvex multiobjective minimization ⋮ A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems ⋮ Unnamed Item ⋮ Convergence rates of subgradient methods for quasi-convex optimization problems ⋮ An improved proximal method with quasi-distance for nonconvex multiobjective optimization problem ⋮ Proximal point algorithm for differentiable quasi-convex multiobjective optimization ⋮ Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
Cites Work
- An inexact proximal method for quasiconvex minimization
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant
- Interior proximal methods for quasiconvex optimization
- Proximal point method for minimizing quasiconvex locally Lipschitz functions on Hadamard manifolds
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- An interior proximal method in vector optimization
- Handbook of generalized convexity and generalized monotonicity
- A proximal point-type method for multicriteria optimization
- Subdifferential properties of quasiconvex and pseudoconvex functions: Unified approach
- Nonlinear multiobjective optimization
- Quasiconvex optimization and location theory
- Duality for multiobjective optimization via nonlinear Lagrangian functions
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints
- Approximate proximal methods in vector optimization
- A subgradient method for multiobjective optimization
- Full convergence of the proximal point method for quasiconvex functions on Hadamard manifolds
- Introduction to Nonsmooth Optimization
- Direct Multisearch for Multiobjective Optimization
- Clarke Subgradients of Stratifiable Functions
- Optimization and nonsmooth analysis
- New Proximal Point Algorithms for Convex Minimization
- Variational Analysis
- Proximal Methods in Vector Optimization
- Nonlinear Programming
- Convergence and efficiency of subgradient methods for quasiconvex minimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A scalarization proximal point method for quasiconvex multiobjective minimization
