Approximate proximal methods in vector optimization
From MaRDI portal
Publication:2370322
DOI10.1016/j.ejor.2006.09.070zbMath1128.90053OpenAlexW2014234363MaRDI QIDQ2370322
Publication date: 25 June 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.09.070
Related Items
Generalized proximal-type methods for weak vector variational inequality problems in Banach spaces ⋮ Generalized Proximal Method for Efficient Solutions in Vector Optimization ⋮ A nonmonotone gradient method for constrained multiobjective optimization problems ⋮ 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 ⋮ Multi-step implicit iterative methods with regularization for minimization problems and fixed point problems ⋮ A quasi-Newton method with Wolfe line searches for multiobjective optimization ⋮ Hybrid approximate proximal method with auxiliary variational inequality for vector optimization ⋮ Convergence analysis of a projected gradient method for multiobjective optimization problems ⋮ Proximal point method for vector optimization on Hadamard manifolds ⋮ Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm ⋮ An inexact scalarization proximal point method for multiobjective quasiconvex minimization ⋮ Applications of fixed point theory to extended Nash equilibriums of nonmonetized noncooperative games on posets ⋮ Spectral conjugate gradient methods for vector optimization problems ⋮ On the extension of the Hager-Zhang conjugate gradient method for vector optimization ⋮ Proximal algorithm with quasidistances for multiobjective quasiconvex minimization in Riemannian manifolds ⋮ On the convergence rate of a proximal point algorithm for vector function on Hadamard manifolds ⋮ Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds ⋮ A scalarization proximal point method for quasiconvex multiobjective minimization ⋮ An interior proximal method in vector optimization ⋮ Hybrid extragradient method with regularization for convex minimization, generalized mixed equilibrium, variational inequality and fixed point problems ⋮ Hybrid methods with regularization for minimization problems and asymptotically strict pseudocontractive mappings in the intermediate sense ⋮ 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 ⋮ 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 ⋮ An algorithm for vector optimization problems ⋮ Tikhonov-type regularization method for efficient solutions in vector optimization ⋮ Generalized viscosity approximation methods in multiobjective optimization problems ⋮ Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces ⋮ A linear scalarization proximal point method for quasiconvex multiobjective minimization ⋮ Asymptotic analysis for proximal-type methods in vector variational inequality problems ⋮ Nonlinear Conjugate Gradient Methods for Vector Optimization ⋮ 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 projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems ⋮ A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems ⋮ Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization ⋮ Convergence analysis of Tikhonov-type regularization algorithms for multiobjective optimization problems ⋮ Unnamed Item ⋮ An improved proximal method with quasi-distance for nonconvex multiobjective optimization problem ⋮ Steepest descent methods for critical points in vector optimization problems ⋮ Newton-like methods for solving vector optimization problems ⋮ Linear convergence of a nonmonotone projected gradient method for multiobjective optimization ⋮ Multi-step iterative algorithms with regularization for triple hierarchical variational inequalities with constraints of mixed equilibria, variational inclusions, and convex minimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convex functions, monotone operators and differentiability
- Approximate iterations in Bregman-function-based proximal algorithms
- A proximal-based deomposition method for compositions method for convex minimization problems
- Enlargement of monotone operators with applications to variational inequalities
- Steepest descent methods for multicriteria optimization.
- Variational methods in partially ordered spaces
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- Totally convex functions for fixed points computation and infinite dimensional optimization
- Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems
- Nonlinear proximal decomposition method for convex programming
- A steepest descent method for vector optimization
- Inexact implicit methods for monotone general variational inequalities
- A projected gradient method for vector optimization problems
- Forcing strong convergence of proximal point iterations in a Hilbert space
- An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
- Rescaling and Stepsize Selection in Proximal Methods Using Separable Generalized Distances
- Monotone Operators and the Proximal Point Algorithm
- On a proximal point method for convex optimization in banach spaces
- Proximal Methods in Vector Optimization
- Robustness of the hybrid extragradient proximal-point algorithm.
