Hybrid approximate proximal method with auxiliary variational inequality for vector optimization

DOI10.1007/s10957-010-9667-4zbMath1251.90388OpenAlexW2044903028MaRDI QIDQ604261

Boris S. Mordukhovich, Jen-Chih Yao, Lu-Chuan Ceng

Publication date: 10 November 2010

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://digitalcommons.wayne.edu/math_reports/63

zbMATH Keywords

vector optimizationBanach spacesproximal pointsauxiliary variational inequalitieshybrid inexact algorithms

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Derivative-free methods and methods using generalized derivatives (90C56) Approximation methods and heuristics in mathematical programming (90C59) Programming in abstract spaces (90C48) Optimality conditions (49K99)

Related Items

An inertial Popov's method for solving pseudomonotone variational inequalities ⋮ An abstract proximal point algorithm ⋮ Generalized Proximal Method for Efficient Solutions in Vector Optimization ⋮ A study of Liu-Storey conjugate gradient methods for vector optimization ⋮ Newton-like methods for efficient solutions in vector optimization ⋮ A quasi-Newton method with Wolfe line searches for multiobjective optimization ⋮ An inexact steepest descent method for multicriteria optimization on Riemannian manifolds ⋮ Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm ⋮ A projective splitting method for monotone inclusions: iteration-complexity and application to composite optimization ⋮ On inexact relative-error hybrid proximal extragradient, forward-backward and Tseng's modified forward-backward methods with inertial effects ⋮ On the extension of the Hager-Zhang conjugate gradient method for vector optimization ⋮ On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems ⋮ Convergence of the projection and contraction methods for solving bilevel variational inequality problems ⋮ An inexact Spingarn's partial inverse method with applications to operator splitting and composite optimization ⋮ On the convergence rate of a proximal point algorithm for vector function on Hadamard manifolds ⋮ A proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in the presence of computational errors ⋮ The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem ⋮ On the convergence rate of the scaled proximal decomposition on the graph of a maximal monotone operator (SPDG) algorithm ⋮ Proximal point method for a special class of nonconvex multiobjective optimization functions ⋮ Hybrid proximal methods for equilibrium problems ⋮ The self regulation problem as an inexact steepest descent method for multicriteria optimization ⋮ Tikhonov-type regularization method for efficient solutions in vector optimization ⋮ Convergence of the projected gradient method for quasiconvex multiobjective optimization ⋮ Nonlinear Conjugate Gradient Methods for Vector Optimization ⋮ 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 ⋮ Inexact proximal point methods in metric spaces ⋮ Iteration complexity of an inexact Douglas-Rachford method and of a Douglas-Rachford-Tseng's F-B four-operator splitting method for solving monotone inclusions ⋮ Steepest descent methods for critical points in vector optimization problems ⋮ Newton-like methods for solving vector optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
• An implicit iterative scheme for monotone variational inequalities and fixed point problems
• 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.
• A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
• 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
• Approximate proximal methods in vector optimization
• Set-valued mappings and enlargement of monotone operators.
• 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
• Weak and strong convergence to fixed points of asymptotically nonexpansive mappings
• Counterexamples Concerning Support Theorems for Convex Sets in Hilbert Space
• Monotone Operators and the Proximal Point Algorithm
• An Existence Theorem in Vector Optimization
• On a proximal point method for convex optimization in banach spaces
• An Outer Approximation Method for the Variational Inequality Problem
• Proximal Methods in Vector Optimization
• Strong Convergence Theorem by a Hybrid Method for Nonexpansive Mappings and Lipschitz-Continuous Monotone Mappings
• On the Maximality of Sums of Nonlinear Monotone Operators
• Robustness of the hybrid extragradient proximal-point algorithm.