Proximal Methods in Vector Optimization

DOI10.1137/S1052623403429093zbMath1093.90054OpenAlexW2080752182MaRDI QIDQ5317531

Henri Bonnel, Alfredo Noel Iusem, Benar Fux Svaiter

Publication date: 16 September 2005

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1052623403429093

zbMATH Keywords

vector optimizationproximal pointinexact algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Multi-objective and goal programming (90C29) Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52) Programming in abstract spaces (90C48) Numerical methods in optimal control (49M99)

Related Items (only showing first 100 items - show all)

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 Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions ⋮ Charnes-Cooper scalarization and convex vector optimization ⋮ Generalized proximal-type methods for weak vector variational inequality problems in Banach spaces ⋮ Multiple reduced gradient method for multiobjective optimization problems ⋮ Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions ⋮ Proximal point methods for Lipschitz functions on Hadamard manifolds: scalar and vectorial cases ⋮ Reduced Jacobian method ⋮ Approximate proximal methods in vector optimization ⋮ Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints ⋮ An abstract proximal point algorithm ⋮ An external penalty-type method for multicriteria ⋮ On inexact projected gradient methods for solving variable vector optimization problems ⋮ Generalized Proximal Method for Efficient Solutions in Vector Optimization ⋮ A steepest descent-like method for vector optimization problems with variable domination structure ⋮ A study of Liu-Storey conjugate gradient methods for vector optimization ⋮ A modified Quasi-Newton method for vector optimization problem ⋮ Newton-like methods for efficient solutions in vector optimization ⋮ Inexact multi-objective local search proximal algorithms: application to group dynamic and distributive justice problems ⋮ 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 inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems ⋮ A quasi-Newton method with Wolfe line searches for multiobjective optimization ⋮ Variants for the logarithmic-quadratic proximal point scalarization method for multiobjective programming ⋮ Hybrid approximate proximal method with auxiliary variational inequality for vector optimization ⋮ Duality results for interval-valued pseudoconvex optimization problem with equilibrium constraints with applications ⋮ An inexact steepest descent method for multicriteria optimization on Riemannian manifolds ⋮ A subgradient method for multiobjective optimization on Riemannian manifolds ⋮ Proximal point method for vector optimization on Hadamard manifolds ⋮ The multiobjective steepest descent direction is not Lipschitz continuous, but is Hölder continuous ⋮ Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm ⋮ An inexact scalarization proximal point method for multiobjective quasiconvex minimization ⋮ Duality results for interval-valued semiinfinite optimization problems with equilibrium constraints using convexificators ⋮ 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 ⋮ Proximal gradient methods for multiobjective optimization and their applications ⋮ On the extension of the Hager-Zhang conjugate gradient method for vector optimization ⋮ 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 ⋮ A logarithmic-quadratic proximal point scalarization method for multiobjective programming ⋮ Conditional gradient method for vector optimization ⋮ Proximal algorithm with quasidistances for multiobjective quasiconvex minimization in Riemannian manifolds ⋮ Nonmonotone gradient methods for vector optimization with a portfolio optimization application ⋮ Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds ⋮ Convergence rates analysis of a multiobjective proximal gradient method ⋮ Relaxed-inertial proximal point type algorithms for quasiconvex minimization ⋮ Asymptotic analysis in convex composite multiobjective optimization problems ⋮ A scalarization proximal point method for quasiconvex multiobjective minimization ⋮ An interior proximal method in vector optimization ⋮ Unnamed Item ⋮ 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 variable order vector optimization problems ⋮ A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization ⋮ Proximal point method for locally Lipschitz functions in multiobjective optimization of Hadamard manifolds ⋮ Logarithmic quasi-distance proximal point scalarization method for multi-objective programming ⋮ 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 barrier-type method for multiobjective optimization ⋮ Generalized proximal point algorithms for multiobjective optimization problems ⋮ A proximal point algorithm with quasi-distance in multi-objective optimization ⋮ Proximal point method for a special class of nonconvex multiobjective optimization functions ⋮ A relaxed projection method for solving multiobjective optimization problems ⋮ Box-constrained multi-objective optimization: A gradient-like method without ``a priori scalarization ⋮ An algorithm for vector optimization problems ⋮ Pareto-Fenchel \({\epsilon}\)-subdifferential sum rule and \({\epsilon}\)-efficiency ⋮ Hybrid proximal methods for equilibrium problems ⋮ A quadratically convergent Newton method for vector optimization ⋮ The self regulation problem as an inexact steepest descent method for multicriteria optimization ⋮ Tikhonov-type regularization method for efficient solutions in vector optimization ⋮ Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds ⋮ Generalized viscosity approximation methods in multiobjective optimization problems ⋮ Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces ⋮ Extragradient Methods for Vector Equilibrium Problems in Banach Spaces ⋮ Convergence of the projected gradient method for quasiconvex multiobjective optimization ⋮ A linear scalarization proximal point method for quasiconvex multiobjective minimization ⋮ Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels ⋮ Nonlinear Conjugate Gradient Methods for Vector Optimization ⋮ Complexity of gradient descent for multiobjective optimization ⋮ An efficient descent method for locally Lipschitz multiobjective optimization problems ⋮ A Proximal-Type Method for Convex Vector Optimization Problem in Banach Spaces ⋮ A proximal point-type method for multicriteria optimization ⋮ Parallel proximal point methods for systems of vector optimization problems on Hadamard manifolds without convexity ⋮ A strongly convergent proximal point method for vector optimization ⋮ A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems ⋮ An extragradient method for vector equilibrium problems on Hadamard manifolds ⋮ Convergence analysis of Tikhonov-type regularization algorithms for multiobjective optimization problems ⋮ A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data ⋮ Extended Newton Methods for Multiobjective Optimization: Majorizing Function Technique and Convergence Analysis ⋮ Globally convergent Newton-type methods for multiobjective optimization ⋮ An augmented Lagrangian algorithm for multi-objective optimization ⋮ Combined gradient methods for multiobjective optimization ⋮ Extragradient method with Bregman distances for solving vector quasi-equilibrium problems ⋮ Proximal point algorithm for differentiable quasi-convex multiobjective optimization ⋮ Steepest descent methods for critical points in vector optimization problems ⋮ Newton-like methods for solving vector optimization problems ⋮ Multiobjective BFGS method for optimization on Riemannian manifolds

This page was built for publication: Proximal Methods in Vector Optimization