Minimization over the $$\ell _1$$-ball using an active-set non-monotone projected gradient

Abstract

The $$\ell _1$$ ℓ 1 -ball is a nicely structured feasible set that is widely used in many fields (e.g., machine learning, statistics and signal analysis) to enforce some sparsity in the model solutions. In this paper, we devise an active-set strategy for efficiently dealing with minimization problems over the $$\ell _1$$ ℓ 1 -ball and embed it into a tailored algorithmic scheme that makes use of a non-monotone first-order approach to explore the given subspace at each iteration. We prove global convergence to stationary points. Finally, we report numerical experiments, on two different classes of instances, showing the effectiveness of the algorithm.

Challenges and Barriers of Wireless Charging Technologies for Electric Vehicles

“…The authors of [67] looked at a dynamic setting to comprehend the connection between the receiver and transmitter coil orientation deviations. Calculations were made to determine the output voltage and total efficiency factor so as to build an integrated computational framework similarly to other fields [293,294].…”