Improving the efficiency of DC global optimization methods by improving the DC representation of the objective function

DOI10.1007/s10898-008-9343-5zbMath1172.90463OpenAlexW2110168622WikidataQ57836360 ScholiaQ57836360MaRDI QIDQ2271151

Albert Ferrer, Juan-Enrique Martinez-Legaz

Publication date: 6 August 2009

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-008-9343-5

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items

DC semidefinite programming and cone constrained DC optimization. I: Theory, A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes, Visualizing data as objects by DC (difference of convex) optimization, A branch and reduce approach for solving a class of low rank d.c. programs, New global optimality conditions for nonsmooth DC optimization problems

Cites Work

• Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming
• A general cone decomposition theory based on efficiency
• Introduction to global optimization
• The Power-Compositions Determinant and Its Application to Global Optimization
• Logarithmic Barrier Decomposition Methods for Semi-infinite Programming
• Convex analysis and global optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item