Algorithms for projecting a point onto a level surface of a continuous function on a compact set
The paper deals with the problem of finding a solution nearest to a given point for the equation \(f(x) = 0\), where \(f\) is an \(\varepsilon\)-Lipschitz continuous function. To solve the problem the authors propose two algorithms. The first algorithm is based on an idea similar to the second algorithm from \textit{V. I. Zabotin} and \textit{N. K. Arutyunova} [Zh. Vychisl. Mat. Mat. Fiz. 53, No. 3, 344--349 (2013; Zbl 1274.65065)]. It is an iterative algorithm in which the convergence to the set of zeros for the function is obtained by updating the value of \(\varepsilon\) depending on the current value of the function. The second algorithm is a generalization of the method from \textit{A. M. Dulliev} and \textit{V. I. Zabotin} [Zh. Vychisl. Mat. Mat. Fiz. 44, No. 5, 827--830 (2004); translation in Comput. Math. Math. Phys. 44, No. 5, 781--784 (2004; Zbl 1121.41034)]. After the introduction of the two algorithms the authors prove their convergence and show some numerical examples.
- 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
- Convergence of suitable affine subspace method for finding the least distance to a simplex
- Extension of Piyavskii's algorithm to continuous global optimization
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 2210690 (Why is no real title available?)
- Monotonic Optimization: Branch and Cut Methods
- On Projection Algorithms for Solving Convex Feasibility Problems
- 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
- Iterative algorithm for minimizing a convex function at the intersection of a spherical surface and a convex compact set
- Global optimization of multivariable functions satisfying the Vanderbei condition
- Numerical algorithm for solving mathematical programming problems with a smooth surface as a constraint
- 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
- scientific article; zbMATH DE number 2210690 (Why is no real title available?)
- Global optimization method of multivariate non-Lipschitz functions using tangent minorants
- Efficient global optimization of multivariate functions with unknown Hölder constants via -dense curves
- An extension of the gradient projection method and Newton's method to extremum problems constrained by a smooth surface
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)
