Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming
From MaRDI portal
Publication:925232
DOI10.1007/s10898-007-9156-yzbMath1190.90144OpenAlexW2130533809MaRDI QIDQ925232
Publication date: 3 June 2008
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-007-9156-y
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 ⋮ 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 ⋮ 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 ⋮ On strongly quasiconvex functions: existence results and proximal point algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- On the convergence of the exponential multiplier method for convex programming
- Multiplicative iterative algorithms for convex programming
- A logarithmic-quadratic proximal method for variational inequalities
- Proximal minimization algorithm with \(D\)-functions
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- 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
- Perturbation des méthodes d'optimisation. Applications
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- An Interior Proximal Algorithm and the Exponential Multiplier Method for Semidefinite Programming
- Variational Analysis
- Convergence of Proximal-Like Algorithms
- Proximal Minimization Methods with Generalized Bregman Functions
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Entropy-Like Proximal Methods in Convex Programming
- A Nonmonotone Line Search Technique for Newton’s Method
- Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
- Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
- Proximité et dualité dans un espace hilbertien
This page was built for publication: Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming
