Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels
From MaRDI portal
Publication:1784885
DOI10.1155/2017/5675183zbMath1397.90348OpenAlexW2766701427MaRDI QIDQ1784885
Publication date: 27 September 2018
Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2017/5675183
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Inventory, storage, reservoirs (90B05)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Higher integrability of Green's operator and homotopy operator
- 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
- An interior proximal method in vector optimization
- Optimality conditions for D.C. vector optimization problems under reverse convex constraints
- Homotopy method for a general multiobjective programming problem
- Strong convergence of contraction semigroups and of iterative methods for accretive operators in Banach spaces
- Convex vector functions and their subdifferential
- Multiobjective DC programs with infinite convex constraints
- Trust region methods for solving multiobjective optimisation
- Sequential Convex Approximations to Joint Chance Constrained Programs: A Monte Carlo Approach
- Global estimates for the maximal operator and homotopy operator
- Monotone Operators and the Proximal Point Algorithm
- Proximal Methods in Vector Optimization
- Proximité et dualité dans un espace hilbertien
- Some Remarks on Bi-level Vector Extremum Problems
