The following pages link to BARON (Q12838):
Displaying 50 items.
- Separation and relaxation for cones of quadratic forms (Q1942279) (← links)
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization (Q1946925) (← links)
- Portfolio optimization for wealth-dependent risk preferences (Q1958620) (← links)
- Reverse bridge theorem under constraint partition (Q1958870) (← links)
- Global solution of nonlinear mixed-integer bilevel programs (Q1959230) (← links)
- On convex relaxations of quadrilinear terms (Q1959235) (← 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)
- A new algorithm for concave quadratic programming (Q2010088) (← links)
- Experimental validation of volume-based comparison for double-McCormick relaxations (Q2011595) (← links)
- Rigorous verification of feasibility (Q2018466) (← 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)
- Branch-and-price for a class of nonconvex mixed-integer nonlinear programs (Q2052398) (← links)
- Deterministic global optimization with Gaussian processes embedded (Q2062323) (← 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)
- An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities (Q2089867) (← links)
- Discretization and global optimization for mixed integer bilinear programming (Q2089882) (← links)
- Optimising small-scale electronic commerce supply chain operations: a dynamic cost-sharing contract approach (Q2095924) (← links)
- Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems (Q2097628) (← links)
- SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs (Q2097634) (← 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)
- Non-convex nested Benders decomposition (Q2097672) (← 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)
- Review and comparison of algorithms and software for mixed-integer derivative-free optimization (Q2114591) (← links)
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization (Q2114818) (← links)
- Sample average approximation for stochastic nonconvex mixed integer nonlinear programming via outer-approximation (Q2129194) (← links)
- Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound (Q2129196) (← links)
- Mixed-integer second-order cone optimization for composite discrete ply-angle and thickness topology optimization problems (Q2129212) (← links)
- Maximum feasible subsystems of distance geometry constraints (Q2131137) (← links)
- Stable honeycomb structures and temperature based trajectory optimization for wire-arc additive manufacturing (Q2139148) (← 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)
- Discrete dynamical system approaches for Boolean polynomial optimization (Q2161551) (← links)
- The supporting hyperplane optimization toolkit for convex MINLP (Q2162510) (← links)
- The \(p\)-Lagrangian relaxation for separable nonconvex MIQCQP problems (Q2162511) (← links)
