A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant
From MaRDI portal
Publication:1037657
DOI10.1016/j.ejor.2009.03.045zbMath1217.90158OpenAlexW2118690500MaRDI QIDQ1037657
Sissy da S. Souza, Antoine Soubeyran, Paulo Roberto Oliveira, João Xavier da Cruz Neto
Publication date: 16 November 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.03.045
Related Items (12)
Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces ⋮ An inexact proximal method for quasiconvex minimization ⋮ Full convergence of the proximal point method for quasiconvex functions on Hadamard manifolds ⋮ A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem ⋮ A New Boosted Proximal Point Algorithm for Minimizing Nonsmooth DC Functions ⋮ An inexact scalarization proximal point method for multiobjective quasiconvex minimization ⋮ An extension of proximal methods for quasiconvex minimization on the nonnegative orthant ⋮ Bregman proximal point type algorithms for quasiconvex minimization ⋮ Proximal point method for minimizing quasiconvex locally Lipschitz functions on Hadamard manifolds ⋮ Convergence analysis of a proximal point algorithm for minimizing differences of functions ⋮ A trust-region method for unconstrained multiobjective problems with applications in satisficing processes ⋮ Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Calculus of variations in \(L^ \infty\)
- Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization.
- Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming
- Error estimation for Bregman iterations and inverse scale space methods in image restoration
- An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
- Quasiconvex optimization and location theory
- A regularized solution with weighted bregman distances for the inverse problem of photoacoustic spectroscopy
- A tabu search scheme for abstract problems, with applications to the computation of fixed points
- 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
- Variational Analysis in Sobolev andBVSpaces
- Optimality Conditions for Quasiconvex Programs
- New Proximal Point Algorithms for Convex Minimization
- Monotone Operators and the Proximal Point Algorithm
- Convergence of Proximal-Like Algorithms
- Proximal Minimization Methods with Generalized Bregman Functions
- La convexité généralisée en économie mathématique
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
- Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback--Leibler distance minimization
This page was built for publication: A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant
