An improved proximal method with quasi-distance for nonconvex multiobjective optimization problem
From MaRDI portal
Publication:2101160
DOI10.1515/jaa-2021-2074OpenAlexW4205829953MaRDI QIDQ2101160
A. P. Farajzadeh, Fouzia Amir, Jehad O. Alzabut
Publication date: 28 November 2022
Published in: Journal of Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jaa-2021-2074
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Optimality conditions for minimax problems (49K35) Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49K30)
Cites Work
- Approximate solutions of multiobjective optimization problems
- An inexact proximal method for quasiconvex minimization
- A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
- A proximal point algorithm with quasi-distance in multi-objective optimization
- Partial quasi-metrics
- A scalarization proximal point method for quasiconvex multiobjective minimization
- On the Clarke subdifferential of the distance function of a closed set
- Applications of utility functions defined on quasi-metric spaces
- Recursive quasi-metric spaces.
- Multicriteria optimization in engineering and in the sciences
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
- Approximate proximal methods in vector optimization
- A proximal algorithm with quasi distance. Application to habit's formation
- Optimization and nonsmooth analysis
- Generalized Gradients and Applications
- The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem
- Unnamed Item
This page was built for publication: An improved proximal method with quasi-distance for nonconvex multiobjective optimization problem
