Proximal point method for a special class of nonconvex multiobjective optimization functions
From MaRDI portal
Publication:1744628
DOI10.1007/s11590-017-1114-0zbMath1415.90114arXiv1504.00424OpenAlexW2963540288MaRDI QIDQ1744628
Orizon P. Ferreira, V. L. Sousa Junior, Glaydston C. Bento
Publication date: 19 April 2018
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.00424
Related Items
A proximal gradient splitting method for solving convex vector optimization problems ⋮ Proximal point methods for Lipschitz functions on Hadamard manifolds: scalar and vectorial cases ⋮ Inexact multi-objective local search proximal algorithms: application to group dynamic and distributive justice problems ⋮ Global optimization for non-convex programs via convex proximal point method ⋮ A strongly convergent proximal point method for vector optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
- An interior proximal method in vector optimization
- A proximal point-type method for multicriteria optimization
- Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
- A scalarization proximal point method for quasiconvex multiobjective minimization
- Proximal point methods and nonconvex optimization
- Necessary conditions for super minimizers in constrained multiobjective optimization
- Approximate proximal methods in vector optimization
- Direct Multisearch for Multiobjective Optimization
- A generalized proximal point algorithm for certain non-convex minimization problems
- Proximal Methods in Vector Optimization
- Vector duality for convex vector optimization problems by means of the quasi-interior of the ordering cone
- Convex Analysis
