A scalarization proximal point method for quasiconvex multiobjective minimization
From MaRDI portal
Abstract: In this paper we propose a scalarization proximal point method to solve multiobjective unconstrained minimization problems with locally Lipschitz and quasiconvex vector functions. We prove, under natural assumptions, that the sequence generated by the method is well defined and converges globally to a Pareto-Clarke critical point. Our method may be seen as an extension, for the non convex case, of the inexact proximal method for multiobjective convex minimization problems studied by Bonnel et al. (SIAM Journal on Optimization 15, 4, 953-970, 2005).
Recommendations
- An inexact scalarization proximal point method for multiobjective quasiconvex minimization
- A linear scalarization proximal point method for quasiconvex multiobjective minimization
- Proximal point method for a special class of nonconvex multiobjective optimization functions
- Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds
- A proximal point-type method for multicriteria optimization
Cites work
- scientific article; zbMATH DE number 908535 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- A proximal point-type method for multicriteria optimization
- A subgradient method for multiobjective optimization
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant
- An inexact proximal method for quasiconvex minimization
- An interior proximal method in vector optimization
- Approximate proximal methods in vector optimization
- Clarke Subgradients of Stratifiable Functions
- Convergence and efficiency of subgradient methods for quasiconvex minimization
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- Direct Multisearch for Multiobjective Optimization
- Duality for multiobjective optimization via nonlinear Lagrangian functions
- Full convergence of the proximal point method for quasiconvex functions on Hadamard manifolds
- Handbook of generalized convexity and generalized monotonicity
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints
- Interior proximal methods for quasiconvex optimization
- Introduction to nonsmooth optimization. Theory, practice and software
- Microeconomic theory
- New Proximal Point Algorithms for Convex Minimization
- Nonlinear Programming
- Nonlinear multiobjective optimization
- Optimization and nonsmooth analysis
- Proximal Methods in Vector Optimization
- Proximal point method for minimizing quasiconvex locally Lipschitz functions on Hadamard manifolds
- Proximal point methods for quasiconvex and convex functions with Bregman distances on Hadamard manifolds
- Quasiconvex optimization and location theory
- Subdifferential properties of quasiconvex and pseudoconvex functions: Unified approach
- Variational Analysis
Cited in
(26)- An improved proximal method with quasi-distance for nonconvex multiobjective optimization problem
- Convergence of a new nonmonotone memory gradient method for unconstrained multiobjective optimization via robust approach
- 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
- An inexact proximal point method with quasi-distance for quasi-convex multiobjective optimization
- Proximal algorithm with quasidistances for multiobjective quasiconvex minimization in Riemannian manifolds
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- An inexact proximal point method for quasiconvex multiobjective optimization
- 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
- The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem
- Global optimization for non-convex programs via convex proximal point method
- Variants for the logarithmic-quadratic proximal point scalarization method for multiobjective programming
- Proximal point algorithm for differentiable quasi-convex multiobjective optimization
- Convergence analysis of a generalized proximal algorithm for multiobjective quasiconvex minimization on Hadamard manifolds
- Quadratic scalarization for decomposed multiobjective optimization
- The proximal point method with a vectorial Bregman regularization in multiobjective DC programming
- A logarithmic-quadratic proximal point scalarization method for multiobjective programming
- Proximal point method for a special class of nonconvex multiobjective optimization functions
- Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm
- Inexact proximal point algorithm for multiobjective optimization
- A convex quadratic semi-definite programming approach to the partial additive constant problem in multidimensional scaling
- Convergence rates of subgradient methods for quasi-convex optimization problems
- An inexact scalarization proximal point method for multiobjective quasiconvex minimization
- Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds
- Logarithmic quasi-distance proximal point scalarization method for multi-objective programming
This page was built for publication: A scalarization proximal point method for quasiconvex multiobjective minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q905757)
