5 papers · 1 filter
Scaled Proximal Gradient Methods for Multiobjective Optimization: Improved Linear Convergence and Nesterov's Acceleration
Jian Chen, Liping Tang, Xinmin Yang
Over the past two decades, descent methods have received substantial attention within the multiobjective optimization field. Nonetheless, both theoretical analyses and empirical ev…
Obtaining properly Pareto optimal solutions of multiobjective optimization problems via the branch and bound method
Weitian Wu, Xinmin Yang
In multiobjective optimization, most branch and bound algorithms provide the decision maker with the whole Pareto front, and then decision maker could select a single solution fina…
Reference-Point-Based Branch and Bound Algorithm for Multiobjective Optimization
Weitian Wu, Xinmin Yang
In this paper, a branch and bound algorithm that incorporates the decision maker's preference information is proposed for multiobjective optimization. In the proposed algorithm, a…
Variable Metric Method for Unconstrained Multiobjective Optimization Problems
Jian Chen, Gaoxi Li, Xinmin Yang
In this paper, we propose a variable metric method for unconstrained multiobjective optimization problems (MOPs). First, a sequence of points is generated using different positive…
A Modification Piecewise Convexification Method for Box-Constrained Non-Convex Optimization Programs
Qiao Zhu, Liping Tang, Xinmin Yang
This paper presents a piecewise convexification method to approximate the whole approximate optimal solution set of non-convex optimization problems with box constraints. In the pr…