Pages that link to "Item:Q1057185"
From MaRDI portal
The following pages link to A method for minimizing the sum of a convex function and a continuously differentiable function (Q1057185):
Displaying 10 items.
- Nomonotone spectral gradient method for sparse recovery (Q256063) (← links)
- An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems (Q824547) (← links)
- A coordinate gradient descent method for nonsmooth separable minimization (Q959979) (← links)
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization (Q1016411) (← links)
- A successive quadratic programming method for a class of constrained nonsmooth optimization problems (Q1174457) (← links)
- Partial linearization methods in nonlinear programming (Q1321373) (← links)
- A minimizing algorithm for complex nonconvex nondifferentiable functions (Q1904979) (← links)
- A parallel descent algorithm for convex programming (Q1908925) (← links)
- A proximal alternating linearization method for nonconvex optimization problems (Q2926053) (← links)
- A method of linearizations for linearly constrained nonconvex nonsmooth minimization (Q3730358) (← links)