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)- Relaxed-inertial proximal point type algorithms for quasiconvex minimization
- A Proximal-Type Method for Convex Vector Optimization Problem in Banach Spaces
- Parametric proximal-point methods
- Extragradient methods for vector equilibrium problems in Banach spaces
- On the convergence of Newton-type proximal gradient method for multiobjective optimization problems
- An implementable descent method for nonsmooth multiobjective optimization on Riemannian manifolds
- Complexity of gradient descent for multiobjective optimization
- Extragradient method with Bregman distances for solving vector quasi-equilibrium problems
- An efficient descent method for locally Lipschitz multiobjective optimization problems
- Charnes-Cooper scalarization and convex vector optimization
- Duality results for interval-valued pseudoconvex optimization problem with equilibrium constraints with applications
- Generalized proximal method for efficient solutions in vector optimization
- Conditional gradient method for vector optimization
- Efficient nonlinear conjugate gradient techniques for vector optimization problems
- Improved convergence rates for the multiobjective Frank-Wolfe method
- A linear scalarization proximal point method for quasiconvex multiobjective minimization
- Convergence analysis of Tikhonov-type regularization algorithms for multiobjective optimization problems
- Pareto-Fenchel \({\epsilon}\)-subdifferential sum rule and \({\epsilon}\)-efficiency
- Global convergence of a BFGS-type algorithm for nonconvex multiobjective optimization problems
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
- An inexact proximal point method with quasi-distance for quasi-convex multiobjective optimization
- Gradient-based algorithms for multi-objective bi-level optimization
- An extragradient method for vector equilibrium problems on Hadamard manifolds
- An away-step Frank-Wolfe algorithm for constrained multiobjective optimization
- Generalized viscosity approximation methods in multiobjective optimization problems
- Proximal algorithms in statistics and machine learning
- Proximal algorithm with quasidistances for multiobjective quasiconvex minimization in Riemannian manifolds
- Proximal gradient methods for multiobjective optimization and their applications
- Steepest descent methods for critical points in vector optimization problems
- A proximal gradient splitting method for solving convex vector optimization problems
- An inexact proximal point method for quasiconvex multiobjective optimization
- A refined proximal algorithm for nonconvex multiobjective optimization in Hilbert spaces
- New hybrid conjugate gradient algorithm for vector optimization problems
- A subgradient method for multiobjective optimization on Riemannian manifolds
- Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints
- Nonmonotone proximal gradient method for composite multiobjective optimization problems
- Duality results for interval-valued semiinfinite optimization problems with equilibrium constraints using convexificators
- Multiobjective BFGS method for optimization on Riemannian manifolds
- On the convergence analysis of a proximal gradient method for multiobjective optimization
- 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
- Multiple reduced gradient method for multiobjective optimization problems
- Some remarks on proximal point algorithm in scalar and vectorial cases
- An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems
- Inexact multi-objective local search proximal algorithms: application to group dynamic and distributive justice problems
- An interior proximal method in vector optimization
- On inexact projected gradient methods for solving variable vector optimization problems
- scientific article; zbMATH DE number 7426954 (Why is no real title available?)
- The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem
- An accelerated proximal gradient method for multiobjective optimization
- Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization
- The stochastic multi-gradient algorithm for multi-objective optimization and its application to supervised machine learning
- A steepest descent-like method for variable order vector optimization problems
- Tikhonov-type regularization method for efficient solutions in vector optimization
- A proximal point-type method for multicriteria optimization
- An external penalty-type method for multicriteria
- A quadratically convergent Newton method for vector optimization
- A Newton-type proximal gradient method for nonlinear multi-objective optimization problems
- A Barzilai-Borwein descent method for multiobjective optimization problems
- Extended Newton methods for multiobjective optimization: majorizing function technique and convergence analysis
- A study of Liu-Storey conjugate gradient methods for vector optimization
- Inexact proximal point method with a Bregman regularization for quasiconvex multiobjective optimization problems via limiting subdifferentials
- Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces
- A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application
- Proximal point method for vector optimization on Hadamard manifolds
- Variants for the logarithmic-quadratic proximal point scalarization method for multiobjective programming
- On the extension of the Hager-Zhang conjugate gradient method for vector optimization
- Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds
- Proximal point algorithm for differentiable quasi-convex multiobjective optimization
- Hybrid proximal methods for equilibrium problems
- Spectral conjugate gradient methods for vector optimization problems
- 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 steepest descent-like method for vector optimization problems with variable domination structure
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- Newton-like methods for efficient solutions in vector optimization
- A relaxed projection method for solving multiobjective optimization problems
- Bregman proximal point type algorithms for quasiconvex minimization
- Approximate proximal methods in vector optimization
- A nonlinear conjugate gradient algorithm for multiobjective optimization: multiple hybrid search direction and global rates
- A quasi-Newton method with Wolfe line searches for multiobjective optimization
- Convergence rates of the stochastic alternating algorithm for bi-objective optimization
- Hybrid proximal point algorithm for solution of convex multiobjective optimization problem over fixed point constraint
- A strongly convergent proximal point method for vector optimization
- MONOTONICITY FOR MULTIOBJECTIVE ACCELERATED PROXIMAL GRADIENT METHODS
- A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions
- Combined gradient methods for multiobjective optimization
- Proximal point methods for Lipschitz functions on Hadamard manifolds: scalar and vectorial cases
- The proximal point method with a vectorial Bregman regularization in multiobjective DC programming
- Asymptotic analysis in convex composite multiobjective optimization problems
- Newton-like methods for solving vector optimization problems
- A logarithmic-quadratic proximal point scalarization method for multiobjective programming
- A barrier-type method for multiobjective optimization
- Proximal point method for locally Lipschitz functions in multiobjective optimization of Hadamard manifolds
- An inexact proximal point method with quasi-distance for quasiconvex multiobjective optimization problems on Riemannian manifolds
- Proximal point method for a special class of nonconvex multiobjective optimization functions
- A descent method for nonsmooth multiobjective optimization in Hilbert spaces
- On the extension of Dai-Liao conjugate gradient method for vector optimization
- A family of conjugate gradient methods with guaranteed positiveness and descent for vector optimization
- MultiSQP-GS: a sequential quadratic programming algorithm via gradient sampling for nonsmooth constrained multiobjective optimization
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)
