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)- An abstract proximal point algorithm
- A modified Quasi-Newton method for vector optimization problem
- Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm
- A hybrid gradient method for vector optimization problems
- Proximal point method with Bregman regularization for multiobjective optimization problems on Hadamard manifolds
- Nonmonotone gradient methods for vector optimization with a portfolio optimization application
- A scalarization proximal point method for quasiconvex multiobjective minimization
- The multiobjective steepest descent direction is not Lipschitz continuous, but is Hölder continuous
- Generalized contractions and hybrid approximate proximal method for vector optimization problems
- A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data
- Proximal Newton methods for multiobjective optimization problems
- An augmented Lagrangian algorithm for multi-objective optimization
- An inexact scalarization proximal point method for multiobjective quasiconvex minimization
- An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems
- Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds
- On the Dai–Liao conjugate gradient method for vector optimization
- Uniform weak sharp minima for multiobjective optimization problems
- Cardinality-Constrained Multi-objective Optimization: Novel Optimality Conditions and Algorithms
- Alternative extension of the Hager–Zhang conjugate gradient method for vector optimization
- A proximal gradient method with an explicit line search for multiobjective optimization
- Convergence rates analysis of a multiobjective proximal gradient method
- A proximal point algorithm with quasi-distance in multi-objective optimization
- Box-constrained multi-objective optimization: A gradient-like method without ``a priori scalarization
- Augmented Lagrangian cone method for multiobjective optimization problems with an application to an optimal control problem
- Proximal linear maps
- Convergence of inexact steepest descent algorithm for multiobjective optimizations on Riemannian manifolds without curvature constraints
- The self regulation problem as an inexact steepest descent method for multicriteria optimization
- A bundle trust-region algorithm for nonsmooth nonconvex constrained optimization
- Logarithmic quasi-distance proximal point scalarization method for multi-objective programming
- Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints
- A PRP type conjugate gradient method without truncation for nonconvex vector optimization
- Inertial forward–backward methods for solving vector optimization problems
- A dynamic multiple proximal bundle algorithm for locally Lipschitz multiobjective optimization problems
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
- Globally convergent Newton-type methods for multiobjective optimization
- Parallel proximal point methods for systems of vector optimization problems on Hadamard manifolds without convexity
- A non-monotone proximal gradient algorithm for solving nonsmooth multiobjective optimization problems with an extending application to robust multiobjective optimization
- Strict efficiency in vector optimization via a directional curvature functional
- Variable metric method for unconstrained multiobjective optimization problems
- An inexact steepest descent method for multicriteria optimization on Riemannian manifolds
- Generalized proximal point algorithms for multiobjective optimization problems
- Preconditioned Barzilai-Borwein methods for multiobjective optimization problems
- A three-term conjugate gradient-type method with sufficient descent property for vector optimization
- Multiobjective conjugate gradient methods on Riemannian manifolds
- Reduced Jacobian method
- Nonlinear Conjugate Gradient Methods for Vector Optimization
- Adaptive generalized conditional gradient method for multiobjective optimization
- Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
- Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels
- A subspace minimization Barzilai-Borwein method for multiobjective optimization problems
- An algorithm for vector optimization problems
- 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
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)
