Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces

DOI10.1016/j.camwa.2008.11.017zbMath1186.90100OpenAlexW2012384209MaRDI QIDQ971618

Haiqiao Huang, Zhe Chen, Ke Quan Zhao

Publication date: 16 May 2010

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2008.11.017

zbMATH Keywords

vector optimizationBanach spacesLyapunov functionalerror termweak Pareto optimal solutionproximal point algorithmweakly converge

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Numerical optimization and variational techniques (65K10) Programming in abstract spaces (90C48)

Related Items (4)

Generalized proximal-type methods for weak vector variational inequality problems in Banach spaces ⋮ Generalized Proximal Method for Efficient Solutions in Vector Optimization ⋮ Conditional gradient method for vector optimization ⋮ Generalized proximal point algorithms for multiobjective optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Calmness and exact penalization in vector optimization with cone constraints
• Theory of multiobjective optimization
• A relaxed version of Bregman's method for convex programming
• Approximate iterations in Bregman-function-based proximal algorithms
• Proximal minimization algorithm with \(D\)-functions
• Steepest descent methods for multicriteria optimization.
• Nonlinear economic dynamics
• A projected gradient method for vector optimization problems
• An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
• Forcing strong convergence of proximal point iterations in a Hilbert space
• Approximate proximal methods in vector optimization
• Vector optimization. Set-valued and variational analysis.
• A Proximal Point Method for the Variational Inequality Problem in Banach Spaces
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Nonlinear Ill-posed Problems of Monotone Type
• A Mesh-Independence Principle for Operator Equations and Their Discretizations
• On the Convergence of the Proximal Point Algorithm for Convex Minimization
• Inequalities in Banach spaces with applications
• On the moduli of convexity and smoothness
• Monotone Operators and the Proximal Point Algorithm
• Proximal Minimization Methods with Generalized Bregman Functions
• 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
• Mesh Independence for Nonlinear Least Squares Problems with Norm Constraints
• Proximal Methods in Vector Optimization
• Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity

This page was built for publication: Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces