Pages that link to "Item:Q925232"

The following pages link to Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming (Q925232):

Displaying 11 items.

• An inexact proximal method for quasiconvex minimization (Q319853) (← links)
• An extension of proximal methods for quasiconvex minimization on the nonnegative orthant (Q421699) (← links)
• Proximal point method for minimizing quasiconvex locally Lipschitz functions on Hadamard manifolds (Q441196) (← links)
• A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant (Q1037657) (← links)
• An extension of the proximal point algorithm beyond convexity (Q2114582) (← links)
• On strongly quasiconvex functions: existence results and proximal point algorithms (Q2116608) (← links)
• Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces (Q2141725) (← links)
• A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem (Q2158622) (← links)
• An inexact scalarization proximal point method for multiobjective quasiconvex minimization (Q2675734) (← links)
• Full convergence of the proximal point method for quasiconvex functions on Hadamard manifolds (Q2911444) (← links)
• An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels (Q5228821) (← links)