An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels
From MaRDI portal
Publication:5228821
DOI10.1080/02331934.2018.1476859zbMath1423.90197OpenAlexW2807406302MaRDI QIDQ5228821
João Carlos O. Souza, João Xavier da Cruz Neto, Paulo Sérgio M. Santos, Jurandir O. Lopes
Publication date: 13 August 2019
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2018.1476859
Bregman distancesDC functionsinterior proximal methodsproximal distancesecond-order homogeneous kernels
Related Items
The proximal point method with a vectorial Bregman regularization in multiobjective DC programming ⋮ Alternating DC algorithm for partial DC programming problems ⋮ A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning ⋮ On a Bregman regularized proximal point method for solving equilibrium problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global convergence of a proximal linearized algorithm for difference of convex functions
- Codifferential method for minimizing nonsmooth DC functions
- On a generalized proximal point method for solving equilibrium problems in Banach spaces
- On functions representable as a difference of convex functions
- Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming
- An inexact interior point proximal method for the variational inequality problem
- An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
- Approximate iterations in Bregman-function-based proximal algorithms
- Proximal minimization algorithm with \(D\)-functions
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- Interior projection-like methods for monotone variational inequalities
- A Proximal Point Method for the Variational Inequality Problem in Banach Spaces
- An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
- A proximal point algorithm with a ϕ-divergence for quasiconvex programming
- Generalized Proximal Distances for Bilevel Equilibrium Problems
- Inexact Proximal Point Methods for Variational Inequality Problems
- On difference convexity of locally Lipschitz functions
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Interior proximal extragradient method for equilibrium problems
- Monotone Operators and the Proximal Point Algorithm
- Variational Analysis
- Proximal Minimization Methods with Generalized Bregman Functions
- A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
- A Method for Minimization of Quasidifferentiable Functions
- Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Proximité et dualité dans un espace hilbertien
