Proximal point algorithm for differentiable quasi-convex multiobjective optimization
From MaRDI portal
Publication:5865307
DOI10.2298/FIL2007367AzbMath1499.80013MaRDI QIDQ5865307
Fouzia Amir, Narin Petrot, A. P. Farajzadeh
Publication date: 13 June 2022
Published in: Filomat (Search for Journal in Brave)
Convex functions and convex programs in convex geometry (52A41) Optimization problems in thermodynamics and heat transfer (80M50) Multiobjective variational problems, Pareto optimality, applications to economics, etc. (58E17)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems
- A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- A proximal point-type method for multicriteria optimization
- A scalarization proximal point method for quasiconvex multiobjective minimization
- Optimality conditions for directionally differentiable multi-objective programming problems
- Directionally differentiable multiobjective optimization involving discrete inclusions
- The self regulation problem as an inexact steepest descent method for multicriteria optimization
- A subgradient method for multiobjective optimization
- Introduction to Nonsmooth Optimization
- Clarke Subgradients of Stratifiable Functions
- Newton's Method for Multiobjective Optimization
- An Adaptive Scalarization Method in Multiobjective Optimization
- Variational Analysis
- Directional Derivative Calculus and Optimality Conditions in Nonsmooth Mathematical Programming
- Proximal Methods in Vector Optimization
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
This page was built for publication: Proximal point algorithm for differentiable quasi-convex multiobjective optimization
