Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach (Q1652420): Difference between revisions

Latest revision as of 01:06, 11 December 2024

scientific article

Language	Label	Description	Also known as
English	Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach	scientific article

Statements

instance of

scholarly article

0 references

title

Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach (English)

0 references

0 references

0 references

0 references

Computers \& Operations Research

0 references

publication date

11 July 2018

0 references

zbMATH Keywords

polynomial B-spline

0 references

global optimization

0 references

polynomial optimization

0 references

unconstrained optimization

0 references

describes a project that uses

Database of Polynomial Systems

0 references

0 references

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.cor.2017.02.013

0 references

cites work

Introduction to Interval Analysis

0 references

Q4273944

0 references

Q4851610

0 references

Q4229394

0 references

Solving Nonconvex Optimization Problems in Systems and Control: A Polynomial B-spline Approach

0 references

Q4277813

0 references

Q4445267

0 references

GloptiPoly

0 references

Test examples for nonlinear programming codes

0 references

Methods for bounding the range of a polynomial

0 references

Interval approximation of higher order to the ranges of functions

0 references

Computing the range of values of real functions using B-spline form

0 references

Q3207999

0 references

An algorithm for global optimization using the Taylor-Bernstein form as inclusion function

0 references

Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach

0 references

Q3707258

0 references

Q4040272

0 references

On the selection of subdivision directions in interval branch-and-bound methods for global optimization

0 references

A polyhedral branch-and-cut approach to global optimization

0 references

Identifiers

zbMATH Open document ID

1391.90490

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

10.1016/J.COR.2017.02.013

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1652420

@@ Property / DOI @@
-.1016/j.cor.2017.02.013
@@ Property / DOI: 10.1016/j.cor.2017.02.013 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+PASCAL-XSC
@@ Property / describes a project that uses: PASCAL-XSC / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Matlab
@@ Property / describes a project that uses: Matlab / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2017.02.013
+Normal rank
@@ Property / OpenAlex ID @@
+W2589474648
@@ Property / OpenAlex ID: W2589474648 / rank @@
+Normal rank
@@ Property / cites work @@
+Introduction to Interval Analysis
@@ Property / cites work: Introduction to Interval Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Q4273944
@@ Property / cites work: Q4273944 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4851610
@@ Property / cites work: Q4851610 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4229394
@@ Property / cites work: Q4229394 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Nonconvex Optimization Problems in Systems and Control: A Polynomial B-spline Approach
+Normal rank
@@ Property / cites work @@
+Q4277813
@@ Property / cites work: Q4277813 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4445267
@@ Property / cites work: Q4445267 / rank @@
+Normal rank
@@ Property / cites work @@
+GloptiPoly
@@ Property / cites work: GloptiPoly / rank @@
+Normal rank
@@ Property / cites work @@
+Test examples for nonlinear programming codes
@@ Property / cites work: Test examples for nonlinear programming codes / rank @@
+Normal rank
@@ Property / cites work @@
+Methods for bounding the range of a polynomial
@@ Property / cites work: Methods for bounding the range of a polynomial / rank @@
+Normal rank
@@ Property / cites work @@
+Interval approximation of higher order to the ranges of functions
+Normal rank
@@ Property / cites work @@
+Computing the range of values of real functions using B-spline form
+Normal rank
@@ Property / cites work @@
+Q3207999
@@ Property / cites work: Q3207999 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for global optimization using the Taylor-Bernstein form as inclusion function
+Normal rank
@@ Property / cites work @@
+Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
+Normal rank
@@ Property / cites work @@
+Q3707258
@@ Property / cites work: Q3707258 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040272
@@ Property / cites work: Q4040272 / rank @@
+Normal rank
@@ Property / cites work @@
+On the selection of subdivision directions in interval branch-and-bound methods for global optimization
+Normal rank
@@ Property / cites work @@
+A polyhedral branch-and-cut approach to global optimization
+Normal rank
@@ Property / DOI @@
+.1016/J.COR.2017.02.013
@@ Property / DOI: 10.1016/J.COR.2017.02.013 / rank @@
+Normal rank