An extension of proximal methods for quasiconvex minimization on the nonnegative orthant
From MaRDI portal
Publication:421699
DOI10.1016/j.ejor.2011.07.019zbMath1242.90166OpenAlexW2008239061MaRDI QIDQ421699
E. A. Papa Quiroz, Paulo Roberto Oliveira
Publication date: 14 May 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.07.019
Related Items (13)
Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces ⋮ An inexact proximal method for quasiconvex minimization ⋮ A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem ⋮ An inexact algorithm with proximal distances for variational inequalities ⋮ An inexact scalarization proximal point method for multiobjective quasiconvex minimization ⋮ An inexact proximal method with proximal distances for quasimonotone equilibrium problems ⋮ Bregman proximal point type algorithms for quasiconvex minimization ⋮ A scalarization proximal point method for quasiconvex multiobjective minimization ⋮ Logarithmic quasi-distance proximal point scalarization method for multi-objective programming ⋮ Unnamed Item ⋮ Quasi-convex feasibility problems: subgradient methods and convergence rates ⋮ Convergence rates of subgradient methods for quasi-convex optimization problems ⋮ On strongly quasiconvex functions: existence results and proximal point algorithms
Cites Work
- 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
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- The gradient and heavy ball with friction dynamical systems: The quasiconvex case
- A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant
- Quasiconvex optimization and location theory
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- A proximal point algorithm with a ϕ-divergence for quasiconvex programming
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Quasi-Concave Programming
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- Variational Analysis
- Convergence of Proximal-Like Algorithms
- Proximal Minimization Methods with Generalized Bregman Functions
- Hessian Riemannian Gradient Flows in Convex Programming
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Entropy-Like Proximal Methods in Convex Programming
- Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
- Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
This page was built for publication: An extension of proximal methods for quasiconvex minimization on the nonnegative orthant
