Pages that link to "Item:Q1904647"

The following pages link to Finding all solutions of nonlinearly constrained systems of equations (Q1904647):

Displaying 50 items.

• Interval arithmetic for nonlinear problem solving (Q275934) (← links)
• 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)
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• Topographical global initialization for finding all solutions of nonlinear systems with constraints (Q343685) (← links)
• A reformulation framework for global optimization (Q367160) (← links)
• GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
• A framework for globally optimizing mixed-integer signomial programs (Q398656) (← links)
• Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems (Q421696) (← links)
• Convergence analysis of multivariate McCormick relaxations (Q524904) (← links)
• Nonsmooth exclusion test for finding all solutions of nonlinear equations (Q616162) (← links)
• Convergence rate of McCormick relaxations (Q656830) (← links)
• A branch-and-cut algorithm for a class of sum-of-ratios problems (Q668157) (← links)
• A Metropolis algorithm combined with Hooke-Jeeves local search method applied to global optimization (Q711332) (← links)
• Modified projection method for solving a system of monotone equations with convex constraints (Q711506) (← links)
• A superlinearly convergent projection method for constrained systems of nonlinear equations (Q839048) (← links)
• Explicit hybrid model-predictive control: the exact solution (Q895283) (← links)
• Global solution of optimization problems with signomial parts (Q924639) (← links)
• Convex underestimation for posynomial functions of positive variables (Q941023) (← links)
• Piecewise-linear approximations of multidimensional functions (Q970578) (← links)
• Convexity of products of univariate functions and convexification transformations for geometric programming (Q1014014) (← links)
• Global optimization of signomial mixed-integer nonlinear programming problems with free variables (Q1024826) (← links)
• Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions (Q1024827) (← links)
• Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions (Q1024828) (← links)
• Molecular conformation of \(n\)-alkanes using terrain/funneling methods (Q1029676) (← links)
• Some transformation techniques with applications in global optimization (Q1029684) (← links)
• Cutting circles and polygons from area-minimizing rectangles (Q1029696) (← links)
• Solving nonlinear systems of equations with simple constraints (Q1384164) (← links)
• An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems (Q1668794) (← links)
• Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains (Q1668799) (← links)
• On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation (Q1756762) (← links)
• Trigonometric convex underestimator for the base functions in Fourier space (Q1777592) (← links)
• Rigorous convex underestimators for general twice-differentiable problems (Q1817315) (← links)
• \(\alpha BB\): A global optimization method for general constrained nonconvex problems (Q1913605) (← links)
• Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
• A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms (Q1937084) (← links)
• Multi-parametric disaggregation technique for global optimization of polynomial programming problems (Q1941031) (← links)
• A review of deterministic optimization methods in engineering and management (Q1955154) (← links)
• A nonmonotone projection method for constrained system of nonlinear equations (Q1993198) (← links)
• Generalizing 0-1 conflict hypergraphs and mixed conflict graphs: mixed conflict hypergraphs in discrete optimization (Q2046309) (← links)
• Identification of mechanical properties of arteries with certification of global optimality (Q2070372) (← links)
• Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations (Q2097651) (← links)
• On generalizing Descartes' rule of signs to hypersurfaces (Q2172219) (← links)
• Cutting ellipses from area-minimizing rectangles (Q2250089) (← links)
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
• Multivariate McCormick relaxations (Q2250101) (← links)
• Spectral gradient projection method for monotone nonlinear equations with convex constraints (Q2271390) (← links)
• ARGONAUT: algorithms for global optimization of constrained grey-box computational problems (Q2359400) (← links)
• Deterministic global optimization in ab-initio quantum chemistry (Q2392771) (← links)
• Finding multiple optimal solutions of signomial discrete programming problems with free variables (Q2443364) (← links)