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

DOI10.1016/J.CAMWA.2008.11.017MaRDI QIDQ971618zbMATH OpenOpenAlexFDO

Authors Zhe Chen, Haiqiao Huang, Kequan 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

Lyapunov functionalBanach spacesproximal point algorithmvector optimizationerror termweak Pareto optimal solutionweakly converge

Mathematics Subject Classification ID

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

Recommendations

• A Proximal-Type Method for Convex Vector Optimization Problem in Banach Spaces
• Approximate proximal methods in vector optimization
• Proximal Methods in Vector Optimization
• Generalized proximal-type methods for weak vector variational inequality problems in Banach spaces
• Generalized proximal method for efficient solutions in vector optimization

Cites work

• scientific article; zbMATH DE number 3608670 (Why is no real title available?)
• scientific article; zbMATH DE number 2063780 (Why is no real title available?)
• scientific article; zbMATH DE number 3341597 (Why is no real title available?)
• A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
• A Mesh-Independence Principle for Operator Equations and Their Discretizations
• A projected gradient method for vector optimization problems
• A proximal point method for the variational inequality problem in Banach spaces
• A relaxed version of Bregman's method for convex programming
• An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
• Approximate iterations in Bregman-function-based proximal algorithms
• Approximate proximal methods in vector optimization
• Calmness and exact penalization in vector optimization with cone constraints
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Forcing strong convergence of proximal point iterations in a Hilbert space
• Inequalities in Banach spaces with applications
• Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
• Mesh Independence for Nonlinear Least Squares Problems with Norm Constraints
• Monotone Operators and the Proximal Point Algorithm
• Nonlinear Ill-posed Problems of Monotone Type
• Nonlinear economic dynamics
• On the Convergence of the Proximal Point Algorithm for Convex Minimization
• On the moduli of convexity and smoothness
• Proximal Methods in Vector Optimization
• Proximal Minimization Methods with Generalized Bregman Functions
• Proximal minimization algorithm with \(D\)-functions
• Steepest descent methods for multicriteria optimization.
• Strong Convergence of a Proximal-Type Algorithm in a Banach Space
• Theory of multiobjective optimization
• Vector optimization. Set-valued and variational analysis.

Cited in

(7)

• Generalized proximal method for efficient solutions in vector optimization
• Generalized proximal point algorithms for multiobjective optimization problems
• Generalized proximal-type methods for weak vector variational inequality problems in Banach spaces
• A Proximal-Type Method for Convex Vector Optimization Problem in Banach Spaces
• Hybrid approximate proximal algorithms for efficient solutions in vector optimization
• Approximate proximal methods in vector optimization
• Conditional gradient method for vector optimization

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

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