Proximal point method for a special class of nonconvex multiobjective optimization functions

DOI10.1007/S11590-017-1114-0MaRDI QIDQ1744628zbMATH OpenOpenAlexFDO

Authors O. P. Ferreira, V. L. Sousa Junior, G. 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

zbMATH Keywords

nonconvex optimizationmultiobjectivePareto-Clarke optimality

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonconvex programming, global optimization (90C26)

Abstract: The proximal point method for a special class of nonconvex multiobjective functions is studied in this paper. We show that the method is well defined and that the accumulation points of any generated sequence, if any, are Pareto--Clarke critical points. Moreover, under additional assumptions, we show the full convergence of the generated sequence.

Recommendations

• Proximal point methods and nonconvex optimization
• Generalized proximal point algorithms for multiobjective optimization problems
• Proximal point algorithm for differentiable quasi-convex multiobjective optimization
• The proximal point method for nonmonotone variational inequalities
• Inexact proximal point algorithm for multiobjective optimization
• Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions
• A proximal point-type method for multicriteria optimization
• A class of nonlinear proximal point algorithms for variational inequality problems
• Proximal point algorithms for nonsmooth convex optimization with fixed point constraints
• Proximal gradient methods for multiobjective optimization and their applications

Cites work

• scientific article; zbMATH DE number 46303 (Why is no real title available?)
• scientific article; zbMATH DE number 53965 (Why is no real title available?)
• scientific article; zbMATH DE number 1149788 (Why is no real title available?)
• scientific article; zbMATH DE number 2121575 (Why is no real title available?)
• A generalized proximal point algorithm for certain non-convex minimization problems
• A proximal point-type method for multicriteria optimization
• A scalarization proximal point method for quasiconvex multiobjective minimization
• An interior proximal method in vector optimization
• Approximate proximal methods in vector optimization
• Convex Analysis
• Direct Multisearch for Multiobjective Optimization
• Hybrid approximate proximal algorithms for efficient solutions in vector optimization
• Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
• Necessary conditions for super minimizers in constrained multiobjective optimization
• Proximal Methods in Vector Optimization
• Proximal point methods and nonconvex optimization
• Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
• Vector duality for convex vector optimization problems by means of the quasi-interior of the ordering cone

Cited in

(17)

• An improved proximal method with quasi-distance for nonconvex multiobjective optimization problem
• A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
• A proximal gradient splitting method for solving convex vector optimization problems
• Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions
• Inexact multi-objective local search proximal algorithms: application to group dynamic and distributive justice problems
• The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem
• A proximal point-type method for multicriteria optimization
• Global optimization for non-convex programs via convex proximal point method
• A strongly convergent proximal point method for vector optimization
• The NC-proximal average for multiple functions
• Proximal point methods for Lipschitz functions on Hadamard manifolds: scalar and vectorial cases
• Proximal point method for locally Lipschitz functions in multiobjective optimization of Hadamard manifolds
• A scalarization proximal point method for quasiconvex multiobjective minimization
• Inexact proximal point algorithm for multiobjective optimization
• Proximal Newton methods for multiobjective optimization problems
• Benchmark of some nonsmooth optimization solvers for computing nonconvex proximal points
• Generalized proximal point algorithms for multiobjective optimization problems

This page was built for publication: Proximal point method for a special class of nonconvex multiobjective optimization functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744628)