The cubic algorithm
From MaRDI portal
Publication:1073547
DOI10.1016/0022-247X(85)90268-9zbMath0588.65042OpenAlexW2022072257MaRDI QIDQ1073547
Publication date: 1985
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-247x(85)90268-9
Related Items
On the convergence of global methods in multiextremal optimization, Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization, Precision, complexity, and computational schemes of the cubic algorithms, Two alternatives for the cubic algorithm, The Beta-algorithm, The integer cubic algorithm, An implicit enumeration method for global optimization problems, 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, Implementation of Cartesian grids to accelerate Delaunay-based derivative-free optimization, Global optimization method with numerically calculated function derivatives, Global optimization in problems with uncertainties: the gamma algorithm., Integral global optimization method for differential games with application to pursuit-evasion games, When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation, Unconstrained and constrained global optimization of polynomial functions in one variable, Non-causal models in long term planning via set contractive optimal control methods, Global optimization of univariate Lipschitz functions. I: Survey and properties, Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison, Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms, Set contraction algorithm for computing Pareto set in nonconvex nonsmooth multiobjective optimization, Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms, Global optimization to prescribed accuracy, The alpha algorithm and the application of the cubic algorithm in case of unknown Lipschitz constant, Problem-method classification in optimization and control, Global one-dimensional optimization using smooth auxiliary functions, The cubic algorithm for global games with application to pursuit-evasion games, Multidimensional global optimization using numerical estimates of objective function derivatives, Integral global optimization method for nonlinear games, Lipschitzian optimization without the Lipschitz constant, An approach for simultaneous finding of multiple efficient decisions in multi-objective optimization problems
Cites Work
