The Black–Litterman model is a very important analytical tool for active portfolio management because it allows investment analysts to incorporate investor’s views into market equilibrium returns. In this paper, we define and study the time-varying Black–Litterman portfolio optimization under nonlinear constraints (TV-BLPONC) problem as a nonlinear programming (NLP) problem. More precisely, the nonlinear constraints refer to transaction costs and cardinality constraints. Furthermore, a speedy weights-and-structure-determination (WASD) algorithm for the power-activation feed-forward neuronet (PFN) is presented to solve time-series modeling and forecasting problems. Inhere, the investor’s views in the TV-BLPONC problem are considered as a forecasting problem and, thus, they are produced by the WASD-based PFN. In addition, using the beetle antennae search (BAS) algorithm a computational method is introduced to solve the TV-BLPONC problem. For all we know, this is an innovative approach that integrates modern neural network and meta-heuristic optimization methods to provide a solution to the TV-BLPONC problem in large portfolios. Our approach is tested on portfolios of up to 90 stocks with real-world data, and the results show that it is more than 30 times faster than other methods. Our technique’s speed and precision are verified in this way, showing that it is an outstanding alternative to ordinary methods. In order to support and promote the findings of this work, we have constructed two complete MATLAB packages for the interested user, which are freely available through GitHub.