A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems

DOI10.1007/S10589-019-00139-0zbMATH Open1433.90148OpenAlexW2980429560MaRDI QIDQ2301136FDOQ2301136

J. X. da Cruz Neto, Sandro Dimy Barbosa Bitar, João Carlos de Oliveira Souza, Glaydston~de Carvalho Bento, Antoine Soubeyran

Publication date: 28 February 2020

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://hal-amu.archives-ouvertes.fr/hal-02351104/file/Manuscript_2020.pdf

Recommendations

• Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions
• Proximal point method for a special class of nonconvex multiobjective optimization functions
• 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
• The proximal point method with a vectorial Bregman regularization in multiobjective DC programming

zbMATH Keywords

multi-objective programmingproximal point methodDC functionvariational rationalitybehavioral sciences

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonconvex programming, global optimization (90C26) Applications of game theory (91A80) Nonsmooth analysis (49J52)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Nonlinear multiobjective optimization
• On difference convexity of locally Lipschitz functions
• Monotone Operators and the Proximal Point Algorithm
• Title not available (Why is that?)
• Proximité et dualité dans un espace hilbertien
• Title not available (Why is that?)
• Approximate proximal methods in vector optimization
• Convergence of New Inertial Proximal Methods for DC Programming
• Convex vector functions and their subdifferential
• A proximal algorithm with quasi distance. Application to habit's formation
• Generalized Gradients and Applications
• A production-transportation problem with stochastic demand and concave production costs
• Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions
• Title not available (Why is that?)
• Proximal Methods in Vector Optimization
• An interior proximal method in vector optimization
• A proximal point-type method for multicriteria optimization
• A Subgradient Method for Vector Optimization Problems
• A steepest descent method for vector optimization
• A projected gradient method for vector optimization problems
• The self regulation problem as an inexact steepest descent method for multicriteria optimization
• On the convergence of the projected gradient method for vector optimization
• Newton's Method for Multiobjective Optimization
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Nonsmooth multiobjective programming with quasi-Newton methods
• A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application
• Solving DC programs using the cutting angle method
• Generalized inexact proximal algorithms: routine's formation with resistance to change, following worthwhile changes
• A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality
• On functions representable as a difference of convex functions
• A proximal point algorithm for DC functions on Hadamard manifolds
• A scalarization proximal point method for quasiconvex multiobjective minimization
• Duality and optimality conditions for generalized equilibrium problems involving DC functions
• Weak Pareto-optimal necessary conditions in a nondifferentiable multiobjective program on a Banach space
• Optimality conditions for weakly efficient solutions of vector variational inequalities via convexificators
• Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
• Clarke critical values of subanalytic Lipschitz continuous functions
• Title not available (Why is that?)
• A multicriteria approach to the location of public facilities
• Optimality conditions for vector optimization problems with difference of convex maps
• Simplified optimality conditions for minimizing the difference of vector-valued functions
• Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
• Duality for multiobjective optimization via nonlinear Lagrangian functions
• On the Clarke subdifferential of the distance function of a closed set
• A relaxed projection method for solving multiobjective optimization problems
• A subgradient method for multiobjective optimization
• One step from DC optimization to DC mixed variational inequalities
• Variational Analysis and Applications
• A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem
• Subdifferentials of nonconvex vector-valued functions
• The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem
• A proximal difference-of-convex algorithm with extrapolation

Cited In (7)

• An improved proximal method with quasi-distance for nonconvex multiobjective optimization problem
• An inexact proximal point method with quasi-distance for quasi-convex multiobjective optimization
• General descent method using w-distance. Application to emergence of habits following worthwhile moves
• Abstract regularized equilibria: application to Becker's household behavior theory
• The proximal point method with a vectorial Bregman regularization in multiobjective DC programming
• Abstract generalized epsilon-descent algorithm
• Learnable Descent Algorithm for Nonsmooth Nonconvex Image Reconstruction

This page was built for publication: A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems

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