Proximal Methods in Vector Optimization
From MaRDI portal
Recommendations
- Approximate proximal methods in vector optimization
- Generalized proximal method for efficient solutions in vector optimization
- An interior proximal method in vector optimization
- Proximal point methods and nonconvex optimization
- A strongly convergent proximal point method for vector optimization
- scientific article; zbMATH DE number 7426954
- scientific article; zbMATH DE number 2221962
- A proximal gradient splitting method for solving convex vector optimization problems
- Hybrid approximate proximal algorithms for efficient solutions in vector optimization
- Proximal-proximal-gradient method
Cited in
(only showing first 100 items - show all)- Convergence analysis of Tikhonov-type regularization algorithms for multiobjective optimization problems
- Multiple reduced gradient method for multiobjective optimization problems
- Proximal point methods for Lipschitz functions on Hadamard manifolds: scalar and vectorial cases
- Reduced Jacobian method
- Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints
- An abstract proximal point algorithm
- Inexact multi-objective local search proximal algorithms: application to group dynamic and distributive justice problems
- Nonmonotone gradient methods for vector optimization with a portfolio optimization application
- Proximal point method for locally Lipschitz functions in multiobjective optimization of Hadamard manifolds
- Proximal point method for a special class of nonconvex multiobjective optimization functions
- A relaxed projection method for solving multiobjective optimization problems
- Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds
- Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels
- Proximal algorithms in statistics and machine learning
- Asymptotic analysis in convex composite multiobjective optimization problems
- An efficient descent method for locally Lipschitz multiobjective optimization problems
- A strongly convergent proximal point method for vector optimization
- A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data
- Globally convergent Newton-type methods for multiobjective optimization
- Combined gradient methods for multiobjective optimization
- Extragradient method with Bregman distances for solving vector quasi-equilibrium problems
- On inexact projected gradient methods for solving variable vector optimization problems
- A study of Liu-Storey conjugate gradient methods for vector optimization
- An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems
- A quasi-Newton method with Wolfe line searches for multiobjective optimization
- Duality results for interval-valued pseudoconvex optimization problem with equilibrium constraints with applications
- On the extension of the Hager-Zhang conjugate gradient method for vector optimization
- Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds
- The self regulation problem as an inexact steepest descent method for multicriteria optimization
- A linear scalarization proximal point method for quasiconvex multiobjective minimization
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
- Approximate proximal methods in vector optimization
- Newton-like methods for efficient solutions in vector optimization
- Proximal point method for vector optimization on Hadamard manifolds
- The multiobjective steepest descent direction is not Lipschitz continuous, but is Hölder continuous
- Proximal gradient methods for multiobjective optimization and their applications
- Box-constrained multi-objective optimization: A gradient-like method without ``a priori scalarization
- Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm
- An inexact scalarization proximal point method for multiobjective quasiconvex minimization
- Convergence rates analysis of a multiobjective proximal gradient method
- Relaxed-inertial proximal point type algorithms for quasiconvex minimization
- Newton-like methods for solving vector optimization problems
- 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
- Generalized proximal point algorithms for multiobjective optimization problems
- An external penalty-type method for multicriteria
- Some remarks on proximal point algorithm in scalar and vectorial cases
- Steepest descent methods for critical points in vector optimization problems
- Generalized proximal method for efficient solutions in vector optimization
- Inertial forward–backward methods for solving vector optimization problems
- A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application
- An extragradient method for vector equilibrium problems on Hadamard manifolds
- Hybrid proximal point algorithm for solution of convex multiobjective optimization problem over fixed point constraint
- A modified Quasi-Newton method for vector optimization problem
- A Proximal-Type Method for Convex Vector Optimization Problem in Banach Spaces
- An inexact steepest descent method for multicriteria optimization on Riemannian manifolds
- A subgradient method for multiobjective optimization on Riemannian manifolds
- Variants for the logarithmic-quadratic proximal point scalarization method for multiobjective programming
- A continuous gradient-like dynamical approach to Pareto-optimization in Hilbert spaces
- A dynamic gradient approach to Pareto optimization with nonsmooth convex objective functions
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
- The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem
- Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization
- A steepest descent-like method for variable order vector optimization problems
- Nonlinear Conjugate Gradient Methods for Vector Optimization
- Generalized contractions and hybrid approximate proximal method for vector optimization problems
- A proximal gradient splitting method for solving convex vector optimization problems
- The proximal point method with a vectorial Bregman regularization in multiobjective DC programming
- A proximal point algorithm with quasi-distance in multi-objective optimization
- A steepest descent-like method for vector optimization problems with variable domination structure
- A barrier-type method for multiobjective optimization
- scientific article; zbMATH DE number 7426954 (Why is no real title available?)
- A quadratically convergent Newton method for vector optimization
- Complexity of gradient descent for multiobjective optimization
- Parallel proximal point methods for systems of vector optimization problems on Hadamard manifolds without convexity
- An algorithm for vector optimization problems
- Extended Newton methods for multiobjective optimization: majorizing function technique and convergence analysis
- Generalized viscosity approximation methods in multiobjective optimization problems
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- Extragradient methods for vector equilibrium problems in Banach spaces
- Proximal point algorithm for differentiable quasi-convex multiobjective optimization
- A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions
- Duality results for interval-valued semiinfinite optimization problems with equilibrium constraints using convexificators
- Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
- Variable metric method for unconstrained multiobjective optimization problems
- Augmented Lagrangian cone method for multiobjective optimization problems with an application to an optimal control problem
- An accelerated proximal gradient method for multiobjective optimization
- Spectral conjugate gradient methods for vector optimization problems
- Convergence rates of the stochastic alternating algorithm for bi-objective optimization
- Convergence of inexact steepest descent algorithm for multiobjective optimizations on Riemannian manifolds without curvature constraints
- Conditional gradient method for vector optimization
- Proximal algorithm with quasidistances for multiobjective quasiconvex minimization in Riemannian manifolds
- Multiobjective BFGS method for optimization on Riemannian manifolds
- An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems
- Multiobjective conjugate gradient methods on Riemannian manifolds
- A Barzilai-Borwein descent method for multiobjective optimization problems
- A Newton-type proximal gradient method for nonlinear multi-objective optimization problems
- Proximal Newton methods for multiobjective optimization problems
- Bregman proximal point type algorithms for quasiconvex minimization
- MONOTONICITY FOR MULTIOBJECTIVE ACCELERATED PROXIMAL GRADIENT METHODS
This page was built for publication: Proximal Methods in Vector Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317531)
