A deterministic approach to global box-constrained optimization
From MaRDI portal
Publication:1947630
DOI10.1007/s11590-012-0452-1zbMath1269.90082OpenAlexW2044911264MaRDI QIDQ1947630
Yuri G. Evtushenko, Mikhail A. Posypkin
Publication date: 23 April 2013
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-012-0452-1
branch-and-bound methoddeterministic optimizationbox-constrained optimizationLipschitzian optimization
Related Items
Adaptive global optimization based on a block-recursive dimensionality reduction scheme, A Search Algorithm for the Global Extremum of a Discontinuous Function, Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints, Piecewise linear bounding functions in univariate global optimization, A deterministic algorithm for global multi-objective optimization, Metaheuristic vs. deterministic global optimization algorithms: the univariate case, Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes, Parallel global optimization algorithm with uniform convergence for solving a set of constrained global optimization problems, Acceleration of Global Search by Implementing Dual Estimates for Lipschitz Constant, A one-step worst-case optimal algorithm for bi-objective univariate optimization, Application of optimization methods for finding equilibrium states of two-dimensional crystals, Globally-biased disimpl algorithm for expensive global optimization, Solving a set of global optimization problems by the parallel technique with uniform convergence, GOSH: derivative-free global optimization using multi-dimensional space-filling curves, MSO: a framework for bound-constrained black-box global optimization algorithms, Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties, Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants, Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints, On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global one-dimensional optimization using smooth auxiliary functions
- Lipschitzian optimization without the Lipschitz constant
- Rigorous global search: continuous problems
- A global optimization algorithm for multivariate functions with Lipschitzian first derivatives
- Introductory lectures on convex optimization. A basic course.
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Recent developments and trends in global optimization
- A polyhedral branch-and-cut approach to global optimization
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- An algorithm for finding the absolute extremum of a function
- A Sequential Method Seeking the Global Maximum of a Function
- Numerical methods for finding global extrema (Case of a non-uniform mesh)
