BARON
From MaRDI portal
Cited in
(only showing first 100 items - show all)- New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- Global optimization of bounded factorable functions with discontinuities
- Convex underestimation strategies for signomial functions
- \textsc{AbsTaylor}: upper bounding with inner regions in nonlinear continuous global optimization problems
- Convergent upper bounds in global minimization with nonlinear equality constraints
- Spectral relaxations and branching strategies for global optimization of mixed-integer quadratic programs
- Global optimization in stabilizing controller design
- Multi-fidelity algorithms for the horizontal alignment problem in road design
- scientific article; zbMATH DE number 5820030 (Why is no real title available?)
- Continuous cubic formulations for cluster detection problems in networks
- Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations
- Non-convex nested Benders decomposition
- SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs
- Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
- scientific article; zbMATH DE number 970356 (Why is no real title available?)
- Mixed integer nonlinear programming tools: a practical overview
- A computational study of primal heuristics inside an MI(NL)P solver
- Optimal allocation of risk-reduction resources in event trees
- Interactions between nonlinear programming and modeling systems
- Minimizing the sum of many rational functions
- RLT: A unified approach for discrete and continuous nonconvex optimization
- Siting and sizing of facilities under probabilistic demands
- Siting and sizing of facilities under probabilistic demands
- Robust optimization in power systems: a tutorial overview
- Detecting and solving aircraft conflicts using bilevel programming
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem
- Global optimization algorithm for solving linear multiplicative programming problems
- A solution method for heterogeneity involving present bias
- Relaxations of factorable functions with convex-transformable intermediates
- A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps
- The optimization test environment
- Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
- Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- A pseudo-global optimization approach with application to the design of containerships
- Alternative branching rules for some nonconvex problems
- Modeling with discrete-time recurrent fuzzy systems via mixed-integer optimization
- GlobSol user guide
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming
- A note on solving DiDi's driver-order matching problem
- A linear-time algorithm for globally maximizing the sum of a generalized Rayleigh quotient and a quadratic form on the unit sphere
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm
- Valid constraints for the Point Packing in a Square problem
- Computing feasible points for binary MINLPs with MPECs
- Packing circles into perimeter-minimizing convex hulls
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- Structured linear reformulation of binary quadratically constrained quadratic programs
- A global optimization RLT-based approach for solving the hard clustering problem
- Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints
- Hidden invariant convexity for global and conic-intersection optimality guarantees in discrete-time optimal control
- Review and comparison of algorithms and software for mixed-integer derivative-free optimization
- Spatial branch-and-bound algorithm for MIQCPs featuring multiparametric disaggregation
- Energy-optimal multi-goal motion planning for planar robot manipulators
- Globally maximizing the sum of squares of quadratic forms over the unit sphere
- Planar expropriation problem with non-rigid rectangular facilities
- Conic approximation to nonconvex quadratic programming with convex quadratic constraints
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
- Tax-aware dynamic asset allocation
- Transformation-based preprocessing for mixed-integer quadratic programs
- Box-constrained quadratic programs with fixed charge variables
- Convex relaxations for mixed-integer nonlinear programs
- A planar single facility location and border crossing problem
- Optimal design and dispatch of a system of diesel generators, photovoltaics and batteries for remote locations
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- New bounds for nonconvex quadratically constrained quadratic programming
- Global solution of bilevel programs with a nonconvex inner program
- A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Exploiting structure in non-convex quadratic optimization and gas network planning under uncertainty
- Solving data envelopment analysis models with sum-of-fractional objectives: a global optimal approach based on the multiparametric disaggregation technique
- On an enumerative algorithm for solving eigenvalue complementarity problems
- The global solver in the LINDO API
- Conflict Analysis for MINLP
- Whitney differentiability of optimal-value functions for bound-constrained convex programming problems
- Theoretical and computational results about optimality-based domain reductions
- Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 8th international conference, CPAIOR 2011, Berlin, Germany, May 23--27, 2011. Proceedings
- Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
- Interval unions
- High order strong stability preserving time discretizations
- Partially-shared pessimistic bilevel multi-follower programming: concept, algorithm, and application
- Mixed-integer second-order cone optimization for composite discrete ply-angle and thickness topology optimization problems
- Maximum feasible subsystems of distance geometry constraints
- The problems of non-convex quadratic programming related to phased antenna arrays optimization
- Supply capacity acquisition and allocation with uncertain customer demands
- The weighted intruder path covering problem
- Global optimization of nonconvex problems with multilinear intermediates
- An algorithm for nonlinear optimization problems with binary variables
- Some observations on exclusion regions in branch and bound algorithms
- Complete search in continuous global optimization and constraint satisfaction
- Constraint partitioning in penalty formulations for solving temporal planning problems
- Alternative SDP and SOCP approximations for polynomial optimization
- Reformulations for utilizing separability when solving convex MINLP problems
- Global optimization of explicit strong-stability-preserving Runge-Kutta methods
- A branch-and-cut algorithm for mixed-integer bilinear programming
- Solving highly detailed gas transport MINLPs: block separability and penalty alternating direction methods
This page was built for software: BARON
