Generalized Proximal Method for Efficient Solutions in Vector Optimization
From MaRDI portal
Publication:3173507
DOI10.1080/01630563.2011.587072zbMath1232.49036MaRDI QIDQ3173507
Publication date: 10 October 2011
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2011.587072
vector optimization; efficient solution; uniformly convex; uniformly smooth; generalized proximal method
65K05: Numerical mathematical programming methods
90C25: Convex programming
49J27: Existence theories for problems in abstract spaces
Related Items
Nonlinear Conjugate Gradient Methods for Vector Optimization, A proximal point algorithm with quasi-distance in multi-objective optimization, A study of Liu-Storey conjugate gradient methods for vector optimization, A quasi-Newton method with Wolfe line searches for multiobjective optimization, On the extension of the Hager-Zhang conjugate gradient method for vector optimization
Cites Work
- Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
- Convex functions, monotone operators and differentiability.
- Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces
- Steepest descent methods for multicriteria optimization.
- Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems
- A steepest descent method for vector optimization
- A projected gradient method for vector optimization problems
- Approximate proximal methods in vector optimization
- Nonlinear Ill-posed Problems of Monotone Type
- A Proximal-Type Method for Convex Vector Optimization Problem in Banach Spaces
- Strong Convergence of a Proximal-Type Algorithm in a Banach Space
- Proximal Methods in Vector Optimization
