An interior proximal method in vector optimization
暂无分享,去创建一个
[1] Dariusz Zagrodny,et al. Vector variational principle , 2009, 0907.1213.
[2] Marc Teboulle,et al. Entropic Proximal Mappings with Applications to Nonlinear Programming , 1992, Math. Oper. Res..
[3] Alejandro Crema,et al. A method for finding the set of non-dominated vectors for multiple objective integer linear programs , 2004, Eur. J. Oper. Res..
[4] César Gutiérrez,et al. Optimality conditions via scalarization for a new epsilon-efficiency concept in vector optimization problems , 2010, Eur. J. Oper. Res..
[5] Nelson Maculan,et al. On the choice of parameters for the weighting method in vector optimization , 2008, Math. Program..
[6] R. Rockafellar. Monotone Operators and the Proximal Point Algorithm , 1976 .
[7] Marc Teboulle,et al. Interior Gradient and Proximal Methods for Convex and Conic Optimization , 2006, SIAM J. Optim..
[8] Marc Teboulle,et al. Convergence of Proximal-Like Algorithms , 1997, SIAM J. Optim..
[9] R. Tyrrell Rockafellar,et al. Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.
[10] A. Kaplan,et al. Bregman-like functions and proximal methods for variational problems with nonlinear constraints , 2007 .
[11] A. Kaplan,et al. INTERIOR PROXIMAL METHOD FOR VARIATIONAL INEQUALITIES ON NON-POLYHEDRAL SETS , 2007 .
[12] C. Tammer,et al. Theory of Vector Optimization , 2003 .
[13] B. Martinet. Brève communication. Régularisation d'inéquations variationnelles par approximations successives , 1970 .
[14] Marc Teboulle,et al. Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels , 1999, Math. Oper. Res..
[15] Marc Teboulle,et al. Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions , 1993, SIAM J. Optim..
[16] A. Kaplan,et al. On inexact generalized proximal methods with a weakened error tolerance criterion , 2004 .
[17] Jörg Fliege,et al. Newton's Method for Multiobjective Optimization , 2009, SIAM J. Optim..
[18] Xiaoqi Yang,et al. Duality for Multiobjective Optimization via Nonlinear Lagrangian Functions , 2004 .
[19] Alexander Kaplan,et al. Bregman functions and auxiliary problem principle , 2008, Optim. Methods Softw..
[20] Vaithilingam Jeyakumar,et al. Characterizations of solution sets of convex vector minimization problems , 2006, Eur. J. Oper. Res..
[21] O. Nelles,et al. An Introduction to Optimization , 1996, IEEE Antennas and Propagation Magazine.
[22] K. Kiwiel. Proximal Minimization Methods with Generalized Bregman Functions , 1997 .
[23] Bernard Martinet,et al. Algorithmes pour la résolution de problèmes d'optimisation et de minimax , 1972 .
[24] Tadeusz Antczak. An eta-Approximation Approach in Nonlinear Vector Optimization with Univex Functions , 2006, Asia Pac. J. Oper. Res..
[25] B. Svaiter,et al. A steepest descent method for vector optimization , 2005 .
[26] Ronaldo Malheiros Gregório,et al. A logarithmic-quadratic proximal point scalarization method for multiobjective programming , 2011, J. Glob. Optim..
[27] J. Moreau. Proximité et dualité dans un espace hilbertien , 1965 .
[28] Jen-Chih Yao,et al. Approximate proximal methods in vector optimization , 2007, Eur. J. Oper. Res..
[29] S. BOLINTINÉANU,et al. Approximate Efficiency and Scalar Stationarity in Unbounded Nonsmooth Convex Vector Optimization Problems , 2000 .
[30] Alfredo N. Iusem,et al. Proximal Methods in Vector Optimization , 2005, SIAM J. Optim..