On the global minimization of concave functions
From MaRDI portal
Publication:800693
DOI10.1007/BF01720068zbMATH Open0551.65043OpenAlexW180275413MaRDI QIDQ800693FDOQ800693
Publication date: 1984
Published in: OR Spektrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01720068
Recommendations
- scientific article; zbMATH DE number 757675
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
- A branch and bound-outer approximation algorithm for concave minimization over a convex set
- scientific article
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
global minimumcutting planesbranch-and-boundconcave minimizationconcave functiondecision modelsconvex underestimation
Cites Work
- Convex Analysis
- The Cutting-Plane Method for Solving Convex Programs
- An Algorithm for Separable Nonconvex Programming Problems
- Jointly Constrained Biconvex Programming
- Convergent Algorithms for Minimizing a Concave Function
- An algorithm for nonconvex programming problems
- Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
- Maximization of A convex quadratic function under linear constraints
- Title not available (Why is that?)
- A cutting plane algorithm for solving bilinear programs
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- The Supporting Hyperplane Method for Unimodal Programming
- Title not available (Why is that?)
- A Successive Underestimation Method for Concave Minimization Problems
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
- Quasi-concave minimization subject to linear constraints
- Bilinear programming: An exact algorithm
- Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
- A method for globally minimizing concave functions over convex sets
- Variations on a cutting plane method for solving concave minimization problems with linear constraints
- Concave Programming Applied to a Special Class of 0-1 Integer Programs
- A Deterministic Multiproduct, Multi-Facility Production and Inventory Model
- Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
- A note on the convergence of an algorithm for nonconvex programming problems
- Convergence of a Tuy-type algorithm for concave minimization subject to linear inequality constraints
- Global Maximization of a Convex Function with Linear Inequality Constraints
- Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
- Relationship between bilinear programming and concave minimization under linear constraints
- On outer approximation methods for solving concave minimization problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron
- The Indefinite Quadratic Programming Problem
- Concave minimization over a convex polyhedron
- On the convexification of nonlinear programming problems: An applications-oriented survey
Cited In (43)
- On optimization properties of functions, with a concave minorant
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linearly constrained global minimization of functions with concave minorants
- Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems
- Average shadow prices in mathematical programming
- A hybrid method for quantum global optimization
- Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
- Applications of Toland's duality theory to nonconvex optimization problems
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications
- Convergence qualification of adaptive partition algorithms in global optimization
- Title not available (Why is that?)
- A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
- 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 on convex sets
- Normal conical algorithm for concave minimization over polytopes
- Calculation of bounds on variables satisfying nonlinear inequality constraints
- An algorithm for maximizing a convex function over a simple set
- Approximate global minimization of nonconvex functions that are close to convex
- Concave minimization via conical partitions and polyhedral outer approximation
- Global optimization conditions for certain nonconvex minimization problems
- Global minimization of a generalized convex multiplicative function
- Global minimization of a concave function subject to mixed linear and reverse convex constraints
- On the global minimization of increasing positively homogeneous functions over the unit simplex
- Globally minimizing the sum of a convex-concave fraction and a convex function based on wave-curve bounds
- Title not available (Why is that?)
- On the duality of a non-convex optimization problem and the strong unicity constant in linear Chebyshev approximation
- Title not available (Why is that?)
- A branch and bound-outer approximation algorithm for concave minimization over a convex set
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
- An outer approximation method for globally minimizing a concave function over a compact convex set
- Methods for solving multi-extremal problems (global search)
- A finite concave minimization algorithm using branch and bound and neighbor generation
- Enumerative techniques for solving some nonconvex global optimization problems
- On solving general reverse convex programming problems by a sequence of linear programs and line searches
- Inscribed ball and enclosing box methods for the convex maximization problem
- Separable concave minimization via partial outer approximation and branch and bound
- Methods for Global Concave Minimization: A Bibliographic Survey
This page was built for publication: On the global minimization of concave functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800693)
