A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization

DOI10.1007/BF00939825zbMath0581.90073OpenAlexW4251867147MaRDI QIDQ1067978

Reiner Horst

Publication date: 1986

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00939825

zbMATH Keywords

global optimizationconcave minimizationnonconvex programmingbranch-and-boundsufficient and necessary convergence condition

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items

Variations and extension of the convex-concave procedure, On the convergence of global methods in multiextremal optimization, Algorithmic differentiation techniques for global optimization in the COCONUT environment, A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron, Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization, A relaxation method for nonconvex quadratically constrained quadratic programs, Deletion-by-infeasibility rule for DC-constrained global optimization, A peak-over-threshold search method for global optimization, On solving general reverse convex programming problems by a sequence of linear programs and line searches, Global optimization of a quadratic function subject to a bounded mixed integer constraint set, 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, A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions, A generalized karush-kuhn-tucki optimality condition without constraint qualification using tl approximate subdifferential, Formulation assistance for global optimization problems, Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems, Convex and concave relaxations of implicit functions, On the convergence of adaptive partition algorithms in global optimization, Reducing transformation and global optimization, A hybrid approach for index tracking with practical constraints, Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure, Globally optimized calibration of environmental models, An all-linear programming relaxation algorithm for optimizing over the efficient set, Global optimization of generalized semi-infinite programs via restriction of the right hand side, An analytical approach to global optimization, Optimization methods for mixed integer weakly concave programming problems, When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation, Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming, On solving a d.c. programming problem by a sequence of linear programs, A new simplicial cover technique in constrained global optimization, A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique, GBSSS: The generalized big square small square method for planar single- facility location, Convergence qualification of adaptive partition algorithms in global optimization, Global optimization of univariate Lipschitz functions. I: Survey and properties, An application of Lipschitzian global optimization to product design, A new reformulation-linearization technique for bilinear programming problems, On the global optimization properties of finite-difference local descent algorithms, Global solution of semi-infinite programs, A note on adapting methods for continuous global optimization to the discrete case, An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes, Separable concave minimization via partial outer approximation and branch and bound, A branch and bound-outer approximation algorithm for concave minimization over a convex set, Mean–variance portfolio optimization with parameter sensitivity control^†, Experiments with new stochastic global optimization search techniques, A two phase local global search algorithm using new global search strategy, 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, A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set, Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems, Active allocation of systematic risk and control of risk sensitivity in portfolio optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the global minimization of concave functions
• On the convergence of two branch-and-bound algorithms for nonconvex programming problems
• Supports and convex envelopes
• A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
• A note on the convergence of an algorithm for nonconvex programming problems
• Convergent Algorithms for Minimizing a Concave Function
• An algorithm for nonconvex programming problems
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Global stability of optimization problems
• An Algorithm for Separable Nonconvex Programming Problems
• Lagrange Multipliers and Nonconvex Programs
• Convex Analysis
• An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints