Results 111 to 120 of about 39,060 (206)

Proximal Algorithms for Structured Nonconvex Optimization

open access: yes, 2018
Due to their simplicity and versatility, splitting algorithms are often the methods of choice for many optimization problems arising in engineering. “Splitting” complex problems into simpler subtasks, their complexity scales well with problem size, making them particularly suitable for large-scale applications where other popular methods such as IP
openaire   +2 more sources

A fast algorithm for sparse signal recovery via fraction function

open access: yesElectronics Letters
In this article, a fast algorithm is studied to recover the sparse signals. It can be regarded as an extension of the parameterized fast iterative shrinkage‐thresholding algorithm from convex optimization to nonconvex optimization. Numerical results show
Angang Cui, Haizhen He, Hong Yang
doaj   +1 more source

Neurodynamic Optimization: towards Nonconvexity

open access: yes, 2008
The work was supported by the National Natural Science Foundation of China under Grant 60621062 and by the National Key Foundation R&D Project under Grants 2003CB317007, 2004CB318108 and 2007CB311003. It has been partially presented in (Hu, 2007; Hu & Wang, 2006b; Hu & Wang, 2006a; Hu & Wang, 2007a).
openaire   +3 more sources

Home - About - Disclaimer - Privacy