Pages that link to "Item:Q1134011"

The following pages link to A minimization method for the sum of a convex function and a continuously differentiable function (Q1134011):

Displayed 8 items.

• 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 method for minimizing the sum of a convex function and a continuously differentiable function (Q1057185) ‎ (← 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 parallel descent algorithm for convex programming (Q1908925) ‎ (← links)
• A proximal-point SQP trust region method for solving some special class of nonlinear semi-definite programming problems (Q2489329) ‎ (← links)
• Submonotone mappings and the proximal point algorithm (Q3959022) ‎ (← links)