scientific article; zbMATH DE number 5989987

MaRDI QIDQ3104296zbMATH OpenFDO

Authors Tamaki Tanaka, Syuuji Yamada, Tetsuzo Tanino

Publication date 19 December 2011

zbMATH Keywords

canonical d.c. programming problemdescent methodouter approximation methodreverse convex constraint

Mathematics Subject Classification ID

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

Recommendations

• GLOBAL OPTIMIZATION PROBLEM WITH MULTIPLE REVERSE CONVEX CONSTRAINTS AND ITS APPLICATION TO OUT-OF-ROUNDNESS PROBLEM
• On outer approximation methods for solving concave minimization problems
• Extended reverse-convex programming: an approximate enumeration approach to global optimization
• On an outer approximation concept in global optimization
• Inner approximation method for a reverse convex programming problem
• An outer approximation method for globally minimizing a concave function over a compact convex set
• Global optimization for special reverse convex programming
• On convergence of a global search strategy for reverse convex problems
• Methods for solving some classes of reverse convex programs
• A method for solving reverse convex programming problems

Cited in

(6)

• scientific article; zbMATH DE number 4051358 (Why is no real title available?)
• On an outer approximation concept in global optimization
• scientific article; zbMATH DE number 124014 (Why is no real title available?)
• GLOBAL OPTIMIZATION PROBLEM WITH MULTIPLE REVERSE CONVEX CONSTRAINTS AND ITS APPLICATION TO OUT-OF-ROUNDNESS PROBLEM
• scientific article; zbMATH DE number 2159418 (Why is no real title available?)
• Inner approximation method for a reverse convex programming problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3104296)