Два алгоритма отыскания проекции точки на невыпуклое множество в нормированном пространстве

DOI10.7868/S0044466913030162zbMath1274.65065OpenAlexW2316869444MaRDI QIDQ2840267

V. I. Zabotin, N. K. Arutyunova

Publication date: 17 July 2013

Published in: Журнал вычислительной математики и математической физики (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7868/s0044466913030162

zbMATH Keywords

convergencenormed spaceprojection algorithmnonconvex surfaceLipshitz condition

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (5)

Numerical algorithm for solving mathematical programming problems with a smooth surface as a constraint ⋮ Algorithms for projecting a point onto a level surface of a continuous function on a 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 ⋮ Models and Methods for Three External Ballistics Inverse Problems

This page was built for publication: Два алгоритма отыскания проекции точки на невыпуклое множество в нормированном пространстве