Successive search methods for solving a canonical DC programming problem

DOI10.1080/02331934.2011.651471zbMath1288.90067OpenAlexW2005769552MaRDI QIDQ5413891

Tamaki Tanaka, Tetsuzo Tanino, Syuuji Yamada

Publication date: 2 May 2014

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2011.651471

zbMATH Keywords

global optimizationbranch and bound procedurecanonical DC programming problem

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Outer approximation method incorporating a quadratic approximation for a DC programming problem
• Convex programs with an additional reverse convex constraint
• Reverse convex programming
• On global optimality conditions and cutting plane algorithms
• Canonical DC programming problem: Outer approximation methods revisited
• A modified version of Tuy's method for solving d.c. programing problem
• Complementary Geometric Programming
• Iterative Solution of Nonlinear Optimal Control Problems

This page was built for publication: Successive search methods for solving a canonical DC programming problem