Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
From MaRDI portal
Publication:3040932
DOI10.1287/moor.8.2.215zbMath0526.90072OpenAlexW2108796912MaRDI QIDQ3040932
Publication date: 1983
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.8.2.215
Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55)
Related Items
Calculating a minimal sphere containing a polytope defined by a system of linear inequalities, A weighting method for 0-1 indefinite quadratic bilevel programming, A finite concave minimization algorithm using branch and bound and neighbor generation, A generalization of the construction of test problems for nonconvex optimization, Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization, Using convex envelopes to solve the interactive fixed-charge linear programming problem, 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, A parallel algorithm for constrained concave quadratic global minimization, Maximizing strictly convex quadratic functions with bounded perturbations, LP-form inclusion functions for global optimization, Convergence qualification of adaptive partition algorithms in global optimization, Minimization of a quasi-concave function over an efficient set, Calculation of bounds on variables satisfying nonlinear inequality constraints, Linear multiplicative programming, A continuous approch for globally solving linearly constrained quadratic, Construction of large-scale global minimum concave quadratic test problems, Minimum concave-cost network flow problems: Applications, complexity, and algorithms, On the nonlinear multilevel programming problems, Construction of test problems for concave minimization under linear and nonlinear constraints, The filled function transformations for constrained global optimization, A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem, Computational experience using an edge search algorithm for linear reverse convex programs, Sufficient optimality criterion for linearly constrained, separable concave minimization problems, Global minimum test problem construction, On the global minimization of concave functions, A new technique for generating quadratic programming test problems, Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications
