Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach
From MaRDI portal
Publication:1652420
DOI10.1016/j.cor.2017.02.013zbMath1391.90490OpenAlexW2589474648MaRDI QIDQ1652420
D. D. Gawali, Paluri S. V. Nataraj, Ahmed Zidna
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.02.013
Numerical computation using splines (65D07) Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Spline approximation (41A15)
Related Items (2)
On linear programming relaxations for solving polynomial programming problems ⋮ An integrative approach for analysis of nonlinear electrical circuits using-polynomial B-spline expansion and B-spline Krawczyk operator
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the range of values of real functions using B-spline form
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
- Test examples for nonlinear programming codes
- A polyhedral branch-and-cut approach to global optimization
- An algorithm for global optimization using the Taylor-Bernstein form as inclusion function
- Methods for bounding the range of a polynomial
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization
- Interval approximation of higher order to the ranges of functions
- Introduction to Interval Analysis
- Solving Nonconvex Optimization Problems in Systems and Control: A Polynomial B-spline Approach
- GloptiPoly
This page was built for publication: Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach
