Method of conjugate subgradients with constrained memory

DOI10.1134/S0005117914040055zbMath1297.90180MaRDI QIDQ463369

E. A. Nurminskii, D. Tien

Publication date: 16 October 2014

Published in: Automation and Remote Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Methods of reduced gradient type (90C52)

Related Items (6)

ON THE CONVERGENCE RATE OF THE SUBGRADIENT METHOD WITH METRIC VARIATION AND ITS APPLICATIONS IN NEURAL NETWORK APPROXIMATION SCHEMES ⋮ Computational efficiency of the simplex embedding method in convex nondifferentiable optimization ⋮ Numerical methods for constructing suboptimal packings of nonconvex domains with curved boundary ⋮ Unnamed Item ⋮ On the properties of the method of minimization for convex functions with relaxation on the distance to extremum ⋮ Machine learning algorithms of relaxation subgradient method with space extension

Cites Work

• Unnamed Item
• Smooth minimization of non-smooth functions
• Combined relaxation methods for variational inequalities
• New variants of bundle methods
• Global convergence of the method of shortest residuals
• On the method of shortest residuals for unconstrained optimization
• A \(\mathcal{VU}\)-algorithm for convex minimization
• Convergence of conjugate gradient methods with constant stepsizes
• Envelope stepsize control for iterative algorithms based on Fejer processes with attractants
• Note on a method of conjugate subgradients for minimizing nondifferentiable functions
• On the convergence of conjugate gradient algorithms
• Methods of conjugate gradients for solving linear systems

This page was built for publication: Method of conjugate subgradients with constrained memory