Hybrid approximate proximal algorithms for efficient solutions in vector optimization

zbMATH Open1223.49033MaRDI QIDQ3173954FDOQ3173954

Authors: Thai Doan Chuong, Boris S. Mordukhovich, Jen-Chih Yao 

Publication date: 11 October 2011

Full work available at URL: http://www.yokohamapublishers.jp/online2/opjnca/vol12/p257.html

Recommendations

• Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
• Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces
• scientific article; zbMATH DE number 7426954
• Generalized proximal method for efficient solutions in vector optimization
• Approximate proximal methods in vector optimization

zbMATH Keywords

variational inequalitiesefficient solutionsvector optimizationBregman functionshybrid approximate proximal algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical methods based on nonlinear programming (49M37) Iterative procedures involving nonlinear operators (47J25) Sensitivity, stability, well-posedness (49K40)

Cited In (25)

• Applications of fixed point theory to extended Nash equilibriums of nonmonetized noncooperative games on posets
• Viscosity-type approximation method for efficient solutions in vector optimization
• Generalized proximal method for efficient solutions in vector optimization
• Global convergence of a BFGS-type algorithm for nonconvex multiobjective optimization problems
• A linear scalarization proximal point method for quasiconvex multiobjective minimization
• A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
• Proximal Methods in Vector Optimization
• On the convergence rate of a proximal point algorithm for vector function on Hadamard manifolds
• Title not available (Why is that?)
• The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem
• Tikhonov-type regularization method for efficient solutions in vector optimization
• A proximal point-type method for multicriteria optimization
• A study of Liu-Storey conjugate gradient methods for vector optimization
• A proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in the presence of computational errors
• On the extension of the Hager-Zhang conjugate gradient method for vector optimization
• Inexact proximal point methods in metric spaces
• Newton-like methods for efficient solutions in vector optimization
• A quasi-Newton method with Wolfe line searches for multiobjective optimization
• On the extension of Dai-Liao conjugate gradient method for vector optimization
• Proximal point method for a special class of nonconvex multiobjective optimization functions
• Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm
• Generalized contractions and hybrid approximate proximal method for vector optimization problems
• Nonlinear Conjugate Gradient Methods for Vector Optimization
• Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
• An algorithm for vector optimization problems

This page was built for publication: Hybrid approximate proximal algorithms for efficient solutions in vector optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3173954)