Pages that link to "Item:Q1924072"

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

Displaying 50 items.

• BARON (Q12838) (← links)
• Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems (Q280099) (← links)
• Transformation-based preprocessing for mixed-integer quadratic programs (Q283953) (← links)
• Theoretical and computational results about optimality-based domain reductions (Q288410) (← links)
• Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490) (← links)
• Multiobjective optimization for aircraft conflict resolution. A metaheuristic approach (Q320753) (← links)
• Book review of: J.-B. Lasserre, An introduction to polynomial and semi-algebraic optimization (Q321039) (← links)
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method (Q336618) (← links)
• A planar single facility location and border crossing problem (Q339663) (← links)
• A recipe for finding good solutions to MINLPs (Q384810) (← links)
• Global optimization of bilinear programs with a multiparametric disaggregation technique (Q386453) (← links)
• Convex envelopes of products of convex and component-wise concave functions (Q427364) (← links)
• A hierarchy of relaxations for nonlinear convex generalized disjunctive programming (Q439452) (← links)
• Branch-and-lift algorithm for deterministic global optimization in nonlinear optimal control (Q467420) (← links)
• Energy-optimal multi-goal motion planning for planar robot manipulators (Q467470) (← links)
• Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions (Q517317) (← links)
• Differentiable McCormick relaxations (Q522264) (← links)
• RLT: A unified approach for discrete and continuous nonconvex optimization (Q537611) (← links)
• A dynamic convexized method for nonconvex mixed integer nonlinear programming (Q547132) (← links)
• A new local and global optimization method for mixed integer quadratic programming problems (Q606807) (← links)
• Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
• Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
• Low dimensional simplex evolution: a new heuristic for global optimization (Q656836) (← links)
• A risk-averse stochastic program for integrated system design and preventive maintenance planning (Q666964) (← links)
• A computational study of primal heuristics inside an MI(NL)P solver (Q683729) (← links)
• Reformulations for utilizing separability when solving convex MINLP problems (Q721170) (← links)
• Mixed integer nonlinear programming tools: a practical overview (Q766256) (← links)
• A global optimization method, QBB, for twice-differentiable nonconvex optimization problem (Q811896) (← links)
• A global optimization RLT-based approach for solving the fuzzy clustering problem (Q816063) (← links)
• Interval analysis on directed acyclic graphs for global optimization (Q816066) (← links)
• Solving planning and design problems in the process industry using mixed integer and global optimization (Q817211) (← links)
• Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
• Bilinear modeling solution approach for fixed charge network flow problems (Q839798) (← links)
• An inverse reliability-based approach for designing under uncertainty with application to robust piston design (Q868632) (← links)
• Box-constrained quadratic programs with fixed charge variables (Q933786) (← links)
• A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures (Q933795) (← links)
• Parametric mixed-integer 0-1 linear programming: The general case for a single parameter (Q958548) (← links)
• Optimizing a polyhedral-semidefinite relaxation of completely positive programs (Q977327) (← links)
• A local exploration-based differential evolution algorithm for constrained global optimization (Q1004154) (← links)
• Column enumeration based decomposition techniques for a class of non-convex MINLP problems (Q1029695) (← links)
• Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming (Q1029700) (← links)
• Interactions between nonlinear programming and modeling systems (Q1365050) (← links)
• Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches (Q1616947) (← links)
• A hybrid LP/NLP paradigm for global optimization relaxations (Q1621693) (← links)
• Optimal design and dispatch of a system of diesel generators, photovoltaics and batteries for remote locations (Q1642979) (← links)
• A MIQCP formulation for B-spline constraints (Q1653267) (← links)
• A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables (Q1675255) (← links)
• A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs (Q1675550) (← links)
• Certificates of infeasibility via nonsmooth optimization (Q1675645) (← links)