On outer approximation methods for solving concave minimization problems
From MaRDI portal
Publication:1063521
zbMath0574.90074MaRDI QIDQ1063521
Publication date: 1983
Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)
global optimizationconcave functionouter approximation methodspolyhedral convex setunbounded constraint set
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items
Variations and extension of the convex-concave procedure, A Benson-type algorithm for bounded convex vector optimization problems with vertex selection, D.c sets, d.c. functions and nonlinear equations, Concave minimization under linear constraints with special structure, A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem, A note on the solution of bilinear programming problems by reduction to concave minimization, On finding new vertices and redundant constraints in cutting plane algorithms for global optimization, Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems, The design centering problem as a d.c. programming problem, On the global minimization of a convex function under general nonconvex constraints, Dual approach to minimization on the set of Pareto-optimal solutions, Canonical DC programming problem: Outer approximation methods revisited, Global optimization under Lipschitzian constraints, A modified version of Tuy's method for solving d.c. programing problem, Mathematical programs with a two-dimensional reverse convex constraint, On solving a d.c. programming problem by a sequence of linear programs, Level function method for quasiconvex programming., Separable concave minimization via partial outer approximation and branch and bound, Convex minimization under Lipschitz constraints, On the global minimization of concave functions, Convex programs with an additional reverse convex constraint, Primal-relaxed dual global optimization approach
