Global optimization with spline constraints: a new branch-and-bound method based on B-splines
From MaRDI portal
Publication:300751
DOI10.1007/s10898-015-0358-4zbMath1372.90074OpenAlexW1260835741MaRDI QIDQ300751
Anders Sandnes, Bjarne Grimstad
Publication date: 29 June 2016
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-015-0358-4
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items
Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form, Experiments with hybrid Bernstein global optimization algorithm for the OPF problem in power systems, A MIQCP formulation for B-spline constraints, Optimization of black-box problems using Smolyak grids and polynomial approximations, Mathematical programming formulations for piecewise polynomial functions, A subdivision algorithm to reason on high-degree polynomial constraints over finite domains
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm
- Heat and mass mixed convection for MHD visco-elastic fluid past a stretching sheet with ohmic dissipation
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- An efficient and safe framework for solving optimization problems
- An algorithmic framework for convex mixed integer nonlinear programs
- A penalized nonparametric method for nonlinear constrained optimization based on noisy data
- Fast construction of constant bound functions for sparse polynomials
- Knot line refinement algorithms for tensor product B-spline surfaces
- Rates of convergence of control polygons
- A collection of test problems for constrained global optimization algorithms
- A fast convex hull algorithm
- Efficient global optimization of expensive black-box functions
- An approximate approach of global optimization for polynomial programming problems
- Handbook of test problems in local and global optimization
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- Lower bound functions for polynomials
- Convex envelopes of monomials of odd degree
- Best bounds on the approximation of polynomials and splines by their control structure
- Convex envelopes for edge-concave functions
- A polyhedral branch-and-cut approach to global optimization
- A taxonomy of global optimization methods based on response surfaces
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Construction of convex relaxations using automated code generation techniques
- Investigation of a subdivision based algorithm for solving systems of polynomial equations.
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Improving interval analysis bounds by translations
- Convergence of subdivision and degree elevation
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- A branch-and-reduce approach to global optimization
- On convex envelopes for bivariate functions over polytopes
- Global and local optimization using radial basis function response surface models
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On Polya frequency functions. IV: The fundamental spline functions and their limits
- On calculating with B-splines
- Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators
- Mixed integer models for the stationary case of gas network optimization
- Global Optimization with Polynomials and the Problem of Moments
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
- Branching and bounds tighteningtechniques for non-convex MINLP
- The global solver in the LINDO API
- GloptiPoly 3: moments, optimization and semidefinite programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Production Planning by Mixed Integer Programming
- The Numerical Evaluation of B-Splines
- Deterministic global optimization using interval constraint propagation techniques
- Global Optimization and Constraint Satisfaction
