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

DOI10.1007/S11425-023-2302-9MaRDI QIDQ6564773zbMATH OpenFDO

Authors Xinmin Yang, Wei Yao, Hai-An Yin, Shangzhi Zeng, Jin Zhang

Publication date 1 July 2024

Published in Science China. Mathematics (Search for Journal in Brave)

zbMATH Keywords

convergence analysisbi-level optimizationmulti-objectivelearning to optimizePareto stationary

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Recommendations

• Approximate bilevel optimization with population-based evolutionary algorithms
• Adaptive sampling stochastic multigradient algorithm for stochastic multiobjective optimization
• An efficient chemical reaction algorithm for multi-objective combinatorial bi-level optimization
• Numerical methods for the solution of bi-level multi-objective optimization problems.

Cites work

• A Barzilai-Borwein descent method for multiobjective optimization problems
• A subgradient method for multiobjective optimization
• Bilevel optimization with a multiobjective problem in the lower level
• Direct Multisearch for Multiobjective Optimization
• First-order methods in optimization
• Multicriteria Optimization
• Multiple-gradient descent algorithm (MGDA) for multiobjective optimization
• New optimality conditions for the semivectorial bilevel optimization problem
• Nonlinear multiobjective optimization
• Proximal Methods in Vector Optimization
• Proximal gradient methods for multiobjective optimization and their applications
• Semivectorial bilevel optimization problem: penalty approach
• Semivectorial bilevel programming versus scalar bilevel programming
• Steepest descent methods for multicriteria optimization.

Cited in

(1)

• Preface

This page was built for publication: Gradient-based algorithms for multi-objective bi-level optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564773)