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

Cited in

(29)

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