Global optimization with spline constraints: a new branch-and-bound method based on B-splines
From MaRDI portal
(Redirected from Publication:300751)
Recommendations
- Constrained global optimization of multivariate polynomials using polynomial B-spline form and B-spline consistency prune approach
- A MIQCP formulation for B-spline constraints
- Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach
- Solving nonconvex optimization problems in systems and control: a polynomial B-spline approach
- Mathematical programming formulations for piecewise polynomial functions
Cites work
- scientific article; zbMATH DE number 981250 (Why is no real title available?)
- scientific article; zbMATH DE number 3703310 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1054667 (Why is no real title available?)
- scientific article; zbMATH DE number 1058961 (Why is no real title available?)
- scientific article; zbMATH DE number 1550909 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- scientific article; zbMATH DE number 3101307 (Why is no real title available?)
- A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- A branch-and-reduce approach to global optimization
- A collection of test problems for constrained global optimization algorithms
- A fast convex hull algorithm
- A penalized nonparametric method for nonlinear constrained optimization based on noisy data
- A polyhedral branch-and-cut approach to global optimization
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- A taxonomy of global optimization methods based on response surfaces
- An algorithmic framework for convex mixed integer nonlinear programs
- An approximate approach of global optimization for polynomial programming problems
- An efficient and safe framework for solving optimization problems
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- Best bounds on the approximation of polynomials and splines by their control structure
- Branching and bounds tighteningtechniques for non-convex MINLP
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm
- Construction of convex relaxations using automated code generation techniques
- Convergence of subdivision and degree elevation
- Convex envelopes for edge-concave functions
- Convex envelopes of monomials of odd degree
- Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Deterministic global optimization using interval constraint propagation techniques
- Efficient global optimization of expensive black-box functions
- Fast construction of constant bound functions for sparse polynomials
- Global and local optimization using radial basis function response surface models
- Global optimization and constraint satisfaction: the branch-and-reduce approach
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Global optimization with polynomials and the problem of moments
- GloptiPoly 3: moments, optimization and semidefinite programming
- Handbook of test problems in local and global optimization
- Heat and mass mixed convection for MHD visco-elastic fluid past a stretching sheet with ohmic dissipation
- Improving interval analysis bounds by translations
- Investigation of a subdivision based algorithm for solving systems of polynomial equations.
- Knot line refinement algorithms for tensor product B-spline surfaces
- Lower bound functions for polynomials
- Mixed integer models for the stationary case of gas network optimization
- Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
- On Polya frequency functions. IV: The fundamental spline functions and their limits
- On calculating with B-splines
- On convex envelopes for bivariate functions over polytopes
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Production Planning by Mixed Integer Programming
- Rates of convergence of control polygons
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- The Numerical Evaluation of B-Splines
- The global solver in the LINDO API
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(8)- Constrained global optimization of multivariate polynomials using polynomial B-spline form and B-spline consistency prune approach
- Optimization of black-box problems using Smolyak grids and polynomial approximations
- Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach
- A MIQCP formulation for B-spline constraints
- A subdivision algorithm to reason on high-degree polynomial constraints over finite domains
- Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form
- Mathematical programming formulations for piecewise polynomial functions
- Experiments with hybrid Bernstein global optimization algorithm for the OPF problem in power systems
Describes a project that uses
Uses Software
This page was built for publication: Global optimization with spline constraints: a new branch-and-bound method based on B-splines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q300751)
