Generalized proximal point algorithms for multiobjective optimization problems
From MaRDI portal
Recommendations
- Generalized proximal point algorithm for convex optimization
- Proximal gradient methods for multiobjective optimization and their applications
- Proximal point method for a special class of nonconvex multiobjective optimization functions
- Proximal point algorithm for differentiable quasi-convex multiobjective optimization
- Inexact proximal point algorithm for multiobjective optimization
- Proximal point algorithms for general variational inequalities
- scientific article; zbMATH DE number 24381
- scientific article; zbMATH DE number 1926003
- A Generalization of the Proximal Point Algorithm
- Multiobjective programming problems under generalized convexity
Cites work
- A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
- A Proximal-Type Method for Convex Vector Optimization Problem in Banach Spaces
- 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 Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
- An iterative row-action method for interval convex programming
- Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces
- Approximate proximal methods in vector optimization
- Characterizations of the nonemptiness and compactness of solution sets in convex vector optimization
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Convergence analysis of Tikhonov-type regularization algorithms for multiobjective optimization problems
- Convergence of Proximal-Like Algorithms
- Forcing strong convergence of proximal point iterations in a Hilbert space
- Ideal, weakly efficient solutions for vector optimization problems
- Iterative methods of solving stochastic convex feasibility problems and applications
- Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
- Monotone Operators and the Proximal Point Algorithm
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- On a proximal point method for convex optimization in banach spaces
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- 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
- The non-symmetric flow round the front part of a body of revolution due to a supersonic stream of an ideal or real gas
- Theory of multiobjective optimization
- Variational Analysis
Cited in
(21)- Convergence analysis of Tikhonov-type regularization algorithms for multiobjective optimization problems
- Generalized viscosity approximation methods in multiobjective optimization problems
- Proximal algorithm with quasidistances for multiobjective quasiconvex minimization in Riemannian manifolds
- Generalized proximal-type methods for weak vector variational inequality problems in Banach spaces
- Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions
- Some remarks on proximal point algorithm in scalar and vectorial cases
- Inexact multi-objective local search proximal algorithms: application to group dynamic and distributive justice problems
- An accelerated proximal gradient method for multiobjective optimization
- A proximal point-type method for multicriteria optimization
- Extended Newton methods for multiobjective optimization: majorizing function technique and convergence analysis
- Inexact proximal point method with a Bregman regularization for quasiconvex multiobjective optimization problems via limiting subdifferentials
- A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems
- Hybrid proximal point algorithm for solution of convex multiobjective optimization problem over fixed point constraint
- Asymptotic analysis for proximal-type methods in vector variational inequality problems
- Combined gradient methods for multiobjective optimization
- The proximal point method with a vectorial Bregman regularization in multiobjective DC programming
- Asymptotic analysis in convex composite multiobjective optimization problems
- A barrier-type method for multiobjective optimization
- Proximal point method for a special class of nonconvex multiobjective optimization functions
- Proximal point method with Bregman regularization for multiobjective optimization problems on Hadamard manifolds
- A proximal point algorithm with quasi-distance in multi-objective optimization
This page was built for publication: Generalized proximal point algorithms for multiobjective optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3006689)
