Pages that link to "Item:Q1037657"
From MaRDI portal
The following pages link to A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant (Q1037657):
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)
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints (Q1762409) (← 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)
- A trust-region method for unconstrained multiobjective problems with applications in satisficing processes (Q2251574) (← 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)
- Convergence analysis of a proximal point algorithm for minimizing differences of functions (Q2977635) (← links)
- A New Boosted Proximal Point Algorithm for Minimizing Nonsmooth DC Functions (Q5099775) (← links)
