An inner approximation method incorporating with a penalty function method for a reverse convex programming problem

DOI10.1016/S0377-0427(02)00418-1zbMath1007.65043OpenAlexW2012053324MaRDI QIDQ697546

Syuuji Yamada, Tetsuzo Tanino, Masahiro Inuiguchi

Publication date: 17 September 2002

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-0427(02)00418-1

zbMATH Keywords

global optimizationdual problemglobal convergencenumerical examplesinner approximation methodpenalty function methodreverse convex programming problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Cites Work

• Unnamed Item
• Unnamed Item
• Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications
• Handbook of global optimization
• Optimization on low rank nonconvex structures
• Convex analysis and global optimization
• Inner approximation method for a reverse convex programming problem

This page was built for publication: An inner approximation method incorporating with a penalty function method for a reverse convex programming problem