Generalized proximal-type methods for weak vector variational inequality problems in Banach spaces
DOI10.1186/s13663-015-0440-0zbMath1338.90375OpenAlexW1888542740WikidataQ59436522 ScholiaQ59436522MaRDI QIDQ288117
Zhe Chen, Lin-chang Pu, Xue-ying Wang
Publication date: 24 May 2016
Published in: Fixed Point Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13663-015-0440-0
convergence analysisBanach spacesBregman functionsproximal-type methodvector variational inequality problemsweak normal mapping
Multi-objective and goal programming (90C29) Numerical optimization and variational techniques (65K10) Numerical methods based on necessary conditions (49M05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strong convergence of a proximal-type algorithm for an occasionally pseudomonotone operator in Banach spaces
- Characterizing the nonemptiness and compactness of the solution set of a vector variational inequality by scalarization
- Nonemptiness and boundedness of solution sets for vector variational inequalities via topological method
- The vector complementary problem and its equivalences with the weak minimal element in ordered spaces
- Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces
- An iterative row-action method for interval convex programming
- Image d'une somme d'opérateurs monotones et applications
- Proximal minimization algorithm with \(D\)-functions
- Existence of solutions for a vector variational inequality: An extension of the Hartmann-Stampacchia theorem
- Asymptotic analysis for proximal-type methods in vector variational inequality problems
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
- Asymptotic analysis in convex composite multiobjective optimization problems
- 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
- Generalized proximal point algorithms for multiobjective optimization problems
- On the nonemptiness and compactness of the solution sets for vector variational inequalities
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Variational Analysis in Sobolev andBVSpaces
- A Proximal-Type Method for Convex Vector Optimization Problem in Banach Spaces
- A Mesh-Independence Principle for Operator Equations and Their Discretizations
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Monotone Operators and the Proximal Point Algorithm
- Newton's Mesh Independence Principle for a Class Of Optimal Shape Design Problems
- 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
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Proximal Methods in Vector Optimization
- Convex Analysis
- On the Maximality of Sums of Nonlinear Monotone Operators
- Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
This page was built for publication: Generalized proximal-type methods for weak vector variational inequality problems in Banach spaces