Pages that link to "Item:Q1924072"

The following pages link to BARON: A general purpose global optimization software package (Q1924072):

Displaying 50 items.

• The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm (Q1681158) (← links)
• Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems (Q1713205) (← links)
• Global optimization in Hilbert space (Q1717227) (← links)
• New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128) (← links)
• Mixed-integer nonlinear programming for aircraft conflict avoidance by sequentially applying velocity and heading angle changes (Q1753434) (← links)
• On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation (Q1756762) (← links)
• Global optimization of nonconvex problems with convex-transformable intermediates (Q1756773) (← links)
• Rounding-based heuristics for nonconvex MINLPS (Q1762458) (← links)
• Globally solving nonconvex quadratic programming problems via completely positive programming (Q1762459) (← links)
• A branch-and-cut algorithm for nonconvex quadratic programs with box constraints (Q1774170) (← links)
• A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs (Q1780950) (← links)
• Mixed integer programming for a special logic constrained optimal control problem (Q1780957) (← links)
• On solving quadratically constrained quadratic programming problem with one non-convex constraint (Q1790405) (← links)
• Valid inequalities for separable concave constraints with indicator variables (Q1801013) (← links)
• Some results on the strength of relaxations of multilinear functions (Q1925788) (← links)
• On convex relaxations for quadratically constrained quadratic programming (Q1925792) (← links)
• Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints (Q1935885) (← links)
• Convex envelopes generated from finitely many compact convex sets (Q1942266) (← links)
• Separation and relaxation for cones of quadratic forms (Q1942279) (← links)
• Reverse bridge theorem under constraint partition (Q1958870) (← links)
• Global optimization problems and domain reduction strategies (Q1960192) (← links)
• Global minimization using an augmented Lagrangian method with variable lower-level constraints (Q1960193) (← links)
• A note on solving DiDi's driver-order matching problem (Q1996745) (← links)
• Conic approximation to nonconvex quadratic programming with convex quadratic constraints (Q2018510) (← links)
• Convergent upper bounds in global minimization with nonlinear equality constraints (Q2020617) (← links)
• Outer space branch and bound algorithm for solving linear multiplicative programming problems (Q2022174) (← links)
• \textsc{AbsTaylor}: upper bounding with inner regions in nonlinear continuous global optimization problems (Q2022241) (← links)
• Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems (Q2044489) (← links)
• Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (Q2045008) (← links)
• Convex hull representations for bounded products of variables (Q2046306) (← links)
• Output feedback design for discrete-time constrained systems subject to persistent disturbances via bilinear programming (Q2068223) (← links)
• Identification of mechanical properties of arteries with certification of global optimality (Q2070372) (← links)
• Generalization of the twisting convergence conditions to non-affine systems (Q2071914) (← links)
• A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems (Q2075981) (← links)
• An elliptical cover problem in drone delivery network design and its solution algorithms (Q2079395) (← links)
• Data-driven stochastic optimization for distributional ambiguity with integrated confidence region (Q2079685) (← links)
• Solving certain complementarity problems in power markets via convex programming (Q2085814) (← links)
• Continuous cubic formulations for cluster detection problems in networks (Q2097637) (← links)
• Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations (Q2097651) (← links)
• Robust optimization in power systems: a tutorial overview (Q2101660) (← links)
• Optimization hierarchy for fair statistical decision problems (Q2112802) (← links)
• Hidden invariant convexity for global and conic-intersection optimality guarantees in discrete-time optimal control (Q2114579) (← links)
• Linearization and parallelization schemes for convex mixed-integer nonlinear optimization (Q2114818) (← links)
• Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems (Q2147914) (← links)
• Sequence of polyhedral relaxations for nonlinear univariate functions (Q2147925) (← links)
• Numerical certification of Pareto optimality for biobjective nonlinear problems (Q2154462) (← links)
• On the exactness of the \(\varepsilon\)-constraint method for biobjective nonlinear integer programming (Q2157908) (← links)
• Discrete dynamical system approaches for Boolean polynomial optimization (Q2161551) (← links)
• The supporting hyperplane optimization toolkit for convex MINLP (Q2162510) (← links)
• Globally minimizing the sum of a convex-concave fraction and a convex function based on wave-curve bounds (Q2176280) (← links)