Home ›
Entities
› academia
› Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: The single and multi-segment polynomial B-spline approach
Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: The single and multi-segment polynomial B-spline approach
Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: The single and multi-segment polynomial B-spline approach
Summary
Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: The single and multi-segment polynomial B-spline approach is a scholarly article[1].
Key Facts
Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: The single and multi-segment polynomial B-spline approach's instance of is recorded as scholarly article[2].
References
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
APA4ort.xyz Knowledge Graph. (2026). Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: The single and multi-segment polynomial B-spline approach. Retrieved May 24, 2026, from https://4ort.xyz/entity/algorithms-for-unconstrained-global-optimization-of-nonlinear-polynomial-programming-problems-the-single-and-multi-segme
MLA“Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: The single and multi-segment polynomial B-spline approach.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/algorithms-for-unconstrained-global-optimization-of-nonlinear-polynomial-programming-problems-the-single-and-multi-segme.
BibTeX@misc{4ortxyz_algorithms-for-unconstrained-global-optimization-of-nonlinear-polynomial-programming-problems-the-single-and-multi-segme_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: The single and multi-segment polynomial B-spline approach}}, year = {2026}, url = {https://4ort.xyz/entity/algorithms-for-unconstrained-global-optimization-of-nonlinear-polynomial-programming-problems-the-single-and-multi-segme}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: The single and multi-segment polynomial B-spline approach — https://4ort.xyz/entity/algorithms-for-unconstrained-global-optimization-of-nonlinear-polynomial-programming-problems-the-single-and-multi-segme (retrieved 2026-05-24)
