Convergent Algorithms for Minimizing a Concave Function
From MaRDI portal
Publication:3927058
DOI10.1287/moor.5.4.556zbMath0472.90054OpenAlexW1968707428MaRDI QIDQ3927058
Publication date: 1980
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.5.4.556
global optimizationpolytopecutting methodconcave functionbranch and bound techniqueconvergent algorithmsbisection of conesconsistent bound estimation
Related Items
Variations and extension of the convex-concave procedure, A weighting method for 0-1 indefinite quadratic bilevel programming, A branch and bound algorithm for extreme point mathematical programming problems, On the convergence of global methods in multiextremal optimization, A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron, A successive linear approximation algorithm for the global minimization of a concave quadratic program, A generalization of \(\omega \)-subdivision ensuring convergence of the simplicial algorithm, D.c sets, d.c. functions and nonlinear equations, Concave minimization under linear constraints with special structure, Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization, Constraint decomposition algorithms in global optimization, A branch bound method for subset sum problem, Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions, On the structure and properties of a linear multilevel programming problem, On solving general reverse convex programming problems by a sequence of linear programs and line searches, A decomposition approach for global optimum search in QP, NLP and MINLP problems, Global minimization of large-scale constrained concave quadratic problems by separable programming, Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems, Minimizing a quasi-concave function subject to a reverse convex constraint, A finite method for globally minimizing a concave function over an unbounded polyhedral convex set and its applications, On a class of functions attaining their maximum at the vertices of a polyhedron, Decomposition approach for the global minimization of biconcave functions over polytopes, Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems, Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets, A class of exhaustive cone splitting procedures in conical algorithms for concave minmization, On the relation between concavity cuts and the surrogate dual for convex maximization problems, Optimization over equilibrium sets∗, DC programming: overview., Normal conical algorithm for concave minimization over polytopes, Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms, An all-linear programming relaxation algorithm for optimizing over the efficient set, Efficient algorithms for solving rank two and rank three bilinear programming problems, Fuzzy goal programming technique for multi-objective indefinite quadratic bilevel programming problem, Convergence qualification of adaptive partition algorithms in global optimization, Degeneracy removal in cutting plane methods for disjoint bilinear programming, A generalized duality and applications, Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems, On the indefinite quadratic bilevel programming problem., An algorithm for solving convex programs with an additional convex- concave constraint, Duality bound method for the general quadratic programming problem with quadratic constraints, Linear multiplicative programming, A convergent conical algorithm with \(\omega \)-bisection for concave minimization, On the convergence of cone splitting algorithms with \(\omega\)-subdivisions, Global optimization method for solving mathematical programs with linear complementarity constraints, Minimum concave-cost network flow problems: Applications, complexity, and algorithms, Separable concave minimization via partial outer approximation and branch and bound, On the nonlinear multilevel programming problems, Unnamed Item, Minimizing Piecewise-Concave Functions Over Polyhedra, A branch and bound-outer approximation algorithm for concave minimization over a convex set, Convex minimization under Lipschitz constraints, Convergence of a subgradient method for computing the bound norm of matrices, On the global minimization of concave functions, A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization, 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, A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set, Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems
