Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels

DOI10.1155/2017/5675183MaRDI QIDQ1784885zbMATH OpenOpenAlexFDO

Authors Ying Ji, Shaojian Qu

Publication date 27 September 2018

Published in Discrete Dynamics in Nature and Society (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2017/5675183

zbMATH Keywords

proximal point algorithms\(C\)-convex functionsvector DC programming

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonconvex programming, global optimization (90C26) Inventory, storage, reservoirs (90B05)

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

Cites work

• scientific article; zbMATH DE number 3595777 (Why is no real title available?)
• scientific article; zbMATH DE number 2076851 (Why is no real title available?)
• scientific article; zbMATH DE number 1568702 (Why is no real title available?)
• scientific article; zbMATH DE number 3310599 (Why is no real title available?)
• scientific article; zbMATH DE number 3365044 (Why is no real title available?)
• A dual condition for the convex subdifferential sum formula with applications
• An implementable proximal point algorithmic framework for nuclear norm minimization
• An interior proximal method in vector optimization
• Convex vector functions and their subdifferential
• Global estimates for the maximal operator and homotopy operator
• Higher integrability of Green's operator and homotopy operator
• Homotopy method for a general multiobjective programming problem
• Monotone Operators and the Proximal Point Algorithm
• Multiobjective DC programs with infinite convex constraints
• On the convergence of an approximate proximal method for DC functions
• Optimality conditions for D.C. vector optimization problems under reverse convex constraints
• Proximal Methods in Vector Optimization
• Proximal point algorithms for convex multi-criteria optimization with applications to supply chain risk management
• Proximité et dualité dans un espace hilbertien
• Quasi-Newton methods for solving multiobjective optimization
• Sequential convex approximations to joint chance constrained programs: A Monte Carlo approach
• Some remarks on bi-level vector extremum problems
• Strong convergence of contraction semigroups and of iterative methods for accretive operators in Banach spaces
• Trust region methods for solving multiobjective optimisation

Cited in

(5)

• A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem
• A LogTVSCAD nonconvex regularization model for image deblurring in the presence of impulse noise
• scientific article; zbMATH DE number 2076851 (Why is no real title available?)
• The proximal point method with a vectorial Bregman regularization in multiobjective DC programming
• Proximal point algorithms for convex multi-criteria optimization with applications to supply chain risk management

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)