Pages that link to "Item:Q1062427"
From MaRDI portal
The following pages link to Extended univariate algorithms for \(n\)-dimensional global optimization (Q1062427):
Displaying 32 items.
- Solving nonlinear equation systems via global partition and search: Some experimental results (Q582008) (← links)
- Steepest descent with curvature dynamical system (Q597146) (← links)
- Uniform tree approximation by global optimization techniques (Q600944) (← links)
- Stochastic modelling and optimization for environmental management (Q803022) (← links)
- Interval method for bounding level sets: Revisited and tested with global optimization problems (Q804239) (← links)
- Set partition by globally optimized cluster seed points (Q809887) (← links)
- Globally optimized calibration of environmental models (Q922969) (← links)
- Global optimization on convex sets (Q1089268) (← 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)
- Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities (Q1090614) (← links)
- Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions (Q1102868) (← links)
- A note on ``Extended univariate algorithms'' by J. Pinter (Q1114347) (← links)
- Convergence qualification of adaptive partition algorithms in global optimization (Q1196187) (← links)
- Global optimization of univariate Lipschitz functions. I: Survey and properties (Q1198732) (← links)
- An application of Lipschitzian global optimization to product design (Q1200528) (← links)
- Global one-dimensional optimization using smooth auxiliary functions (Q1290603) (← links)
- Global optimization by multilevel coordinate search (Q1304343) (← links)
- The impact of accelerating tools on the interval subdivision algorithm for global optimization (Q1804056) (← links)
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization (Q1904648) (← links)
- New LP bound in multivariate Lipschitz optimization: Theory and applications (Q1905038) (← links)
- Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives (Q1962986) (← links)
- On tightness and anchoring of McCormick and other relaxations (Q2274852) (← links)
- A decomposition method for MINLPs with Lipschitz continuous nonlinearities (Q2330657) (← links)
- A global minimization algorithm for Lipschitz functions (Q2465562) (← links)
- An implicit enumeration method for global optimization problems (Q2641085) (← links)
- On the convergence of adaptive partition algorithms in global optimization (Q3496164) (← links)
- Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure (Q3789345) (← links)
- Topics in Lipschitz global optimisation (Q4346952) (← links)
- A statistical model for global optimization by means of select and clone (Q4500802) (← links)
- On convergence of "divide the best" global optimization algorithms (Q4944418) (← links)
- On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients (Q5270520) (← links)
- Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms (Q5925738) (← links)
