scientific article; zbMATH DE number 3493797

zbMath0315.65035MaRDI QIDQ4076680

Yu. M. Danilin, B. N. Pshenichnyĭ

Publication date: 1975

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02)

Related Items

Application of the conditional gradient method to resource allocation in wireless networks, An adaptive partial linearization method for optimization problems on product sets, Conditional gradient method for optimization problems with a constraint in the form of the intersection of a convex smooth surface and a convex compact set, An extension of the gradient projection method and Newton's method to extremum problems constrained by a smooth surface, Iterative algorithm for minimizing a convex function at the intersection of a spherical surface and a convex compact set, Thermodynamic consistency and mathematical well-posedness in the theory of elastoplastic, granular, and porous materials, Dual subgradient algorithms for large-scale nonsmooth learning problems, Algorithms for evaluating basic components of spectral functions of interference wave fields, Convergence of the gradient projection method and Newton's method as applied to optimization problems constrained by intersection of a spherical surface and a convex closed set, Numerical algorithm for minimizing a convex function on the intersection of a smooth surface and a convex compact set, Newton's method for minimizing a convex twice differentiable function on a preconvex set, Application of the methods of nonlinear programming to the solution of variational gas dynamics problems, Optimization of elastic shells of revolution, On multidimensional ill-posed problems with discontinuous solutions, Gradient projection method for optimization problems with a constraint in the form of the intersection of a smooth surface and a convex closed set, Orthogonalizing linear operators in convex programming. I, II, The quasi-Newton method of solution of convex variational inequalities with descent decomposition, Academician V. S. Mikhalevich as a scientist and science organizer (on the occasion of his 70th birthday), Greedy approximation in convex optimization, Solving variational inequalities with monotone operators on domains given by linear minimization oracles