A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
From MaRDI portal
Publication:2301136
DOI10.1007/s10589-019-00139-0zbMath1433.90148OpenAlexW2980429560MaRDI QIDQ2301136
Sandro Dimy Barbosa Bitar, João Carlos de Oliveira Souza, Antoine Soubeyran, João Xavier da Cruz Neto, Glaydston~de Carvalho Bento
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
multi-objective programmingproximal point methodDC functionvariational rationalitybehavioral sciences
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonsmooth analysis (49J52) Applications of game theory (91A80)
Related Items
The proximal point method with a vectorial Bregman regularization in multiobjective DC programming ⋮ Abstract regularized equilibria: application to Becker's household behavior theory ⋮ General descent method using w-distance. Application to emergence of habits following worthwhile moves ⋮ Learnable Descent Algorithm for Nonsmooth Nonconvex Image Reconstruction ⋮ An improved proximal method with quasi-distance for nonconvex multiobjective optimization problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions
- A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application
- Optimality conditions for vector optimization problems with difference of convex maps
- 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
- Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
- An interior proximal method in vector optimization
- Duality and optimality conditions for generalized equilibrium problems involving DC functions
- A proximal point-type method for multicriteria optimization
- 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
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
- A multicriteria approach to the location of public facilities
- Subdifferentials of nonconvex vector-valued functions
- Weak Pareto-optimal necessary conditions in a nondifferentiable multiobjective program on a Banach space
- On the Clarke subdifferential of the distance function of a closed set
- Convex vector functions and their subdifferential
- A production-transportation problem with stochastic demand and concave production costs
- Nonlinear multiobjective optimization
- Duality for multiobjective optimization via nonlinear Lagrangian functions
- A proximal difference-of-convex algorithm with extrapolation
- A relaxed projection method for solving multiobjective optimization problems
- A steepest descent method for vector optimization
- A projected gradient method for vector optimization problems
- A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem
- The self regulation problem as an inexact steepest descent method for multicriteria optimization
- Nonsmooth multiobjective programming with quasi-Newton methods
- Approximate proximal methods in vector optimization
- A subgradient method for multiobjective optimization
- On difference convexity of locally Lipschitz functions
- On the convergence of the projected gradient method for vector optimization
- A proximal algorithm with quasi distance. Application to habit's formation
- One step from DC optimization to DC mixed variational inequalities
- Newton's Method for Multiobjective Optimization
- Convergence of New Inertial Proximal Methods for DC Programming
- Generalized Gradients and Applications
- Monotone Operators and the Proximal Point Algorithm
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Variational Analysis and Applications
- Optimality conditions for weakly efficient solutions of vector variational inequalities via convexificators
- The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem
- Proximal Methods in Vector Optimization
- A Subgradient Method for Vector Optimization Problems
- Clarke critical values of subanalytic Lipschitz continuous functions
- Proximité et dualité dans un espace hilbertien
- Simplified optimality conditions for minimizing the difference of vector-valued functions
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
