The following pages link to Optimal centered forms (Q1100850):
Displaying 30 items.
- Bound constrained interval global optimization in the COCONUT environment (Q475813) (← links)
- Global optimization of generalized semi-infinite programs using disjunctive programming (Q670652) (← links)
- Theoretical rate of convergence for interval inclusion functions (Q695339) (← links)
- A second-order pruning step for verified global optimization (Q839324) (← links)
- Empirical convergence speed of inclusion functions for facility location problems (Q861908) (← links)
- Comparison between Baumann and admissible simplex forms in interval analysis (Q995937) (← links)
- Interval expansion method for nonlinear equation in several variables (Q1026277) (← links)
- A class of componentwise Krawczyk-Moore type iteration methods (Q1120252) (← links)
- Robust analysis and design of control systems using interval arithmetic (Q1367196) (← links)
- Global optimization of disjunctive programs (Q1679482) (← links)
- Global solution of semi-infinite programs (Q1780954) (← links)
- Bernstein form is inclusion monotone (Q1895864) (← links)
- Interval methods for global optimization (Q1914643) (← links)
- Convergent upper bounds in global minimization with nonlinear equality constraints (Q2020617) (← links)
- On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic (Q2046307) (← links)
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints (Q2355020) (← links)
- On interval branch-and-bound for additively separable functions with common variables (Q2392130) (← links)
- Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm (Q2460123) (← links)
- Continuous minimax optimization using modal intervals (Q2465802) (← links)
- New results on verified global optimization (Q2564991) (← links)
- Optimal centers in branch-and-prune algorithms for univariate global optimization (Q2572338) (← links)
- Empirical investigation of the convergence speed of inclusion functions in a global otimization context (Q2572918) (← links)
- A new inclusion function for optimization: kite -- the one-dimensional case (Q2574104) (← links)
- Solving minimax problems by interval methods (Q2639605) (← links)
- Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint (Q3635703) (← links)
- A Branch-and-Prune Method for Global Optimization (Q4577117) (← links)
- (Q5698660) (← links)
- An extension of the \(\alpha\mathrm{BB}\)-type underestimation to linear parametric Hessian matrices (Q5964239) (← links)
- Bicentered interval Newton operator for Robot's workspace approximation (Q6588760) (← links)
- A branch-and-bound algorithm for nonconvex Nash equilibrium problems (Q6622755) (← links)
