- Journal Home
- Volume 21 - 2024
- Volume 20 - 2023
- Volume 19 - 2022
- Volume 18 - 2021
- Volume 17 - 2020
- Volume 16 - 2019
- Volume 15 - 2018
- Volume 14 - 2017
- Volume 13 - 2016
- Volume 12 - 2015
- Volume 11 - 2014
- Volume 10 - 2013
- Volume 9 - 2012
- Volume 8 - 2011
- Volume 7 - 2010
- Volume 6 - 2009
- Volume 5 - 2008
- Volume 4 - 2007
- Volume 3 - 2006
- Volume 2 - 2005
- Volume 1 - 2004
Cited by
- BibTex
- RIS
- TXT
In this paper we consider the discrete constrained least squares problem coming from numerical approximation by hybrid scheme on the sphere, which applies both radial basis functions and spherical polynomials. We propose a novel $l_2-l_1$ regularized least square model for this problem and show that it is a generalized model of the classical "saddle point" model. We apply the alternating direction algorithm to solve the $l_2-l_1$ model and propose a convenient stopping criterion for the algorithm. Numerical results show that our model is more efficient and accurate than other models.
}, issn = {2617-8710}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/ijnam/492.html} }In this paper we consider the discrete constrained least squares problem coming from numerical approximation by hybrid scheme on the sphere, which applies both radial basis functions and spherical polynomials. We propose a novel $l_2-l_1$ regularized least square model for this problem and show that it is a generalized model of the classical "saddle point" model. We apply the alternating direction algorithm to solve the $l_2-l_1$ model and propose a convenient stopping criterion for the algorithm. Numerical results show that our model is more efficient and accurate than other models.