Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain

DOI10.1287/MOOR.8.2.215MaRDI QIDQ3040932zbMATH OpenOpenAlexFDO

Authors J. B. Rosen

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

zbMATH Keywords

global minimumlinear inequality constraintspolyhedronsmooth concave functionsolution algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55)

Cited in

(29)

• 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
• 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
• LP-form inclusion functions for global optimization
• Convergence qualification of adaptive partition algorithms in global optimization
• Calculation of bounds on variables satisfying nonlinear inequality constraints
• Linear multiplicative programming
• Construction of test problems for concave minimization under linear and nonlinear constraints
• A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem
• A new technique for generating quadratic programming test problems
• Calculating a minimal sphere containing a polytope defined by a system of linear inequalities
• A finite concave minimization algorithm using branch and bound and neighbor generation
• A generalization of the construction of test problems for nonconvex optimization
• Construction of large-scale global minimum concave quadratic test problems
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• A weighting method for 0-1 indefinite quadratic bilevel programming
• Computational experience using an edge search algorithm for linear reverse convex programs
• Sufficient optimality criterion for linearly constrained, separable concave minimization problems
• A decomposition approach for global optimum search in QP, NLP and MINLP problems
• A continuous approch for globally solving linearly constrained quadratic
• Global minimization of large-scale constrained concave quadratic problems by separable programming
• Global minimum test problem construction
• Maximizing strictly convex quadratic functions with bounded perturbations
• Minimization of a quasi-concave function over an efficient set
• The filled function transformations for constrained global optimization
• On the global minimization of concave functions
• Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications
• On the nonlinear multilevel programming problems

This page was built for publication: Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3040932)