Hybrid Approximate Proximal Method with Auxiliary Variational Inequality for Vector Optimization

This paper studies a general vector optimization problem of finding weakly efficient points for mappings from Hilbert spaces to arbitrary Banach spaces, where the latter are partially ordered by some closed, convex, and pointed cones with nonempty interiors. To find solutions of this vector optimization problem, we introduce an auxiliary variational inequality problem for a monotone and Lipschitz continuous mapping. The approximate proximal method in vector optimization is extended to develop a hybrid approximate proximal method for the general vector optimization problem under consideration by combining an extragradient method to find a solution of the variational inequality problem and an approximate proximal point method for finding a root of a maximal monotone operator. In this hybrid approximate proximal method, the subproblems consist of finding approximate solutions to the variational inequality problem for monotone and Lipschitz continuous mapping, and then finding weakly efficient points for a suitable regularization of the original mapping. We present both absolute and relative versions of our hybrid algorithm in which the subproblems are solved only approximately. The weak convergence of the generated sequence to a weak efficient point is established under quite mild assumptions. In addition, we develop some extensions of our hybrid algorithms for vector optimization by using Bregman-type functions.

[1]  Alfredo N. Iusem,et al.  A Projected Gradient Method for Vector Optimization Problems , 2004, Comput. Optim. Appl..

[2]  A. Iusem,et al.  Set-valued mappings and enlargements of monotone operators , 2008 .

[3]  Alfredo N. Iusem,et al.  Proximal Methods in Vector Optimization , 2005, SIAM J. Optim..

[4]  Jonathan Eckstein,et al.  Approximate iterations in Bregman-function-based proximal algorithms , 1998, Math. Program..

[5]  A. Iusem,et al.  Enlargement of Monotone Operators with Applications to Variational Inequalities , 1997 .

[6]  Boris Polyak,et al.  B.S. Mordukhovich. Variational Analysis and Generalized Differentiation. I. Basic Theory, II. Applications , 2009 .

[7]  J. Schu,et al.  Weak and strong convergence to fixed points of asymptotically nonexpansive mappings , 1991, Bulletin of the Australian Mathematical Society.

[8]  Johannes Jahn.  Theory of Vector Maximization: Various Concepts of Efficient Solutions , 1999 .

[9]  Jörg Fliege,et al.  Steepest descent methods for multicriteria optimization , 2000, Math. Methods Oper. Res..

[10]  M. Solodov,et al.  A Hybrid Approximate Extragradient – Proximal Point Algorithm Using the Enlargement of a Maximal Monotone Operator , 1999 .

[11]  Paulo J. S. Silva,et al.  Rescaling and Stepsize Selection in Proximal Methods Using Separable Generalized Distances , 2001, SIAM J. Optim..

[12]  A. Iusem,et al.  Totally Convex Functions for Fixed Points Computation and Infinite Dimensional Optimization , 2000 .

[13]  Marc Teboulle,et al.  A proximal-based decomposition method for convex minimization problems , 1994, Math. Program..

[14]  B. Svaiter,et al.  A steepest descent method for vector optimization , 2005 .

[15]  C. Tammer,et al.  An Algorithm for Vectorial Control Approximation Problems , 1997 .

[16]  Benar Fux Svaiter,et al.  An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions , 2000, Math. Oper. Res..

[17]  Jen-Chih Yao,et al.  Approximate proximal methods in vector optimization , 2007, Eur. J. Oper. Res..

[18]  Jen-Chih Yao,et al.  An implicit iterative scheme for monotone variational inequalities and fixed point problems , 2008 .

[19]  Wataru Takahashi,et al.  Strong Convergence Theorem by a Hybrid Method for Nonexpansive Mappings and Lipschitz-Continuous Monotone Mappings , 2006, SIAM J. Optim..

[20]  M. Fukushima,et al.  Nonlinear Proximal Decomposition Method for Convex Programming , 2000 .

[21]  S. BOLINTINÉANU,et al.  Approximate Efficiency and Scalar Stationarity in Unbounded Nonsmooth Convex Vector Optimization Problems , 2000 .

[22]  Regina Sandra Burachik,et al.  An Outer Approximation Method for the Variational Inequality Problem , 2005, SIAM J. Control. Optim..

[23]  R. Phelps.  Convex Functions, Monotone Operators and Differentiability , 1989 .

[24]  Boris S. Mordukhovich,et al.  Relative Pareto minimizers for multiobjective problems: existence and optimality conditions , 2009, Math. Program..

[25]  Bingsheng He,et al.  Inexact implicit methods for monotone general variational inequalities , 1999, Math. Program..

[26]  R. Rockafellar.  On the maximality of sums of nonlinear monotone operators , 1970 .

[27]  C. Tammer,et al.  Theory of Vector Optimization , 2003 .

[28]  M. V. Solodovy,et al.  A Hybrid Projection{proximal Point Algorithm , 1998 .

[29]  Benar Fux Svaiter,et al.  Forcing strong convergence of proximal point iterations in a Hilbert space , 2000, Math. Program..

[30]  G. M. Korpelevich.  The extragradient method for finding saddle points and other problems , 1976 .

[31]  H. Riahi,et al.  Variational Methods in Partially Ordered Spaces , 2003 .

[32]  R. Rockafellar.  Monotone Operators and the Proximal Point Algorithm , 1976 .

[33]  A. Smilde,et al.  Multicriteria decision making , 1992 .

[34]  B. Svaiter,et al.  Robustness of the Hybrid Extragradient Proximal-Point Algorithm , 2001 .

[35]  B. Mordukhovich.  Variational Analysis and Generalized Differentiation II: Applications , 2006 .