BARON
From MaRDI portal
Software:12838
No author found.
Related Items (only showing first 100 items - show all)
Minimizing the sum of many rational functions ⋮ Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches ⋮ Minotaur: a mixed-integer nonlinear optimization toolkit ⋮ Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems ⋮ A hybrid LP/NLP paradigm for global optimization relaxations ⋮ On exact solution approaches for bilevel quadratic 0-1 knapsack problem ⋮ Transformation-based preprocessing for mixed-integer quadratic programs ⋮ Theoretical and computational results about optimality-based domain reductions ⋮ Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming ⋮ A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints ⋮ Bilinear modeling solution approach for fixed charge network flow problems ⋮ Contractor programming ⋮ Global optimization of multi-parametric MILP problems ⋮ Packing ellipsoids by nonlinear optimization ⋮ Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects ⋮ Optimal design and dispatch of a system of diesel generators, photovoltaics and batteries for remote locations ⋮ Book review of: J.-B. Lasserre, An introduction to polynomial and semi-algebraic optimization ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method ⋮ Solving quality control problems with an algorithm for minimax programs with coupled constraints ⋮ Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach ⋮ A planar single facility location and border crossing problem ⋮ RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems ⋮ A non-parametric approach to demand forecasting in revenue management ⋮ Divisive heuristic for modularity density maximization ⋮ Soft time-windows for a bi-objective vendor selection problem under a multi-sourcing strategy: binary-continuous differential evolution ⋮ Interactions between nonlinear programming and modeling systems ⋮ An inverse reliability-based approach for designing under uncertainty with application to robust piston design ⋮ GLOMIQO: global mixed-integer quadratic optimizer ⋮ Tacit collusion games in pool-based electricity markets under transmission constraints ⋮ Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach ⋮ Semidefinite relaxations for non-convex quadratic mixed-integer programming ⋮ A new local and global optimization method for mixed integer quadratic programming problems ⋮ Constraint propagation on quadratic constraints ⋮ A finite algorithm for global minimization of separable concave programs ⋮ A recipe for finding good solutions to MINLPs ⋮ Global optimization of bilinear programs with a multiparametric disaggregation technique ⋮ A heuristic approach to a single stage assembly problem with transportation allocation ⋮ On the optimal design of water distribution networks: a practical MINLP approach ⋮ A numerical study of diagonally split Runge-Kutta methods for PDEs with discontinuities ⋮ High order strong stability preserving time discretizations ⋮ Copositivity and constrained fractional quadratic problems ⋮ A pseudo-global optimization approach with application to the design of containerships ⋮ Reduced RLT representations for nonconvex polynomial programming problems ⋮ Convex envelopes of products of convex and component-wise concave functions ⋮ A hierarchy of relaxations for nonlinear convex generalized disjunctive programming ⋮ Modeling languages in mathematical optimization. ⋮ Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation ⋮ Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations ⋮ Stochastic optimization for blending problem in brass casting industry ⋮ Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts ⋮ Rigorous filtering using linear relaxations ⋮ Identification of piecewise affine systems via mixed-integer programming. ⋮ Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs ⋮ On the solution of the inverse eigenvalue complementarity problem ⋮ Energy-optimal multi-goal motion planning for planar robot manipulators ⋮ Convergence rate of McCormick relaxations ⋮ Low dimensional simplex evolution: a new heuristic for global optimization ⋮ A capacitated location-allocation model for flood disaster service operations with border crossing passages and probabilistic demand locations ⋮ An improved Bernstein global optimization algorithm for MINLP problems with application in process industry ⋮ Bound constrained interval global optimization in the COCONUT environment ⋮ Box-constrained quadratic programs with fixed charge variables ⋮ A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures ⋮ Reformulations in mathematical programming: automatic symmetry detection and exploitation ⋮ Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs ⋮ A risk-averse stochastic program for integrated system design and preventive maintenance planning ⋮ Lago: a (heuristic) branch and cut algorithm for nonconvex minlps ⋮ Convex underestimation for posynomial functions of positive variables ⋮ Reverse propagation of McCormick relaxations ⋮ Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method ⋮ Bounds tightening based on optimality conditions for nonconvex box-constrained optimization ⋮ Empirical decision model learning ⋮ A computational study of primal heuristics inside an MI(NL)P solver ⋮ Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions ⋮ Model predictive control with discrete actuators: theory and application ⋮ Differentiable McCormick relaxations ⋮ Parametric mixed-integer 0-1 linear programming: The general case for a single parameter ⋮ New multi-commodity flow formulations for the pooling problem ⋮ 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 ⋮ Modeling with discrete-time recurrent fuzzy systems via mixed-integer optimization ⋮ RLT: A unified approach for discrete and continuous nonconvex optimization ⋮ A dynamic convexized method for nonconvex mixed integer nonlinear programming ⋮ Optimizing a polyhedral-semidefinite relaxation of completely positive programs ⋮ Planar expropriation problem with non-rigid rectangular facilities ⋮ An algorithm for nonlinear optimization problems with binary variables ⋮ Reformulations for utilizing separability when solving convex MINLP problems ⋮ \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation ⋮ Optimal implicit strong stability preserving Runge-Kutta methods ⋮ A local exploration-based differential evolution algorithm for constrained global optimization ⋮ Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming ⋮ On an enumerative algorithm for solving eigenvalue complementarity problems ⋮ Global solution of bilevel programs with a nonconvex inner program ⋮ A global continuation algorithm for solving binary quadratic programming problems ⋮ Column enumeration based decomposition techniques for a class of non-convex MINLP problems ⋮ Cutting circles and polygons from area-minimizing rectangles ⋮ Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming ⋮ Mixed integer nonlinear programming tools: a practical overview ⋮ A global optimization RLT-based approach for solving the fuzzy clustering problem ⋮ Interval analysis on directed acyclic graphs for global optimization ⋮ Solving planning and design problems in the process industry using mixed integer and global optimization
This page was built for software: BARON
