Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels
DOI10.1155/2017/5675183zbMATH Open1397.90348OpenAlexW2766701427MaRDI QIDQ1784885FDOQ1784885
Authors: Ying Ji, Shaojian Qu 
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
Recommendations
- scientific article; zbMATH DE number 2076851
- The proximal point method with a vectorial Bregman regularization in multiobjective DC programming
- A general double-proximal gradient algorithm for d.c. programming
- A new boosted proximal point algorithm for minimizing nonsmooth DC functions
- Proximal bundle methods for nonsmooth DC programming
Multi-objective and goal programming (90C29) Nonconvex programming, global optimization (90C26) Inventory, storage, reservoirs (90B05)
Cites Work
- Title not available (Why is that?)
- Monotone Operators and the Proximal Point Algorithm
- An implementable proximal point algorithmic framework for nuclear norm minimization
- Title not available (Why is that?)
- Proximité et dualité dans un espace hilbertien
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convex vector functions and their subdifferential
- Multiobjective DC programs with infinite convex constraints
- On the convergence of an approximate proximal method for DC functions
- Title not available (Why is that?)
- Proximal Methods in Vector Optimization
- A dual condition for the convex subdifferential sum formula with applications
- An interior proximal method in vector optimization
- Optimality conditions for D.C. vector optimization problems under reverse convex constraints
- Sequential convex approximations to joint chance constrained programs: A Monte Carlo approach
- Trust region methods for solving multiobjective optimisation
- Quasi-Newton methods for solving multiobjective optimization
- Proximal point algorithms for convex multi-criteria optimization with applications to supply chain risk management
- Some remarks on bi-level vector extremum problems
- Higher integrability of Green's operator and homotopy operator
- Strong convergence of contraction semigroups and of iterative methods for accretive operators in Banach spaces
- Homotopy method for a general multiobjective programming problem
- Global estimates for the maximal operator and homotopy operator
Cited In (5)
- Title not available (Why is that?)
- A LogTVSCAD nonconvex regularization model for image deblurring in the presence of impulse noise
- A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem
- Proximal point algorithms for convex multi-criteria optimization with applications to supply chain risk management
- The proximal point method with a vectorial Bregman regularization in multiobjective DC programming
This page was built for publication: Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1784885)
