8 citations · 13 across the 38 of their papers we have counts for
8 papers · 1 filter
The Hybridization of Branch and Bound with Metaheuristics for Nonconvex Multiobjective Optimization
Wei-tian Wu, Xin-min Yang
A hybrid framework combining the branch and bound method with multiobjective evolutionary algorithms is proposed for nonconvex multiobjective optimization. The hybridization exploi…
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…
A Piecewise Convexification Method for Non-Convex Multi-Objective Optimization Programs with Box Constraints
Q. Zhu, L. P. Tang, X. M. Yang
This paper presents a piecewise convexification method for solving non-convex multi-objective optimization problems with box constraints. Based on the ideas of the -based Branch…
Convergence rates analysis of Interior Bregman Gradient Method for Vector Optimization Problems
Jian Chen, Liping Tang, Xinmin Yang
In recent years, by using Bregman distance, the Lipschitz gradient continuity and strong convexity were lifted and replaced by relative smoothness and relative strong convexity. Un…
Memory gradient method for multiobjective optimization
Wang Chen, Xinmin Yang, Yong Zhao
In this paper, we propose a new descent method, termed as multiobjective memory gradient method, for finding Pareto critical points of a multiobjective optimization problem. The ma…
A Barzilai-Borwein Descent Method for Multiobjective Optimization Problems
Jian Chen, Liping Tang, Xinmin Yang
The steepest descent method proposed by Fliege et al. motivates the research on descent methods for multiobjective optimization, which has received increasing attention in recent y…
General inertial smoothing proximal gradient algorithm for the relaxation of matrix rank minimization problem
Jie Zhang, Xinmin Yang
We consider the exact continuous relaxation model of matrix rank minimization problem proposed by Yu and Zhang (Comput.Optim.Appl. 1-20, 2022). Motivated by the inertial techinique…