Projection of a Point onto a Convex Set via Charged Balls Method

Majid E. Abbasov ()
Additional contact information
Majid E. Abbasov: St. Petersburg State University

A chapter in High-Dimensional Optimization and Probability, 2022, pp 1-8 from Springer

Abstract: Abstract Finding the projection of a point onto a convex set is a problem of computational geometry that plays an essential role in mathematical programming and nondifferentiable optimization. Recently proposed Charged Balls Method allows one to solve this problem for the case when the boundary of the set is given by smooth function. In this chapter, we give an overview of Charged Balls Method and show that the method is applicable also for nonsmooth case. More specifically, we consider the set that is defined by a maximum of a finite number of smooth functions. Obtained results show that even in case of the set with nonsmooth boundary, Charged Balls Method still solves the problem quite competitive effectively in comparison with other algorithms. This is confirmed by the results of numerical experiments.

Date: 2022
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-031-00832-0_1

Ordering information: This item can be ordered from
http://www.springer.com/9783031008320

DOI: 10.1007/978-3-031-00832-0_1

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().