Asymptotic analysis in convex composite multiobjective optimization problems

Authors:
Zhe Chen
Affiliations:
Research Center for Contemporary Management, School of Economics and Management, Beijing, China 100084 and Business School, Sichuan University, Chengdu, China 610064
Venue:
Journal of Global Optimization
Year:
2013

Citing 9
Cited 0

Practical methods of optimization; (2nd ed.)

Practical methods of optimization; (2nd ed.)
Convex composite multi-objective nonsmooth programming

Mathematical Programming: Series A and B
Convex composite minimization with C1,1 functions

Journal of Optimization Theory and Applications
A Gauss-Newton method for convex composite optimization

Mathematical Programming: Series A and B
First and second-order optimality conditions for convex composite multiobjective optimization

Journal of Optimization Theory and Applications
Characterizations of the nonemptiness and compactness of solution sets in convex vector optimization

Journal of Optimization Theory and Applications
Second-order global optimality conditions for convex composite optimization

Mathematical Programming: Series A and B
Proximal Methods in Vector Optimization

SIAM Journal on Optimization
Generalized viscosity approximation methods in multiobjective optimization problems

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a unified approach for studying convex composite multiobjective optimization problems via asymptotic analysis. We characterize the nonemptiness and compactness of the weak Pareto optimal solution sets for a convex composite multiobjective optimization problem. Then, we employ the obtained results to propose a class of proximal-type methods for solving the convex composite multiobjective optimization problem, and carry out their convergence analysis under some mild conditions.