A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
From MaRDI portal
Publication:3703662
DOI10.1287/moor.10.3.498zbMath0579.90078OpenAlexW2059690973MaRDI QIDQ3703662
Tran Vu Thieu, Nguyen Quang Thai, Hoang Tuy
Publication date: 1985
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.10.3.498
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items
A finite concave minimization algorithm using branch and bound and neighbor generation ⋮ A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron ⋮ D.c sets, d.c. functions and nonlinear equations ⋮ Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization ⋮ On solving general reverse convex programming problems by a sequence of linear programs and line searches ⋮ A note on the solution of bilinear programming problems by reduction to concave minimization ⋮ Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems ⋮ A finite method for globally minimizing a concave function over an unbounded polyhedral convex set and its applications ⋮ \(\alpha BB\): A global optimization method for general constrained nonconvex problems ⋮ Conically bounded sets and optimization ⋮ Unboundedness in reverse convex and concave integer programming ⋮ A class of exhaustive cone splitting procedures in conical algorithms for concave minmization ⋮ On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope ⋮ Normal conical algorithm for concave minimization over polytopes ⋮ Input Efficiency Measures: A Generalized, Encompassing Formulation ⋮ Successive smoothing algorithm for solving large-scale optimization models with fixed cost ⋮ Efficient algorithms for solving rank two and rank three bilinear programming problems ⋮ On solving a d.c. programming problem by a sequence of linear programs ⋮ A new simplicial cover technique in constrained global optimization ⋮ Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems ⋮ Feasible partition problem in reverse convex and convex mixed-integer programming ⋮ Finite method of minimizing a concave function under linear constraints and applications ⋮ A note on adapting methods for continuous global optimization to the discrete case ⋮ 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 ⋮ Convex minimization under Lipschitz constraints ⋮ Sufficient optimality criterion for linearly constrained, separable concave minimization problems ⋮ New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints ⋮ Solution of a non-linear programming problem with quadratic functions ⋮ A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization ⋮ Note on solving linear complementarity problems as jointly constrained bilinear programs ⋮ Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications ⋮ Concave minimization via conical partitions and polyhedral outer approximation ⋮ Convex programs with an additional reverse convex constraint ⋮ Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems ⋮ Primal-relaxed dual global optimization approach
