Deterministic global optimization. Theory, methods and applications
From MaRDI portal
Publication:1962863
zbMath1037.90002MaRDI QIDQ1962863
Publication date: 18 January 2000
Published in: Nonconvex Optimization and Its Applications (Search for Journal in Brave)
branch-and-bound algorithmrobust stabilitygeneralized geometric programmingchemical engineering design
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
An efficient convexification method for solving generalized geometric problems, Minotaur: a mixed-integer nonlinear optimization toolkit, Inversion of convection-diffusion equation with discrete sources, A modification of the \(\alpha \mathrm{BB}\) method for box-constrained optimization and an application to inverse kinematics, Constrained abductive reasoning with fuzzy parameters in Bayesian networks, Global optimization of signomial geometric programming problems, A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem, Finding all global optima of engineering design problems with discrete signomial terms, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems, On generalized geometric programming problems with non-positive variables, Linear scaling and the DIRECT algorithm, Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms, Canonical duality for box constrained nonconvex and nonsmooth optimization problems, GLOMIQO: global mixed-integer quadratic optimizer, On the global solution of multi-parametric mixed integer linear programming problems, An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems, Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains, A computational study of global optimization solvers on two trust region subproblems, Challenges of continuous global optimization in molecular structure prediction, Modified DIRECT Algorithm for Scaled Global Optimization Problems, On box constrained concave quadratic optimization, Solution to global minimization of polynomials by backward differential flow, A framework for globally optimizing mixed-integer signomial programs, Towards global parameter estimation exploiting reduced data sets, Optimising portfolio diversification and dimensionality, A new algorithm for Chebyshev minimum-error multiplication of reduced affine forms, Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution, Numerical solution for bounding feasible point sets, Gradient-type methods: a unified perspective in computer science and numerical analysis, Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems, Subdomain separability in global optimization, MultiComposite Nonconvex Optimization for Training Deep Neural Networks, Optimization of the optimal value function in problems of convex parametric programming, Overcoming the Key Challenges in De Novo Protein Design: Enhancing Computational Efficiency and Incorporating True Backbone Flexibility, Approximate Global Minimizers to Pairwise Interaction Problems via Convex Relaxation, A hybrid of Bayesian approach based global search with clustering aided local refinement, A Partition Based Bayesian Multi-objective Optimization Algorithm, Convex underestimators of polynomials, An algorithm for bounded-error identification of nonlinear systems based on DC functions, Efficient Convexification Strategy for Generalized Geometric Programming Problems, Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development, Solving semi-infinite programs by smoothing projected gradient method, Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques, Some feasibility sampling procedures in interval methods for constrained global optimization, DEFT-FUNNEL: an open-source global optimization solver for constrained grey-box and black-box problems, Piecewise synergetic systems and applications in biochemical systems theory, Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, On convergence rate of a rectangular partition based global optimization algorithm, Optimal design and operation of a wastewater purification system, How to solve a semi-infinite optimization problem, A leader-follower game in competitive facility location, A bilevel fixed charge location model for facilities under imminent attack, Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems, A new class of hybrid global optimization algorithms for peptide structure prediction: integrated hybrids, Linear interval parametric approach to testing pseudoconvexity, Global optimization-based dimer method for finding saddle points, Testing pseudoconvexity via interval computation, Parametric functional representation of interval number with arithmetic operations, An intelligent genetic algorithm designed for global optimization of multi-minima functions, Convexification method for bilevel programs with a nonconvex Follower's problem, An optimal algorithm for global optimization and adaptive covering, Parallel Global Optimization in Multidimensional Scaling, Performance of convex underestimators in a branch-and-bound framework, An extension of the \(\alpha\mathrm{BB}\)-type underestimation to linear parametric Hessian matrices, An evolutionary method for complex-process optimization, Geometric conditions for Kuhn-Tucker sufficiency of global optimality in mathematical programming, Integrated multi-site aggregate production-pricing planning in a two-echelon supply chain with multiple demand classes, Competitive facility location problem with attractiveness adjustment of the follower on the closed supply chain, A geometric branch and bound method for robust maximization of convex functions, A hybrid global optimization method: The multi-dimensional case, Challenges in Enterprise Wide Optimization for the Process Industries, GMG -- a guaranteed global optimization algorithm: application to remote sensing, A multi-parametric programming approach for multilevel hierarchical and decentralised optimisation problems, An effective linear approximation method for separable programming problems, Global optimality conditions and duality theorems for robust optimal solutions of optimization problems with data uncertainty, using underestimators, Stationary probability density of stochastic search processes in global optimization, A hybrid global optimization method: The one-dimensional case, Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives, Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
