An interior proximal method in vector optimization

DOI10.1016/j.ejor.2011.05.006zbMath1244.90244MaRDI QIDQ635150

Kely D. V. Villacorta, Paulo Roberto Oliveira

Publication date: 19 August 2011

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2011.05.006

zbMATH Keywords

vector optimization; interior point methods; \(C\)-convex; positively lower semicontinuous

Mathematics Subject Classification ID

90C29: Multi-objective and goal programming

90C51: Interior-point methods

Related Items

An inexact algorithm with proximal distances for variational inequalities, The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem, Nonlinear Conjugate Gradient Methods for Vector Optimization, The proximal point method with a vectorial Bregman regularization in multiobjective DC programming, Conditional gradient method for vector optimization, Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions, A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application, Proximal point algorithms for convex multi-criteria optimization with applications to supply chain risk management, A proximal point algorithm with quasi-distance in multi-objective optimization, Logarithmic quasi-distance proximal point scalarization method for multi-objective programming, A proximal point-type method for multicriteria optimization, A scalarization proximal point method for quasiconvex multiobjective minimization, An inexact proximal method with proximal distances for quasimonotone equilibrium problems, Nonmonotone gradient methods for vector optimization with a portfolio optimization application, On the convergence rate of a proximal point algorithm for vector function on Hadamard manifolds, Proximal point method for a special class of nonconvex multiobjective optimization functions, A relaxed projection method for solving multiobjective optimization problems, Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels, A study of Liu-Storey conjugate gradient methods for vector optimization, On the extension of the Hager-Zhang conjugate gradient method for vector optimization, Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds, The self regulation problem as an inexact steepest descent method for multicriteria optimization, 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 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, Inertial forward–backward methods for solving vector optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems
• Duality for multiobjective optimization via nonlinear Lagrangian functions
• Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems
• A steepest descent method for vector optimization
• Nonlinear economic dynamics
• A method for finding the set of non-dominated vectors for multiple objective integer linear programs
• Approximate proximal methods in vector optimization
• On the choice of parameters for the weighting method in vector optimization
• Characterizations of solution sets of convex vector minimization problems
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• AN η-APPROXIMATION APPROACH IN NONLINEAR VECTOR OPTIMIZATION WITH UNIVEX FUNCTIONS
• Interior proximal method for variational inequalities on non-polyhedral sets
• Newton's Method for Multiobjective Optimization
• Entropic Proximal Mappings with Applications to Nonlinear Programming
• Monotone Operators and the Proximal Point Algorithm
• Convergence of Proximal-Like Algorithms
• Proximal Minimization Methods with Generalized Bregman Functions
• On inexact generalized proximal methods with a weakened error tolerance criterion
• Proximal Methods in Vector Optimization
• Bregman functions and auxiliary problem principle
• Interior Gradient and Proximal Methods for Convex and Conic Optimization
• Proximité et dualité dans un espace hilbertien
• Bregman-like functions and proximal methods for variational problems with nonlinear constraints