Deterministic global optimization. Theory, methods and applications
From MaRDI portal
Publication:1962863
branch-and-bound algorithmrobust stabilitygeneralized geometric programmingchemical engineering design
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Recommendations
- Deterministic global optimization. An introduction to the diagonal approach
- scientific article; zbMATH DE number 1101649
- Deterministic global optimization. Geometric branch-and-bound methods and their applications
- Introduction to global optimization.
- Global optimization. Theory, algorithms, and applications
Cited in
(96)- Challenges in Enterprise Wide Optimization for the Process Industries
- A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem
- Geometric conditions for Kuhn-Tucker sufficiency of global optimality in mathematical programming
- Parallel Global Optimization in Multidimensional Scaling
- GLOMIQO: global mixed-integer quadratic optimizer
- Numerical solution for bounding feasible point sets
- An efficient convexification method for solving generalized geometric problems
- A hybrid global optimization method: The multi-dimensional case
- An effective linear approximation method for separable programming problems
- How to solve a semi-infinite optimization problem
- Linear interval parametric approach to testing pseudoconvexity
- Optimal design and operation of a wastewater purification system
- Deterministic global optimization. An introduction to the diagonal approach
- Minotaur: a mixed-integer nonlinear optimization toolkit
- A note on a deterministic global optimization algorithm
- Convex underestimators of polynomials
- A leader-follower game in competitive facility location
- On convergence rate of a rectangular partition based global optimization algorithm
- DEFT-FUNNEL: an open-source global optimization solver for constrained grey-box and black-box problems
- Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains
- A modification of the \(\alpha \mathrm{BB}\) method for box-constrained optimization and an application to inverse kinematics
- An extension of the \(\alpha\mathrm{BB}\)-type underestimation to linear parametric Hessian matrices
- Gradient-type methods: a unified perspective in computer science and numerical analysis
- Global optimization. Theory, algorithms, and applications
- GMG -- a guaranteed global optimization algorithm: application to remote sensing
- A framework for globally optimizing mixed-integer signomial programs
- Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems
- A multi-parametric programming approach for multilevel hierarchical and decentralised optimisation problems
- On box constrained concave quadratic optimization
- Solution to global minimization of polynomials by backward differential flow
- Inversion of convection-diffusion equation with discrete sources
- Deterministic global optimization. Geometric branch-and-bound methods and their applications
- On the global solution of multi-parametric mixed integer linear programming problems
- An evolutionary method for complex-process optimization
- Linear scaling and the DIRECT algorithm
- A new class of hybrid global optimization algorithms for peptide structure prediction: integrated hybrids
- Model development and optimization for space engineering: concepts, tools, applications, and perspectives
- An optimal algorithm for global optimization and adaptive covering
- Foundations of computational intelligence. Volume 3: Global optimization
- Testing pseudoconvexity via interval computation
- Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution
- A deterministic global optimization algorithm
- An intelligent genetic algorithm designed for global optimization of multi-minima functions
- Solving semi-infinite programs by smoothing projected gradient method
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
- A bilevel fixed charge location model for facilities under imminent attack
- Approximate global minimizers to pairwise interaction problems via convex relaxation
- Piecewise synergetic systems and applications in biochemical systems theory
- scientific article; zbMATH DE number 778142 (Why is no real title available?)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Introduction to global optimization.
- Deterministic global optimization using interval constraint propagation techniques
- Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems
- 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
- scientific article; zbMATH DE number 2068059 (Why is no real title available?)
- Canonical duality for box constrained nonconvex and nonsmooth optimization problems
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- On generalized geometric programming problems with non-positive variables
- A computational study of global optimization solvers on two trust region subproblems
- An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems
- Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations
- Global optimization of signomial geometric programming problems
- Challenges of continuous global optimization in molecular structure prediction
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- A hybrid global optimization method: The one-dimensional case
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems
- A branch-and-bound algorithm for nonconvex Nash equilibrium problems
- Integrated multi-site aggregate production-pricing planning in a two-echelon supply chain with multiple demand classes
- Subdomain separability in global optimization
- Modified DIRECT Algorithm for Scaled Global Optimization Problems
- scientific article; zbMATH DE number 6311514 (Why is no real title available?)
- An algorithm for bounded-error identification of nonlinear systems based on DC functions
- Towards global parameter estimation exploiting reduced data sets
- Efficient Convexification Strategy for Generalized Geometric Programming Problems
- Finding all global optima of engineering design problems with discrete signomial terms
- A geometric branch and bound method for robust maximization of convex functions
- A new algorithm for Chebyshev minimum-error multiplication of reduced affine forms
- Competitive facility location problem with attractiveness adjustment of the follower on the closed supply chain
- Global optimization-based dimer method for finding saddle points
- Convexification method for bilevel programs with a nonconvex Follower's problem
- A branch-and-bound algorithm with growing datasets for large-scale parameter estimation
- Optimising portfolio diversification and dimensionality
- A hybrid of Bayesian approach based global search with clustering aided local refinement
- A Partition Based Bayesian Multi-objective Optimization Algorithm
- Performance of convex underestimators in a branch-and-bound framework
- Multicomposite nonconvex optimization for training deep neural networks
- Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms
- Optimization of the optimal value function in problems of convex parametric programming
- Global optimality conditions and duality theorems for robust optimal solutions of optimization problems with data uncertainty, using underestimators
- Overcoming the key challenges in de novo protein design: enhancing computational efficiency and incorporating true backbone flexibility
- Parametric functional representation of interval number with arithmetic operations
- Constrained abductive reasoning with fuzzy parameters in Bayesian networks
- Book review of: Y. D. Sergeyev and D. E. Kvasov, Deterministic global optimization. An introduction to the diagonal approach
- Stationary probability density of stochastic search processes in global optimization
This page was built for publication: Deterministic global optimization. Theory, methods and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962863)
