A method for globally minimizing concave functions over convex sets

DOI10.1007/BF01589330zbMath0441.90096MaRDI QIDQ3883930

Publication date: 1981

Published in: Mathematical Programming (Search for Journal in Brave)

global optimization convex envelope global minimization concave programming nonlinear constraints computational aspects extreme point solutions concave functions over convex sets non- convex programming simplex pivot operations univariate search computations

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items

Least trimmed squares regression, least median squares regression, and mathematical program\-ming, D.c sets, d.c. functions and nonlinear equations, The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation, Global optimization conditions for certain nonconvex minimization problems, Outer approximation by polyhedral convex sets, On solving general reverse convex programming problems by a sequence of linear programs and line searches, Capacity planning in networks of queues with manufacturing applications, On finding new vertices and redundant constraints in cutting plane algorithms for global optimization, Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems, Nonconvex optimization over a polytope using generalized capacity improvement, Minimizing a quasi-concave function subject to a reverse convex constraint, A decomposition method for the min concave cost flow problem with a staircase structure, On the global minimization of a convex function under general nonconvex constraints, Canonical DC programming problem: Outer approximation methods revisited, Fast Gaussian kernel learning for classification tasks based on specially structured global optimization, Semi-discrete optimal transport: hardness, regularization and numerical solution, On global optimality conditions and cutting plane algorithms, On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope, A class of convexification and concavification methods for non-monotone optimization problems, A filled function method for constrained global optimization, On-line and off-line vertex enumeration by adjacency lists, Input Efficiency Measures: A Generalized, Encompassing Formulation, A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure, On solving a d.c. programming problem by a sequence of linear programs, A new simplicial cover technique in constrained global optimization, On the duality of a non-convex optimization problem and the strong unicity constant in linear Chebyshev approximation, Convergence qualification of adaptive partition algorithms in global optimization, On an outer approximation concept in global optimization, A global optimization approach for solving the convex multiplicative programming problem, Level function method for quasiconvex programming., Calculation of bounds on variables satisfying nonlinear inequality constraints, Convexification and concavification for a general class of global optimization problems, An exact solution method for reliability optimization in complex systems, A branch-and-bound based method for solving monotone optimization problems, A note on adapting methods for continuous global optimization to the discrete case, Separable concave minimization via partial outer approximation and branch and bound, Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints, Minimizing Piecewise-Concave Functions Over Polyhedra, On a Markov Decision Process problem involving the Maximum of the Difference between two functions: Technical Note, A branch and bound-outer approximation algorithm for concave minimization over a convex set, Convex minimization under Lipschitz constraints, A NOVEL MONOTONIZATION TRANSFORMATION FOR SOME CLASSES OF GLOBAL OPTIMIZATION PROBLEMS, Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints, Sufficient optimality criterion for linearly constrained, separable concave minimization problems, 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, Concave minimization via conical partitions and polyhedral outer approximation, Convex programs with an additional reverse convex constraint

Cites Work