A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant
type: Item
instance of: scholarly article
title: A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant
zbMATH Open document ID: 1217.90158
author: Sissy da S. Souza
author: P. R. Oliveira
author: J. X. da Cruz Neto
author: Antoine Soubeyran
published in: European Journal of Operational Research
publication date: 2009-11-16T00:00:00Z
review text: The authors present an interior proximal method with Bregman distance for solving the minimization problem with quasiconvex objective function under nonnegative constraints. The Bregman function is considered separable and zone coercive, and the zone is the interior of the positive orthant. Under the assumption that the solution set is nonempty and the objective function is continuously differentiable, the authors establish the well-definedness of the sequence generated by their algorithm and obtain two important convergence results. In the main result they show that the sequence converges to a solution point of the problem when the regularization parameters go to zero.
reviewed by: Paulo Mbunga
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 5633665
zbMATH Keywords: interior proximal methods
zbMATH Keywords: quasiconvex minimization
zbMATH Keywords: Bregman function
MaRDI profile type: Publication
full work available at URL: j.ejor.2009.03.045
OpenAlex ID: W2118690500
cites work: Q5483173
cites work: Variational Analysis in Sobolev andBVSpaces
cites work: Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization.
cites work: Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
cites work: Calculus of variations in \(L^ \infty\)
cites work: Q4347616
cites work: Error estimation for Bregman iterations and inverse scale space methods in image restoration
cites work: Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback--Leibler distance minimization
cites work: An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
cites work: A proximal point algorithm with a ϕ-divergence for quasiconvex programming
cites work: La convexité généralisée en économie mathématique
cites work: Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
cites work: Quasiconvex optimization and location theory
cites work: New Proximal Point Algorithms for Convex Minimization
cites work: Proximal Minimization Methods with Generalized Bregman Functions
cites work: Optimality Conditions for Quasiconvex Programs
cites work: Q5618030
cites work: A tabu search scheme for abstract problems, with applications to the computation of fixed points
cites work: Q4902563
cites work: Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming
cites work: Q5325670
cites work: Q4257332
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: A regularized solution with weighted bregman distances for the inverse problem of photoacoustic spectroscopy
cites work: An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions
cites work: Convergence of Proximal-Like Algorithms
DOI: 10.1016/J.EJOR.2009.03.045
description: scientific article; zbMATH DE number 5633665