A linear scalarization proximal point method for quasiconvex multiobjective minimization
DOI10.1007/s10957-019-01582-zzbMath1471.49022arXiv1510.00461OpenAlexW2976862921MaRDI QIDQ2278894
Hellena Christina Fernandes Apolinário, Kely Diana Villacorta, Paulo Roberto Oliveira, Erik Alex Papa Quiroz
Publication date: 11 December 2019
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.00461
proximal point methodsFejér convergencemultiobjective minimizationPareto-Clarke critical pointlower semicontinuous quasiconvex functions
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Numerical optimization and variational techniques (65K10) Numerical methods based on nonlinear programming (49M37)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An inexact proximal method for quasiconvex minimization
- An interior proximal method in vector optimization
- Handbook of generalized convexity and generalized monotonicity
- A proximal point-type method for multicriteria optimization
- A scalarization proximal point method for quasiconvex multiobjective minimization
- Nonlinear multiobjective optimization
- Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems
- Approximate proximal methods in vector optimization
- Clarke's Gradients and Epsilon-Subgradients in Banach Spaces
- An Existence Theorem in Vector Optimization
- ε-Subdifferential and ε-monotonicity
- Variational Analysis
- Proximal Methods in Vector Optimization
- Nonlinear Programming