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

DOI10.1007/S11425-023-2302-9MaRDI QIDQ6564773

Could not fetch data.

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

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

Cites Work

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

Related Items (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)