Algorithms for projecting a point onto a level surface of a continuous function on a compact set

DOI10.1134/S0965542514090036zbMath1331.65043OpenAlexW1983594931MaRDI QIDQ889159

V. I. Zabotin, A. M. Dulliev, N. K. Arutyunova

Publication date: 6 November 2015

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

Full work available at URL: https://doi.org/10.1134/s0965542514090036

zbMATH Keywords

algorithmconvergencenumerical examplenonlinear equationnonconvex set\(\varepsilon\)-Lipschitz continuityprojection of a point onto a level surface

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical computation of solutions to single equations (65H05)

Related Items (7)

Numerical algorithm for solving mathematical programming problems with a smooth surface as a constraint ⋮ Global optimization of multivariable functions satisfying the Vanderbei condition ⋮ Numerical algorithm for solving a class of optimization problems with a constraint in the form of a subset of points of a smooth surface ⋮ 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 ⋮ Unnamed Item ⋮ Models and Methods for Three External Ballistics Inverse Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extension of Piyavskii's algorithm to continuous global optimization
• Set intersection problems: supporting hyperplanes and quadratic programming
• Два алгоритма отыскания проекции точки на невыпуклое множество в нормированном пространстве
• On Projection Algorithms for Solving Convex Feasibility Problems
• Monotonic Optimization: Branch and Cut Methods

This page was built for publication: Algorithms for projecting a point onto a level surface of a continuous function on a compact set