Search results

1 – 2 of 2
Open Access
Article
Publication date: 3 August 2020

Abdellatif Moudafi

The focus of this paper is in Q-Lasso introduced in Alghamdi et al. (2013) which extended the Lasso by Tibshirani (1996). The closed convex subset Q belonging in a Euclidean m

Abstract

The focus of this paper is in Q-Lasso introduced in Alghamdi et al. (2013) which extended the Lasso by Tibshirani (1996). The closed convex subset Q belonging in a Euclidean m-space, for mIN, is the set of errors when linear measurements are taken to recover a signal/image via the Lasso. Based on a recent work by Wang (2013), we are interested in two new penalty methods for Q-Lasso relying on two types of difference of convex functions (DC for short) programming where the DC objective functions are the difference of l1 and lσq norms and the difference of l1 and lr norms with r>1. By means of a generalized q-term shrinkage operator upon the special structure of lσq norm, we design a proximal gradient algorithm for handling the DC l1lσq model. Then, based on the majorization scheme, we develop a majorized penalty algorithm for the DC l1lr model. The convergence results of our new algorithms are presented as well. We would like to emphasize that extensive simulation results in the case Q={b} show that these two new algorithms offer improved signal recovery performance and require reduced computational effort relative to state-of-the-art l1 and lp (p(0,1)) models, see Wang (2013). We also devise two DC Algorithms on the spirit of a paper where exact DC representation of the cardinality constraint is investigated and which also used the largest-q norm of lσq and presented numerical results that show the efficiency of our DC Algorithm in comparison with other methods using other penalty terms in the context of quadratic programing, see Jun-ya et al. (2017).

Details

Applied Computing and Informatics, vol. 17 no. 1
Type: Research Article
ISSN: 2634-1964

Keywords

Open Access
Article
Publication date: 2 November 2021

Rabha W. Ibrahim

In this study, the authors introduce a solvability of special type of Langevin differential equations (LDEs) in virtue of geometric function theory. The analytic solutions of the…

Abstract

Purpose

In this study, the authors introduce a solvability of special type of Langevin differential equations (LDEs) in virtue of geometric function theory. The analytic solutions of the LDEs are considered by utilizing the Caratheodory functions joining the subordination concept. A class of Caratheodory functions involving special functions gives the upper bound solution.

Design/methodology/approach

The methodology is based on the geometric function theory.

Findings

The authors present a new analytic function for a class of complex LDEs.

Originality/value

The authors introduced a new class of complex differential equation, presented a new technique to indicate the analytic solution and used some special functions.

Details

Arab Journal of Mathematical Sciences, vol. 29 no. 1
Type: Research Article
ISSN: 1319-5166

Keywords

Access

Only Open Access

Year

Content type

1 – 2 of 2