An algorithm for finding the absolute extremum of a function
From MaRDI portal
Publication:4768572
DOI10.1016/0041-5553(72)90115-2zbMath0282.65052OpenAlexW2092611373MaRDI QIDQ4768572
Publication date: 1973
Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0041-5553(72)90115-2
Related Items
Global optimization method with numerically calculated function derivatives, Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization, An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework, On the convergence of global methods in multiextremal optimization, Cutting angle method – a tool for constrained global optimization, Adaptive global optimization based on a block-recursive dimensionality reduction scheme, Customizing methods for global optimization -- a geometric viewpoint, An algorithm for global optimization of Lipschitz continuous functions, Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization, Unified frameworks for sampled-data extremum seeking control: global optimisation and multi-unit systems, Finding maximum likelihood estimators for the three-parameter Weibull distribution, On computing the dispersion function, Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions, Univariate global optimization with multiextremal non-differentiable constraints without penalty functions, Adaptive nested optimization scheme for multidimensional global search, New LP bound in multivariate Lipschitz optimization: Theory and applications, Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints, Safe global optimization of expensive noisy black-box functions in the \(\delta \)-Lipschitz framework, Towards pure adaptive search, An algorithm for finding the global maximum of a multimodal, multivariate function, A Deterministic Algorithm for Global Optimization, Constrained, Global Optimization of Unknown Functions with Lipschitz Continuous Gradients, Linearly constrained global minimization of functions with concave minorants, Global optimization of Hölder functions, Challenges of continuous global optimization in molecular structure prediction, An interval maximum entropy method for a discrete minimax problem, A new trisection method for solving Lipschitz bi-objective optimization problems, Metaheuristic vs. deterministic global optimization algorithms: the univariate case, Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes, (Global) optimization: historical notes and recent developments, Constrained multiobjective optimization of expensive black-box functions using a heuristic branch-and-bound approach, On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization, Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives, A deterministic approach to global box-constrained optimization, Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems, On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales, Multidimensional Global Search Using Numerical Estimations of Minimized Function Derivatives and Adaptive Nested Optimization Scheme, On Acceleration of Derivative-Free Univariate Lipschitz Global Optimization Methods, An information global minimization algorithm using the local improvement technique, Topics in Lipschitz global optimisation, Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives, OPTIMAL ADAPTIVE ALGORITHMS FOR FINDING THE NEAREST AND FARTHEST POINT ON A PARAMETRIC BLACK-BOX CURVE, Matrix polynomials with specified eigenvalues, Global optimization: the Alienor mixed method with Piyavskii‐Shubert technique, The Alienor method coupled to the Brent algorithm, A one-step worst-case optimal algorithm for bi-objective univariate optimization, On Timonov's algorithm for global optimization of univariate Lipschitz functions, An analytical approach to global optimization, A one-dimensional local tuning algorithm for solving GO problems with partially defined constraints, Generating $\alpha $-dense curves in non-convex sets to solve a class of non-smooth constrained global optimization, When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation, Convergence rates of a global optimization algorithm, Unconstrained and constrained global optimization of polynomial functions in one variable, Nearly optimal coverings of a sphere with generalized spherical segments, A new global optimization method for univariate constrained twice-differentiable NLP problems, Convergence qualification of adaptive partition algorithms in global optimization, Global optimization of univariate Lipschitz functions. I: Survey and properties, Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison, The bisection method in higher dimensions, Multidimensional bisection: the performance and the context, GOSH: derivative-free global optimization using multi-dimensional space-filling curves, Algorithms for multi-extremal mathematical programming problems employing the set of joint space-filling curves, Optimally adaptive integration of univariate Lipschitz functions, Locating a nearest matrix with an eigenvalue of prespecified algebraic multiplicity, Global non-smooth optimization in robust multivariate regression, Aggregation functions based on penalties, Scheduling of transportation fleet maintenance service by an improved Lipschitz optimization algorithm, Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties, On the extension of the \textsc{direct} algorithm to multiple objectives, The DIRECT algorithm: 25 years later, Interpolation of Lipschitz functions, On tightness and anchoring of McCormick and other relaxations, Optimum departure times for commuters in congested networks, On convergence of "divide the best" global optimization algorithms, A naive multi-scale search algorithm for global optimization problems, Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization, Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}, Lipschitz programming via increasing convex-along-rays functions*, A deterministic algorithm for global optimization, A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints, Steklov regularization and trajectory methods for univariate global optimization, Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces, Interval-majorant method and global optimization, Global optimization requires global information, Combining Bayesian optimization and Lipschitz optimization, Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint, SMGO: a set membership approach to data-driven global optimization, Geometry and combinatorics of the cutting angle method, On some approaches to find Nash equilibrium in concave games, Global one-dimensional optimization using smooth auxiliary functions, A decomposition method for MINLPs with Lipschitz continuous nonlinearities, A branch and bound algorithm for Holder bi-objective optimization. Implementation to multidimensional optimization, New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints, Multidimensional global optimization using numerical estimates of objective function derivatives, Accelerations for a variety of global optimization methods, Accelerations for global optimization covering methods using second derivatives, Learning weights in the generalized OWA operators, On using estimates of Lipschitz constants in global optimization, Primal-relaxed dual global optimization approach, A parallel method for finding the global minimum of univariate functions, An approach for simultaneous finding of multiple efficient decisions in multi-objective optimization problems, Multidimensional global extremum seeking via the DIRECT optimisation algorithm
