Generalized proximal point algorithms for multiobjective optimization problems

DOI10.1080/00036811.2010.483428zbMath1242.90207OpenAlexW2024296368WikidataQ58305407 ScholiaQ58305407MaRDI QIDQ3006689

Zhe Chen, Xiao Qi Yang, Xue Xiang Huang

Publication date: 20 June 2011

Published in: Applicable Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00036811.2010.483428

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29) Numerical optimization and variational techniques (65K10) Numerical methods based on necessary conditions (49M05) Programming in abstract spaces (90C48)

Related Items

The proximal point method with a vectorial Bregman regularization in multiobjective DC programming ⋮ Generalized proximal-type methods for weak vector variational inequality problems in Banach spaces ⋮ Inexact multi-objective local search proximal algorithms: application to group dynamic and distributive justice problems ⋮ Proximal algorithm with quasidistances for multiobjective quasiconvex minimization in Riemannian manifolds ⋮ Asymptotic analysis in convex composite multiobjective optimization problems ⋮ A barrier-type method for multiobjective optimization ⋮ A proximal point algorithm with quasi-distance in multi-objective optimization ⋮ Asymptotic analysis for proximal-type methods in vector variational inequality problems ⋮ Extended Newton Methods for Multiobjective Optimization: Majorizing Function Technique and Convergence Analysis ⋮ Combined gradient methods for multiobjective optimization

Cites Work

• Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces
• Convergence analysis of Tikhonov-type regularization algorithms for multiobjective optimization problems
• Theory of multiobjective optimization
• A relaxed version of Bregman's method for convex programming
• An iterative row-action method for interval convex programming
• Proximal minimization algorithm with \(D\)-functions
• Characterizations of the nonemptiness and compactness of solution sets in convex vector optimization
• Ideal, weakly efficient solutions for vector optimization problems
• Steepest descent methods for multicriteria optimization.
• Iterative methods of solving stochastic convex feasibility problems and applications
• A projected gradient method for vector optimization problems
• Forcing strong convergence of proximal point iterations in a Hilbert space
• Approximate proximal methods in vector optimization
• A Proximal Point Method for the Variational Inequality Problem in Banach Spaces
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• A Proximal-Type Method for Convex Vector Optimization Problem in Banach Spaces
• On the Convergence of the Proximal Point Algorithm for Convex Minimization
• Monotone Operators and the Proximal Point Algorithm
• Variational Analysis
• Convergence of Proximal-Like Algorithms
• Proximal Minimization Methods with Generalized Bregman Functions
• On a proximal point method for convex optimization in banach spaces
• A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
• Strong Convergence of a Proximal-Type Algorithm in a Banach Space
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• Proximal Methods in Vector Optimization
• An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
• The non-symmetric flow round the front part of a body of revolution due to a supersonic stream of an ideal or real gas
• Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity

This page was built for publication: Generalized proximal point algorithms for multiobjective optimization problems