Pages that link to "Item:Q1924072"

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

Displaying 50 items.

• Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming (Q2897298) (← links)
• An Algorithmic Framework for MINLP with Separable Non-Convexity (Q2897302) (← links)
• Alternative branching rules for some nonconvex problems (Q2943824) (← links)
• Mixed integer nonlinear programming using interior-point methods (Q3096887) (← links)
• Global optimization of semi-infinite programs via restriction of the right-hand side (Q3111137) (← links)
• Valid Inequalities for Separable Concave Constraints with Indicator Variables (Q3186509) (← links)
• GlobSol user guide (Q3396392) (← links)
• Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints (Q3454970) (← links)
• Challenges in Enterprise Wide Optimization for the Process Industries (Q3638498) (← links)
• Capacity improvement, penalties, and the fixed charge transportation problem (Q4261216) (← links)
• (Q4552725) (← links)
• Whitney differentiability of optimal-value functions for bound-constrained convex programming problems (Q4634171) (← links)
• Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON (Q4637830) (← links)
• The travelling salesman problem with neighbourhoods: MINLP solution (Q4924121) (← links)
• Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties (Q4995064) (← links)
• EAGO.jl: easy advanced global optimization in Julia (Q5038425) (← links)
• Decomposition and Adaptive Sampling for Data-Driven Inverse Linear Optimization (Q5058012) (← links)
• Multi-fidelity algorithms for the horizontal alignment problem in road design (Q5059454) (← links)
• Solving generalized polynomial problem by using new affine relaxed technique (Q5063453) (← links)
• Optimization under Rare Chance Constraints (Q5081097) (← links)
• Decomposing Loosely Coupled Mixed-Integer Programs for Optimal Microgrid Design (Q5084598) (← links)
• Global optimization algorithm for solving linear multiplicative programming problems (Q5085229) (← links)
• A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints (Q5108220) (← links)
• Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques (Q5139846) (← links)
• Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs (Q5148407) (← links)
• Mathematically Rigorous Global Optimization and Fuzzy Optimization (Q5153504) (← links)
• A Linear-Time Algorithm for Globally Maximizing the Sum of a Generalized Rayleigh Quotient and a Quadratic Form on the Unit Sphere (Q5231687) (← links)
• Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods (Q5351613) (← links)
• DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization (Q5382573) (← links)
• A revised Taha's algorithm for polynomial 0-1 programming (Q5426969) (← links)
• Computation of parameter stability margins using polynomial programming techniques (Q5491419) (← links)
• Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs (Q5746688) (← links)
• COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS (Q5880744) (← links)
• Algebraic Perspectives on Signomial Optimization (Q5886830) (← links)
• Global optimization (Q5896995) (← links)
• Global Optimization and Constraint Satisfaction (Q5897037) (← links)
• Global Optimization and Constraint Satisfaction (Q5897051) (← links)
• Constraint aggregation for rigorous global optimization (Q5962722) (← links)
• Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment (Q5963234) (← links)
• The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming (Q5964241) (← links)
• Modeling design and control problems involving neural network surrogates (Q6043129) (← links)
• A low-cost alternating projection approach for a continuous formulation of convex and cardinality constrained optimization (Q6063782) (← links)
• A Lagrangean relaxation approach to lifetime maximization of directional sensor networks (Q6087140) (← links)
• An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming (Q6099489) (← links)
• Interval division and linearization algorithm for minimax linear fractional program (Q6140900) (← links)
• Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound (Q6162508) (← links)
• Subdomain separability in global optimization (Q6173955) (← links)
• Effective algorithms for optimal portfolio deleveraging problem with cross impact (Q6178391) (← links)
• Computational Study of Local Search Methods for a D.C. Optimization Problem with Inequality Constraints (Q6488347) (← links)
• A classification method based on a cloud of spheres (Q6491344) (← links)