The following pages link to The cubic algorithm (Q1073547):
Displaying 29 items.
- Set contraction algorithm for computing Pareto set in nonconvex nonsmooth multiobjective optimization (Q557143) (← links)
- Problem-method classification in optimization and control (Q751518) (← links)
- Integral global optimization method for nonlinear games (Q805506) (← links)
- Integral global optimization method for differential games with application to pursuit-evasion games (Q913680) (← links)
- On the convergence of global methods in multiextremal optimization (Q1078082) (← links)
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization (Q1090607) (← links)
- Precision, complexity, and computational schemes of the cubic algorithms (Q1090611) (← links)
- Two alternatives for the cubic algorithm (Q1095036) (← links)
- The Beta-algorithm (Q1101014) (← links)
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems (Q1106728) (← links)
- Unconstrained and constrained global optimization of polynomial functions in one variable (Q1187372) (← links)
- Global optimization of univariate Lipschitz functions. I: Survey and properties (Q1198732) (← links)
- Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison (Q1198733) (← links)
- Global one-dimensional optimization using smooth auxiliary functions (Q1290603) (← links)
- The cubic algorithm for global games with application to pursuit-evasion games (Q1311987) (← links)
- Lipschitzian optimization without the Lipschitz constant (Q1321408) (← links)
- Global optimization in problems with uncertainties: the gamma algorithm. (Q1416293) (← links)
- Implementation of Cartesian grids to accelerate Delaunay-based derivative-free optimization (Q1685588) (← links)
- Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms (Q1777602) (← links)
- The alpha algorithm and the application of the cubic algorithm in case of unknown Lipschitz constant (Q1802499) (← links)
- New LP bound in multivariate Lipschitz optimization: Theory and applications (Q1905038) (← links)
- An approach for simultaneous finding of multiple efficient decisions in multi-objective optimization problems (Q2117623) (← links)
- Global optimization to prescribed accuracy (Q2277770) (← links)
- Non-causal models in long term planning via set contractive optimal control methods (Q2471597) (← links)
- The integer cubic algorithm (Q2638934) (← links)
- An implicit enumeration method for global optimization problems (Q2641085) (← links)
- Multidimensional global optimization using numerical estimates of objective function derivatives (Q5865327) (← links)
- When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation (Q5874493) (← links)
- Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms (Q5925738) (← links)
