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 17 items.
- Nomonotone spectral gradient method for sparse recovery (Q256063) (← links)
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function (Q467409) (← 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)
- Decomposition method of descent for minimizing the sum of convex nonsmooth functions (Q1071652) (← 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)
- An algorithm to minimize the sum of a semi-smooth function and a \(C^ 1\) function (Q1908947) (← links)
- Solution methodologies for minimizing a sum of pointwise minima of two functions (Q2679000) (← links)
- A proximal alternating linearization method for nonconvex optimization problems (Q2926053) (← links)
- On minimizing the sum of a convex function and a concave function (Q3724102) (← links)
- A method of linearizations for linearly constrained nonconvex nonsmooth minimization (Q3730358) (← links)
- A Decomposition Method and Its Application to Convex Programming (Q3824112) (← links)
- A method for minimizing convex functions based on continuous approximations to the subdifferential (Q4391285) (← links)
