On the global minimization of concave functions
From MaRDI portal
Publication:800693
DOI10.1007/BF01720068zbMath0551.65043OpenAlexW180275413MaRDI QIDQ800693
Publication date: 1984
Published in: OR Spektrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01720068
concave minimizationbranch-and-boundglobal minimumcutting planesconcave functiondecision modelsconvex underestimation
Related Items
A finite concave minimization algorithm using branch and bound and neighbor generation, Global optimization on convex sets, Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization, Global optimization conditions for certain nonconvex minimization problems, Applications of Toland's duality theory to nonconvex optimization problems, On solving general reverse convex programming problems by a sequence of linear programs and line searches, Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems, An algorithm for maximizing a convex function over a simple set, Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems, A hybrid method for quantum global optimization, Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure, Normal conical algorithm for concave minimization over polytopes, 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 convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions, Calculation of bounds on variables satisfying nonlinear inequality constraints, Separable concave minimization via partial outer approximation and branch and bound, Inscribed ball and enclosing box methods for the convex maximization problem, Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint, A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization, Global optimization algorithms for linearly constrained indefinite quadratic problems, 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, Average shadow prices in mathematical programming, Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the convexification of nonlinear programming problems: An applications-oriented survey
- On outer approximation methods for solving concave minimization problems
- Convergence of a Tuy-type algorithm for concave minimization subject to linear inequality constraints
- Relationship between bilinear programming and concave minimization under linear constraints
- Quasi-concave minimization subject to linear constraints
- Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
- The Cutting-Plane Method for Solving Convex Programs
- Jointly Constrained Biconvex Programming
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
- A note on the convergence of an algorithm for nonconvex programming problems
- A method for globally minimizing concave functions over convex sets
- Convergent Algorithms for Minimizing a Concave Function
- Global Maximization of a Convex Function with Linear Inequality Constraints
- An algorithm for nonconvex programming problems
- Variations on a cutting plane method for solving concave minimization problems with linear constraints
- A cutting plane algorithm for solving bilinear programs
- Maximization of A convex quadratic function under linear constraints
- A Successive Underestimation Method for Concave Minimization Problems
- A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron
- Bilinear programming: An exact algorithm
- The Indefinite Quadratic Programming Problem
- Concave minimization over a convex polyhedron
- Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
- A Deterministic Multiproduct, Multi-Facility Production and Inventory Model
- The Supporting Hyperplane Method for Unimodal Programming
- An Algorithm for Separable Nonconvex Programming Problems
- Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
- Convex Analysis
- Concave Programming Applied to a Special Class of 0-1 Integer Programs
