Pages that link to "Item:Q4340792"

The following pages link to Subdivision Direction Selection in Interval Methods for Global Optimization (Q4340792):

Displaying 47 items.

• A modification of the \(\alpha \mathrm{BB}\) method for box-constrained optimization and an application to inverse kinematics (Q285928) (← links)
• Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490) (← links)
• Efficient solution of a class of quantified constraints with quantifier prefix exists-forall (Q475420) (← links)
• Bound constrained interval global optimization in the COCONUT environment (Q475813) (← links)
• Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development (Q480823) (← links)
• MSO: a framework for bound-constrained black-box global optimization algorithms (Q524912) (← links)
• On the complexity of exclusion algorithms for optimization (Q700180) (← links)
• \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers (Q721162) (← links)
• Solving a huff-like competitive location and design model for profit maximization in the plane (Q864047) (← links)
• A new exclusion test for finding the global minimum (Q869487) (← links)
• Efficient interval partitioning for constrained global optimization (Q956597) (← links)
• Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms (Q995933) (← links)
• Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms (Q1177911) (← links)
• The convergence speed of interval methods for global optimization (Q1361290) (← links)
• Heuristic rejection in interval global optimization (Q1407232) (← links)
• A new subdivision strategy for range computations (Q1604714) (← links)
• Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains (Q1668799) (← links)
• A proof of Jones' conjecture (Q1710557) (← links)
• Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms (Q1777602) (← links)
• The impact of accelerating tools on the interval subdivision algorithm for global optimization (Q1804056) (← links)
• Numerical experiences with a new generalized subinterval selection criterion for interval global optimization (Q1810785) (← links)
• Parallel methods for verified global optimization practice and theory (Q1817314) (← links)
• On the selection of subdivision directions in interval branch-and-bound methods for global optimization (Q1904648) (← links)
• Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints (Q1935885) (← links)
• Nonlinear biobjective optimization: improving the upper envelope using feasible line segments (Q2022248) (← links)
• Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms (Q2274873) (← links)
• Interval methods and contractor-based branch-and-bound procedures for verified parameter identification of quasi-linear cooperative system models (Q2332778) (← links)
• Generalized subinterval selection criteria for interval global optimization (Q2387747) (← links)
• On estimating workload in interval branch-and-bound global optimization algorithms (Q2392108) (← links)
• Global convergence and the Powell singular function (Q2392109) (← links)
• A branch and bound algorithm for quantified quadratic programming (Q2397427) (← links)
• Box particle filtering for nonlinear state estimation using interval analysis (Q2440661) (← links)
• Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm (Q2460123) (← links)
• New interval methods for constrained global optimization (Q2490338) (← links)
• A combined global \& local search (CGLS) approach to global optimization (Q2494296) (← links)
• New results on verified global optimization (Q2564991) (← links)
• An improved interval global optimization algorithm using higher-order inclusion function forms (Q2569148) (← links)
• A new pruning test for finding all global minimizers of nonsmooth functions (Q2572719) (← links)
• A new inclusion function for optimization: kite -- the one-dimensional case (Q2574104) (← links)
• Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints (Q2664250) (← links)
• A Hybrid Subdivision Strategy for Result-Verifying Nonlinear Solvers (Q2954926) (← links)
• Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization (Q3509411) (← links)
• AN ALGORITHM FOR FINDING ALL ZEROS OF VECTOR FUNCTIONS (Q3533767) (← links)
• Interval Methods for Global Optimization Using the Boxing Method (Q4577116) (← links)
• Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms (Q5925738) (← links)
• Node selection strategies in interval branch and bound algorithms (Q5964243) (← links)
• Subdomain separability in global optimization (Q6173955) (← links)