Journal of Nonlinear and Variational Analysis, vol.10, no.4, pp.845-866, 2026 (SCI-Expanded, Scopus)
This paper proposes a new method for computing a set of optimal points, namely, minimal, properly minimal, and weakly minimal points, and approximate optimal points for nonconvex multi-objective problems, based on a given set of weights and reference points. This is an iterative method that utilizes the scalarizing functions of both the Conic Scalarization and the Pascoletti-Serafini methods at each iteration. The convergence of the proposed method is proven, and it is demonstrated that the method terminates in a finite number of iterations for a specified error accuracy. The performance of the method is illustrated through numerical examples.