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

DOI10.1016/J.CAMWA.2008.11.017zbMATH Open1186.90100OpenAlexW2012384209MaRDI QIDQ971618FDOQ971618

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

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

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)

Cites Work

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

Cited In (7)

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

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)