Mathematical programming formulations for piecewise polynomial functions
From MaRDI portal
Publication:2182855
DOI10.1007/s10898-020-00881-4zbMath1453.90164OpenAlexW3004521987MaRDI QIDQ2182855
Bjarne Grimstad, Brage Rugstad Knudsen
Publication date: 26 May 2020
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-020-00881-4
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines
- GLOMIQO: global mixed-integer quadratic optimizer
- On the optimal design of water distribution networks: a practical MINLP approach
- The Bernstein polynomial basis: a centennial retrospective
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Convex parametric piecewise quadratic optimization: theory and algorithms
- Smoothing methods for nonsmooth, nonconvex minimization
- Kernel methods in machine learning
- An algorithm for composite nonsmooth optimization problems
- Representability in mixed integer programming. I: Characterization results
- An algorithm for disjunctive programs
- Solving the staircase cost facility location problem with decomposition and piecewise linearization
- Discontinuous piecewise linear optimization
- Approximating separable nonlinear functions via mixed zero-one programs
- Flexible smoothing with \(B\)-splines and penalties. With comments and a rejoinder by the authors
- A MIQCP formulation for B-spline constraints
- Approximations and solution estimates in optimization
- Representability of functions
- A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines
- BARON: A general purpose global optimization software package
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Global optimization of non-convex piecewise linear regression splines
- Global optimization of bounded factorable functions with discontinuities
- Spline function smooth support vector machine for classification
- On Polya frequency functions. IV: The fundamental spline functions and their limits
- Mixed Integer Linear Programming Formulation Techniques
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
- On the Significance of Solving Linear Programming Problems with Some Integer Variables
- Splines in Statistics
- A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
- Piecewise polynomial interpolations and approximations of one-dimensional functions through mixed integer linear programming
- Nonconvex Structures in Nonlinear Programming
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Direct trajectory optimization using nonlinear programming and collocation
- Discontinuous Optimization by Smoothing
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Approximation and compression of piecewise smooth functions
- Finite Element Methods with B-Splines
- Nonlinear Programming
- Surrogate‐based methods for black‐box optimization
- On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions
