Method of conjugate subgradients with constrained memory
From MaRDI portal
Publication:463369
DOI10.1134/S0005117914040055zbMATH Open1297.90180MaRDI QIDQ463369FDOQ463369
Authors: E. A. Nurminskii, D. Tien 
Publication date: 16 October 2014
Published in: Automation and Remote Control (Search for Journal in Brave)
Recommendations
- A non-monotone conjugate subgradient type method for minimization of convex functions
- An improved subgradient method for constrained nondifferentiable optimization
- An algorithm for linearly constrained convex nondifferentiable minimization problems
- An interior-point based subgradient method for nondifferentiable convex optimization
- Numerical methods for nondifferentiable convex optimization
Cites Work
- Smooth minimization of non-smooth functions
- Methods of conjugate gradients for solving linear systems
- Combined relaxation methods for variational inequalities
- New variants of bundle methods
- A \(\mathcal{VU}\)-algorithm for convex minimization
- Title not available (Why is that?)
- Global convergence of the method of shortest residuals
- On the method of shortest residuals for unconstrained optimization
- Convergence of conjugate gradient methods with constant stepsizes
- Envelope stepsize control for iterative algorithms based on Fejér processes with attractants
- Note on a method of conjugate subgradients for minimizing nondifferentiable functions
- On the convergence of conjugate gradient algorithms
Cited In (15)
- Numerical methods for constructing suboptimal packings of nonconvex domains with curved boundary
- Computational experience and challenges with the conjugate epi-projection algorithms for non-smooth optimization
- Machine learning algorithms of relaxation subgradient method with space extension
- Title not available (Why is that?)
- Convex optimization problems with constraints
- Limited memory space dilation and reduction algorithms
- On the properties of the method of minimization for convex functions with relaxation on the distance to extremum
- A method of conjugate subgradients for the minimization of functionals
- Proximal primal-dual best approximation algorithm with memory
- Non-Euclidean restricted memory level method for large-scale convex optimization
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization
- On the convergence rate of the subgradient method with metric variation and its applications in neural network approximation schemes
- Title not available (Why is that?)
- Title not available (Why is that?)
- A non-monotone conjugate subgradient type method for minimization of convex functions
This page was built for publication: Method of conjugate subgradients with constrained memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q463369)
