A new concave reformulation and its application in solving DC programming globally under uncertain environment

DOI10.3934/jimo.2019057zbMath1476.65108OpenAlexW2946000151WikidataQ127769136 ScholiaQ127769136MaRDI QIDQ2244216

Yan-Jun Wang, Kai-Ji Shen

Publication date: 12 November 2021

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2019057

zbMATH Keywords

global optimizationbranch and boundconvex relaxationDC programmingconcave reformulation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90)

Cites Work

• Unnamed Item
• Unnamed Item
• Global optimization for special reverse convex programming
• Robust solutions of uncertain linear programs
• Robust solutions of linear programming problems contaminated with uncertain data
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• Varying confidence levels for CVaR risk measures and minimax limits
• Global optimization for sum of linear ratios problem with coefficients
• Robust Convex Optimization
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem

This page was built for publication: A new concave reformulation and its application in solving DC programming globally under uncertain environment