An outer approximation method for globally minimizing a concave function over a compact convex set
From MaRDI portal
Publication:1057182
zbMath0562.90069MaRDI QIDQ1057182
Vu Thien Ban, Tran Vu Thieu, Bui The Tam
Publication date: 1983
Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)
Related Items
Deterministic methods in constrained global optimization: Some recent advances and new fields of application, 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, Outer approximation method incorporating a quadratic approximation for a DC programming 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, A decomposition method for the min concave cost flow problem with a staircase structure, On the global minimization of a convex function under general nonconvex constraints, A finite method for globally minimizing a concave function over an unbounded polyhedral convex set and its applications, Dual approach to minimization on the set of Pareto-optimal solutions, Canonical DC programming problem: Outer approximation methods revisited, Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems, Global optimization under Lipschitzian constraints, Parametric approach to a class of nonconvex global optimization problems, On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope, On-line and off-line vertex enumeration by adjacency lists, On solving a d.c. programming problem by a sequence of linear programs, A new simplicial cover technique in constrained global optimization, An outer approximation method for minimizing the product of several convex functions on a convex set, Level function method for quasiconvex programming., Finite method of minimizing a concave function under linear constraints and applications, Separable concave minimization via partial outer approximation and branch and bound, A branch and bound-outer approximation algorithm for concave minimization over a convex set, A new algorithm to find all vertices of a polytope, Convex minimization under Lipschitz constraints, Concave minimization via conical partitions and polyhedral outer approximation, Convex programs with an additional reverse convex constraint
