1 citations · 1 across the 18 of their papers we have counts for
4 papers · 1 filter
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…
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…