A proximal point algorithm with a ϕ-divergence for quasiconvex programming

DOI10.1080/02331930902884273zbMath1194.90098OpenAlexW2041791424MaRDI QIDQ2786322

F. G. M. Cunha, João Xavier da Cruz Neto, Paulo Roberto Oliveira

Publication date: 21 September 2010

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930902884273

zbMATH Keywords

proximal point algorithmsquasiconvex programming\(\varphi \)-divergences

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items (11)

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 ⋮ 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 ⋮ Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints ⋮ An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels ⋮ A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant ⋮ An extension of the proximal point algorithm beyond convexity

Cites Work

• On the convergence of the exponential multiplier method for convex programming
• Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization.
• Multiplicative iterative algorithms for convex programming
• Fractional programming by lower subdifferentiability techniques
• Proximal minimization algorithm with \(D\)-functions
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Quasi-Concave Programming
• On the Convergence of the Proximal Point Algorithm for Convex Minimization
• Entropic Proximal Mappings with Applications to Nonlinear Programming
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Central Paths, Generalized Proximal Point Methods, and Cauchy Trajectories in Riemannian Manifolds
• Lower subdifferentiability in minimax fractional programming^*
• Convergence of Proximal-Like Algorithms
• Proximal Minimization Methods with Generalized Bregman Functions
• Proximal Point Algorithm On Riemannian Manifolds
• 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
• Dual convergence of the proximal point method with Bregman distances for linear programming

This page was built for publication: A proximal point algorithm with a ϕ-divergence for quasiconvex programming