activity
20172026
most citedRisk Minimization, Regret Minimization and Progressive Hedging Algorithms

8 citations · 13 across the 38 of their papers we have counts for

collaborators
Showing 2024Show all

11 papers · 1 filter

math.OC2024

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…

math.OC2024

Generalized conditional gradient methods for multiobjective composite optimization problems with H{ö}lder condition

Wang Chen, Liping Tang, Xinmin Yang

In this paper, we deal with multiobjective composite optimization problems, where each objective function is a combination of smooth and possibly non-smooth functions. We first pro…

math.OC2024

Mirror descent method for stochastic multi-objective optimization

Linxi Yang, Liping Tang, Jiahao Lv +2

Stochastic multi-objective optimization (SMOO) has recently emerged as a powerful framework for addressing machine learning problems with multiple objectives. The bias introduced b…

math.OC2024

First-order Methods for Unconstrained Vector Optimization Problems: A Unified Majorization-Minimization Perspective

Jian Chen, Jingjie Liu, Liping Tang +1

In this paper, we develop a unified majorization-minimization scheme and convergence analysis with first-order surrogate functions for unconstrained vector optimization problems (V…

math.OC2024★ 4 cited

Gradient-based algorithms for multi-objective bi-level optimization

Xinmin Yang, Wei Yao, Haian Yin +2

Multi-Objective Bi-Level Optimization (MOBLO) addresses nested multi-objective optimization problems common in a range of applications. However, its multi-objective and hierarchica…

math.OC2024

Level proximal subdifferential, variational convexity, and pointwise quadratic approximation

Honglin Luo, Xianfu Wang, Ziyuan Wang +1

Level proximal subdifferential was introduced by Rockafellar recently for studying proximal mappings of possibly nonconvex functions. In this paper a systematic study of level prox…

math.OC2024

Last-iterate convergence of modified predictive method via high-resolution differential equation on bilinear game

Keke Li, Xinmin Yang

This paper discusses the convergence of the modified predictive method (MPM) proposed by Liang and stokes corresponding to high-resolution differential equations (HRDE) in bilinear…

math.OC2024

A Branch and Bound Algorithm for Multiobjective Optimization Problems Using General Ordering Cones

Weitian Wu, Xinmin Yang

Many existing branch and bound algorithms for multiobjective optimization problems require a significant computational cost to approximate the entire Pareto optimal solution set. I…

math.OC2024

A Subspace Minimization Barzilai-Borwein Method for Multiobjective Optimization Problems

Jian Chen, Liping Tang. Xinmin Yang

Nonlinear conjugate gradient methods have recently garnered significant attention within the multiobjective optimization community. These methods aim to maintain consistency in con…

math.OC2024

On the convergence of conditional gradient method for unbounded multiobjective optimization problems

Wang Chen, Yong Zhao, Liping Tang +1

This paper focuses on developing a conditional gradient algorithm for multiobjective optimization problems with an unbounded feasible region. We employ the concept of recession con…

math.OC2024

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…