Gradient methods for solving equations and inequalities

From MaRDI portal
Publication:5525646

DOI10.1016/0041-5553(64)90079-5zbMath0147.35302OpenAlexW1987217557MaRDI QIDQ5525646

Boris T. Polyak

Publication date: 1967

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(64)90079-5



Related Items

Randomized algorithms for quadratic stability of quantized sampled-data systems, Derivative-Free Methods for Policy Optimization: Guarantees for Linear Quadratic Systems, Sparse solutions of optimal control via Newton method for under-determined systems, Newton's method and its use in optimization, Numerical solution for bounding feasible point sets, Distributed robust filtering with \(H_\infty\) consensus of estimates, Probabilistic design of LPV control systems., An iterative method, having linear rate of convergence, for solving a pair of dual linear programs, On relaxation methods for systems of linear inequalities, A method for solving to optimality uncapacitated location problems, Probabilistic robust design with linear quadratic regulators, A hybrid global optimization method: The multi-dimensional case, Ein iteratives Verfahren zur Bestimmung einer Lösung gewisser nichtlinearer Operatorgleichungen im Hilbertraum mit Anwendung auf Hammersteinsche Integralgleichungssysteme, A superlinearly convergent projection algorithm for solving the convex inequality problem, Eine Verallgemeinerung des Newtonschen Iterationsverfahrens. (A generalization of Newton's iteration method), A global quadratic algorithm for solving a system of mixed equalities and inequalities, Newton-Kantorovich method and its global convergence, New versions of Newton method: step-size choice, convergence domain and under-determined equations, An algorithm for linearly constrained convex nondifferentiable minimization problems