Pages that link to "Item:Q3705231"
From MaRDI portal
The following pages link to Descent methods for composite nondifferentiable optimization problems (Q3705231):
Displayed 12 items.
- Convex composite multi-objective nonsmooth programming (Q687035) (← links)
- A nonlinear descent method for a variational inequality on a nonconvex set (Q735924) (← links)
- Global convergence of a semi-infinite optimization method (Q912572) (← links)
- A coordinate gradient descent method for nonsmooth separable minimization (Q959979) (← links)
- A trust region algorithm for minimization of locally Lipschitzian functions (Q1338134) (← links)
- A relative weighting method for estimating parameters and variances in multiple data sets (Q1350410) (← links)
- Iteration functions in some nonsmooth optimization algorithms (Q1363553) (← links)
- A robust sequential quadratic programming method (Q1825141) (← links)
- Epigraphical nesting: A unifying theory for the convergence of algorithms (Q1893312) (← links)
- A Gauss-Newton method for convex composite optimization (Q1914073) (← links)
- Unification of basic and composite nondifferentiable optimization (Q1924063) (← links)
- Second order necessary and sufficient conditions for convex composite NDO (Q3782317) (← links)