Derivative-Free Feasible Backtracking Search Methods for Nonlinear Multiobjective Optimization with Simple Boundary Constraint

In this paper, a derivative-free linear feasible direction models with backtracking search technique is considered for solving nonlinear multiobjective optimization problems subject to simple boundary constraint. The algorithm is designed to build linear interpolation models for each function of problem [Formula: see text]. We build the linear programming subproblem using linear interpolation function without the second-order derivative information. The new backtracking search step size function is given in our algorithm which guarantees both the monotone descent property of each function and the feasibility of the iterative point. Under reasonable assumptions, we prove that the algorithm converges to a weakly Pareto critical point of problem. The results of numerical experiments are reported to show the effectiveness of the proposed algorithm.