Algorithms for projecting a point onto a level surface of a continuous function on a compact set
DOI10.1134/S0965542514090036zbMATH Open1331.65043OpenAlexW1983594931MaRDI QIDQ889159FDOQ889159
Authors: N. K. Arutyunova, A. M. Dulliev, V. I. Zabotin 
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
Recommendations
- scientific article; zbMATH DE number 2210690
- Two algorithms for finding the projection of a point onto a nonconvex set in a normed space
- An algorithm for finding all solutions of a nonlinear system
- Determination of the roots and of the global extremum of a lipschitz function
- A two-dimensional bisection envelope algorithm for fixed points
convergencealgorithmnumerical examplenonlinear equationnonconvex set\(\varepsilon\)-Lipschitz continuityprojection of a point onto a level surface
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical computation of solutions to single equations (65H05)
Cites Work
- On Projection Algorithms for Solving Convex Feasibility Problems
- Title not available (Why is that?)
- Extension of Piyavskii's algorithm to continuous global optimization
- Convergence of suitable affine subspace method for finding the least distance to a simplex
- Title not available (Why is that?)
- Set intersection problems: supporting hyperplanes and quadratic programming
- Two algorithms for finding the projection of a point onto a nonconvex set in a normed space
- Monotonic Optimization: Branch and Cut Methods
Cited In (8)
- 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
- Models and Methods for Three External Ballistics Inverse Problems
- Title not available (Why is that?)
- Iterative algorithm for minimizing a convex function at the intersection of a spherical 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
- Title not available (Why is that?)
This page was built for publication: Algorithms for projecting a point onto a level surface of a continuous function on a compact set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q889159)
