A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application

DOI10.1016/j.ejor.2015.06.016zbMath1346.90750OpenAlexW656398941MaRDI QIDQ319989

Ying Ji, Mark Goh, Robert de Souza, Shao-Jian Qu

Publication date: 6 October 2016

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

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

zbMATH Keywords

multiple objective programmingproximal point algorithm\(C\)-convexPareto optimumsupply chain network risk management

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06)

Related Items (4)

Non-monotonous sequential subgradient projection algorithm for convex feasibility problem ⋮ A relaxed projection method for solving multiobjective optimization problems ⋮ A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems ⋮ An accelerated augmented Lagrangian method for multi-criteria optimization problem

Uses Software

• PATH Solver

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quasi-Newton methods for solving multiobjective optimization
• An implementable proximal point algorithmic framework for nuclear norm minimization
• Proximal point algorithms for convex multi-criteria optimization with applications to supply chain risk management
• Convergence of the projected gradient method for quasiconvex multiobjective optimization
• Stochastic optimization problems with CVaR risk measure and their sample average approximation
• An interior proximal method in vector optimization
• A proximal point-type method for multicriteria optimization
• Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
• Scalarization of vector optimization problems
• Convex vector functions and their subdifferential
• Multi-criteria decision analysis via ratio and difference judgement
• Multicriteria optimization
• Complementarity problems in GAMS and the PATH solver
• Nonsmooth multiobjective programming with quasi-Newton methods
• Multiplier and gradient methods
• Scalarization in vector optimization
• Lagrangian-Dual Functions and Moreau–Yosida Regularization
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Proximal Methods in Vector Optimization
• A Subgradient Method for Vector Optimization Problems
• Proximité et dualité dans un espace hilbertien
• Some Remarks on Bi-level Vector Extremum Problems

This page was built for publication: A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application