A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
From MaRDI portal
Publication:2301136
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
Cites work
- scientific article; zbMATH DE number 3950216 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 2063780 (Why is no real title available?)
- scientific article; zbMATH DE number 2076851 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality
- A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem
- A multicriteria approach to the location of public facilities
- A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application
- A production-transportation problem with stochastic demand and concave production costs
- A projected gradient method for vector optimization problems
- A proximal algorithm with quasi distance. Application to habit's formation
- A proximal difference-of-convex algorithm with extrapolation
- A proximal point algorithm for DC functions on Hadamard manifolds
- A proximal point-type method for multicriteria optimization
- A relaxed projection method for solving multiobjective optimization problems
- A scalarization proximal point method for quasiconvex multiobjective minimization
- A steepest descent method for vector optimization
- A subgradient method for multiobjective optimization
- A subgradient method for vector optimization problems
- An interior proximal method in vector optimization
- Approximate proximal methods in vector optimization
- Clarke critical values of subanalytic Lipschitz continuous functions
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
- Convergence of New Inertial Proximal Methods for DC Programming
- Convex vector functions and their subdifferential
- Duality and optimality conditions for generalized equilibrium problems involving DC functions
- Duality for multiobjective optimization via nonlinear Lagrangian functions
- Generalized Gradients and Applications
- Generalized inexact proximal algorithms: routine's formation with resistance to change, following worthwhile changes
- Hybrid approximate proximal algorithms for efficient solutions in vector optimization
- Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
- Monotone Operators and the Proximal Point Algorithm
- Newton's method for multiobjective optimization
- Nonlinear multiobjective optimization
- Nonsmooth multiobjective programming with quasi-Newton methods
- On difference convexity of locally Lipschitz functions
- On functions representable as a difference of convex functions
- On the Clarke subdifferential of the distance function of a closed set
- On the convergence of the projected gradient method for vector optimization
- One step from DC optimization to DC mixed variational inequalities
- Optimality conditions for vector optimization problems with difference of convex maps
- Optimality conditions for weakly efficient solutions of vector variational inequalities via convexificators
- Proximal Methods in Vector Optimization
- Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions
- Proximité et dualité dans un espace hilbertien
- Simplified optimality conditions for minimizing the difference of vector-valued functions
- Solving DC programs using the cutting angle method
- Subdifferentials of nonconvex vector-valued functions
- The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem
- The self regulation problem as an inexact steepest descent method for multicriteria optimization
- Variational analysis and applications
- Weak Pareto-optimal necessary conditions in a nondifferentiable multiobjective program on a Banach space
Cited in
(9)- Learnable descent algorithm for nonsmooth nonconvex image reconstruction
- 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
- 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 with a vectorial Bregman regularization in multiobjective DC programming
- Abstract generalized epsilon-descent algorithm
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)
