Pages that link to "Item:Q5292941"
From MaRDI portal
The following pages link to Complete search in continuous global optimization and constraint satisfaction (Q5292941):
Displayed 50 items.
- Extended reverse-convex programming: an approximate enumeration approach to global optimization (Q288222) (← links)
- Convergence analysis of Taylor models and McCormick-Taylor models (Q367158) (← links)
- Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints (Q367165) (← links)
- Multiagent cooperation for solving global optimization problems: an extendible framework with example cooperation strategies (Q377733) (← links)
- A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function (Q386486) (← links)
- Solving set-valued constraint satisfaction problems (Q411438) (← links)
- Rigorous filtering using linear relaxations (Q453629) (← links)
- Branch-and-lift algorithm for deterministic global optimization in nonlinear optimal control (Q467420) (← links)
- A CSP versus a zonotope-based method for solving guard set intersection in nonlinear hybrid reachability (Q475431) (← links)
- Reverse propagation of McCormick relaxations (Q496587) (← links)
- On the time transformation of mixed integer optimal control problems using a consistent fixed integer control function (Q507341) (← links)
- Three enhancements for optimization-based bound tightening (Q522269) (← links)
- Convergence analysis of multivariate McCormick relaxations (Q524904) (← links)
- Computing reachable sets for uncertain nonlinear hybrid systems using interval constraint-propagation techniques (Q547885) (← links)
- Constraint propagation on quadratic constraints (Q606897) (← links)
- Nonsmooth exclusion test for finding all solutions of nonlinear equations (Q616162) (← links)
- Reliable amplitude and frequency estimation for biased and noisy signals (Q635684) (← links)
- Optimal value bounds in nonlinear programming with interval data (Q636005) (← links)
- Convergence rate of McCormick relaxations (Q656830) (← links)
- Low dimensional simplex evolution: a new heuristic for global optimization (Q656836) (← links)
- Reformulations in mathematical programming: automatic symmetry detection and exploitation (Q662305) (← links)
- An approach to constrained global optimization based on exact penalty functions (Q693136) (← links)
- Solving optimal control problems by exploiting inherent dynamical systems structures (Q715483) (← links)
- Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (Q742114) (← links)
- The cluster problem revisited (Q742132) (← links)
- Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- On verified numerical computations in convex programming (Q849186) (← links)
- An efficient and safe framework for solving optimization problems (Q861905) (← links)
- A decomposition-based solution method for stochastic mixed integer nonlinear programs (Q882650) (← links)
- Certified error bounds for uncertain elliptic equations (Q930711) (← links)
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures (Q933795) (← links)
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps (Q940828) (← links)
- Enhancing numerical constraint propagation using multiple inclusion representations (Q1039582) (← links)
- The probabilistic customer's choice rule with a threshold attraction value: effect on the location of competitive facilities in the plane (Q1628064) (← links)
- Basin hopping networks of continuous global optimization problems (Q1642814) (← links)
- Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains (Q1668799) (← links)
- Chebyshev model arithmetic for factorable functions (Q1675562) (← links)
- Guided dive for the spatial branch-and-bound (Q1675571) (← links)
- A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set (Q1675572) (← links)
- Certificates of infeasibility via nonsmooth optimization (Q1675645) (← links)
- A certified branch \& bound approach for reliability-based optimization problems (Q1679494) (← links)
- The cluster problem in constrained global optimization (Q1683326) (← links)
- A new algorithm for Chebyshev minimum-error multiplication of reduced affine forms (Q1689460) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Global optimization in Hilbert space (Q1717227) (← links)
- Fixed-order robust \(H_{\infty}\) estimator design for side-slip angle of vehicle (Q1718991) (← links)
- Integrated stoichiometric, thermodynamic and kinetic modelling of steady state metabolism (Q1719727) (← links)
- A direct search algorithm for global optimization (Q1736805) (← links)
- Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization (Q1753511) (← links)