Pages that link to "Item:Q463369"
From MaRDI portal
The following pages link to Method of conjugate subgradients with constrained memory (Q463369):
Displaying 12 items.
- A method of conjugate subgradients for the minimization of functionals (Q1119494) (← links)
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization (Q1644014) (← links)
- Proximal primal-dual best approximation algorithm with memory (Q1756584) (← links)
- Non-Euclidean restricted memory level method for large-scale convex optimization (Q1774171) (← links)
- Computational experience and challenges with the conjugate epi-projection algorithms for non-smooth optimization (Q1982928) (← links)
- Machine learning algorithms of relaxation subgradient method with space extension (Q2117655) (← links)
- On the properties of the method of minimization for convex functions with relaxation on the distance to extremum (Q2287166) (← links)
- A non-monotone conjugate subgradient type method for minimization of convex functions (Q2302755) (← links)
- (Q4963670) (← links)
- ON THE CONVERGENCE RATE OF THE SUBGRADIENT METHOD WITH METRIC VARIATION AND ITS APPLICATIONS IN NEURAL NETWORK APPROXIMATION SCHEMES (Q5042979) (← links)
- Numerical methods for constructing suboptimal packings of nonconvex domains with curved boundary (Q5090167) (← links)
- Optimization of subgradient method parameters on the base of rank-two correction of metric matrices (Q5878623) (← links)
