The proximal point method with a vectorial Bregman regularization in multiobjective DC programming
From MaRDI portal
Publication:5034939
DOI10.1080/02331934.2020.1755862zbMath1486.90159OpenAlexW3019130418MaRDI QIDQ5034939
R. C. M. Silva, Sandro Dimy Barbosa Bitar, Jurandir de O. Lopes, João Carlos de O. Souza, João Xavier da Cruz Neto
Publication date: 21 February 2022
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2020.1755862
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global convergence of a proximal linearized algorithm for difference of convex functions
- A logarithmic-quadratic proximal point scalarization method for multiobjective programming
- An interior proximal method in vector optimization
- A proximal point-type method for multicriteria optimization
- A proximal point algorithm for DC functions on Hadamard manifolds
- A scalarization proximal point method for quasiconvex multiobjective minimization
- 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
- Proximal minimization algorithm with \(D\)-functions
- Duality for multiobjective optimization via nonlinear Lagrangian functions
- Multi-stage distributionally robust optimization with risk aversion
- A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem
- Multiobjective DC programs with infinite convex constraints
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
- A Proximal Point Method for the Variational Inequality Problem in Banach Spaces
- Generalized proximal point algorithms for multiobjective optimization problems
- Direct Multisearch for Multiobjective Optimization
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Generalized Gradients and Applications
- Monotone Operators and the Proximal Point Algorithm
- A mixed Hölder and Minkowski inequality
- Proximal Minimization Methods with Generalized Bregman Functions
- A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
- The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels
- Proximal Methods in Vector Optimization
- Clarke critical values of subanalytic Lipschitz continuous functions
- Proximité et dualité dans un espace hilbertien
