Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization

DOI10.1007/BF00939768zbMath0621.90064MaRDI QIDQ1090607

Reiner Horst

Publication date: 1988

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

zbMATH Keywords

global optimizationconcave minimizationnonconvex programmingbranch-and-boundconvex and reverse convex constraintsDC- programmingLipschitzian inequalities

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Numerical methods based on nonlinear programming (49M37)

Related Items

Algorithmic differentiation techniques for global optimization in the COCONUT environment, Branch-and-bound decomposition approach for solving quasiconvex-concave programs, Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities, The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities, Deletion-by-infeasibility rule for DC-constrained global optimization, On consistency of bounding operations in deterministic global optimization, On solving general reverse convex programming problems by a sequence of linear programs and line searches, Utility function programs and optimization over the efficient set in multiple-objective decision making, Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems, New LP bound in multivariate Lipschitz optimization: Theory and applications, Linearization method for a class of multiplicative programming with exponent, Global optimization of generalized linear fractional programming with nonlinear constraints, Intersection Disjunctions for Reverse Convex Sets, Convex and concave relaxations of implicit functions, A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities, A global optimization using linear relaxation for generalized geometric programming, Exact penalty and error bounds in DC programming, Global optimization of bounded factorable functions with discontinuities, A global optimization algorithm for signomial geometric programming problem, Global optimization of signomial geometric programming using linear relaxation., Branch-and-lift algorithm for deterministic global optimization in nonlinear optimal control, Multidimensional bisection applied to global optimisation, DC programming: overview., Method for minimizing a convex-concave function over a convex set, An all-linear programming relaxation algorithm for optimizing over the efficient set, Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results, An analytical approach to global optimization, Mathematical programs with a two-dimensional reverse convex constraint, On solving a d.c. programming problem by a sequence of linear programs, On nonconvex optimization problems with separated nonconvex variables, Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems, An application of Lipschitzian global optimization to product design, An algorithm for solving convex programs with an additional convex- concave constraint, Accelerating method of global optimization for signomial geometric programming, Linearization method of global optimization for generalized geometric programming, Global solution of semi-infinite programs, A note on adapting methods for continuous global optimization to the discrete case, Separable concave minimization via partial outer approximation and branch and bound, On convergence of "divide the best" global optimization algorithms, A global optimization algorithm using linear relaxation, The impact of accelerating tools on the interval subdivision algorithm for global optimization, Global solution of bilevel programs with a nonconvex inner program, Global optimization for sum of linear ratios problem using new pruning technique, A decomposition method for MINLPs with Lipschitz continuous nonlinearities, Interval method for bounding level sets: Revisited and tested with global optimization problems, Concave minimization via conical partitions and polyhedral outer approximation, A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the global minimization of concave functions
• Axiomatic characterization of a global optimization algorithm and investigation of its search strategy
• Extended univariate algorithms for \(n\)-dimensional global optimization
• A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
• The cubic algorithm
• On the convergence of global methods in multiextremal optimization
• Constrained global optimization: algorithms and applications
• Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
• Convergence of a Tuy-type algorithm for concave minimization subject to linear inequality constraints
• On the convergence of two branch-and-bound algorithms for nonconvex programming problems
• Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
• Jointly Constrained Biconvex Programming
• A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
• A finite algorithm for concave minimization over a polyhedron
• Globally convergent methods for n-dimensional multiextremal optimization
• An algorithm for finding the global maximum of a multimodal, multivariate function
• Methods for Global Concave Minimization: A Bibliographic Survey
• A class of exhaustive cone splitting procedures in conical algorithms for concave minmization
• A note on the convergence of an algorithm for nonconvex programming problems
• Convergent Algorithms for Minimizing a Concave Function
• Global Maximization of a Convex Function with Linear Inequality Constraints
• An algorithm for nonconvex programming problems
• An algorithm for finding the absolute extremum of a function
• Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
• An Algorithm for Separable Nonconvex Programming Problems
• Convex Analysis
• An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints
• A Sequential Method Seeking the Global Maximum of a Function