{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T21:10:05Z","timestamp":1792789805735,"version":"4.5.0"},"reference-count":24,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2004,2,1]],"date-time":"2004-02-01T00:00:00Z","timestamp":1075593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Applied Mathematics and Computation"],"published-print":{"date-parts":[[2004,2]]},"DOI":"10.1016\/s0096-3003(03)00179-6","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T22:33:30Z","timestamp":1049495610000},"page":"783-798","source":"Crossref","is-referenced-by-count":14,"title":["Least squares splines with free knots: global optimization approach"],"prefix":"10.1016","volume":"149","author":[{"given":"Gleb","family":"Beliakov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0096-3003(03)00179-6_BIB1","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0893-9659(98)00179-7","article-title":"Cutting angle method in global optimization","volume":"12","author":"Andramonov","year":"1999","journal-title":"Appl. Math. Lett."},{"key":"10.1016\/S0096-3003(03)00179-6_BIB2","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1023\/A:1019204407420","article-title":"Global minimization of increasing positively homogeneous function over the unit simplex","volume":"98","author":"Bagirov","year":"2000","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0096-3003(03)00179-6_BIB3","series-title":"Convex Analysis and Global Optimization","article-title":"Modified versions of the cutting angle method","author":"Bagirov","year":"2001"},{"key":"10.1016\/S0096-3003(03)00179-6_BIB4","first-page":"75","article-title":"Derivative-free methods for unconstrained nonsmooth optimization and its numerical analysis","volume":"19","author":"Bagirov","year":"1999","journal-title":"J. Invest. Oper."},{"key":"10.1016\/S0096-3003(03)00179-6_BIB5","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1023\/A:1020256900863","article-title":"Fast algorithm for the cutting angle method of global optimization","volume":"25","author":"Batten","year":"2002","journal-title":"J. Global Optim."},{"key":"10.1016\/S0096-3003(03)00179-6_BIB6","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/BF02837633","article-title":"Shape preserving approximation using least squares splines","volume":"16","author":"Beliakov","year":"2000","journal-title":"Approx. Theory Appl."},{"key":"10.1016\/S0096-3003(03)00179-6_BIB7","series-title":"A Practical Guide to Splines","author":"de Boor","year":"1978"},{"key":"10.1016\/S0096-3003(03)00179-6_BIB8","series-title":"Curve and Surface Fitting with Splines","author":"Dierckx","year":"1995"},{"key":"10.1016\/S0096-3003(03)00179-6_BIB9","series-title":"Introduction to Global Optimization","author":"Horst","year":"1995"},{"key":"10.1016\/S0096-3003(03)00179-6_BIB10","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1093\/imanum\/13.3.365","article-title":"An algorithm for data reduction using splines with free knots","volume":"13","author":"Hu","year":"1993","journal-title":"IMA J. Numer. Anal."},{"key":"10.1016\/S0096-3003(03)00179-6_BIB11","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1137\/0715022","article-title":"Approximation to data by splines with free knots","volume":"15","author":"Jupp","year":"1978","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/S0096-3003(03)00179-6_BIB12","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0021-9290(82)90041-0","article-title":"On practical evaluation of differentiation techniques for human gait analysis","volume":"5","author":"Lanshammar","year":"1982","journal-title":"J. Biomech."},{"key":"10.1016\/S0096-3003(03)00179-6_BIB13","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1093\/imanum\/11.3.393","article-title":"On the best least squares approximation of continuous functions using linear splines with free knots","volume":"11","author":"Loach","year":"1991","journal-title":"IMA J. Numer. Anal."},{"key":"10.1016\/S0096-3003(03)00179-6_BIB14","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1093\/imanum\/8.2.185","article-title":"A data reduction strategy for splines with applications to the approximation of functions and data","volume":"8","author":"Lyche","year":"1988","journal-title":"IMA J. Numer. Anal."},{"key":"10.1016\/S0096-3003(03)00179-6_BIB15","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1023\/A:1022346030560","article-title":"The sensitivity of a spline function to perturbations of the knots","volume":"39","author":"Lyche","year":"1999","journal-title":"BIT"},{"key":"10.1016\/S0096-3003(03)00179-6_BIB16","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1090\/S0025-5718-1989-0969492-7","article-title":"Algorithms for piecewise polynomials and splines with free knots","volume":"53","author":"Meinardus","year":"1989","journal-title":"Math. Comp."},{"key":"10.1016\/S0096-3003(03)00179-6_BIB17","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1007\/BF01580583","article-title":"An algorithm for finding the global maximum of a multimodal, multivariate function","volume":"34","author":"Mladineo","year":"1986","journal-title":"Math. Progr."},{"key":"10.1016\/S0096-3003(03)00179-6_BIB18","series-title":"Foundations of Mathematical Optimization (Convex Analysis with Linearity)","author":"Pallachke","year":"1997"},{"key":"10.1016\/S0096-3003(03)00179-6_BIB19","series-title":"Abstract Convexity and Global Optimization","author":"Rubinov","year":"2000"},{"key":"10.1016\/S0096-3003(03)00179-6_BIB20","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1080\/10556789908805740","article-title":"Lipschitz programming via increasing convex-along-rays functions","volume":"10","author":"Rubinov","year":"1999","journal-title":"Optim. Meth. Software"},{"key":"10.1016\/S0096-3003(03)00179-6_BIB21","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1016\/0167-8396(95)00029-1","article-title":"Shape-preserving knot removal","volume":"13","author":"Schumaker","year":"1996","journal-title":"Comp. Aided Geom. Des."},{"key":"10.1016\/S0096-3003(03)00179-6_BIB22","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02510176","article-title":"Constrained approximation by splines with free knots","volume":"37","author":"Schutze","year":"1997","journal-title":"BIT"},{"key":"10.1016\/S0096-3003(03)00179-6_BIB23","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01732610","article-title":"Least squares approximation by splines with free knots","volume":"35","author":"Schwetlick","year":"1995","journal-title":"BIT"},{"key":"10.1016\/S0096-3003(03)00179-6_BIB24","series-title":"Global Optimization","author":"Torn","year":"1989"}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300303001796?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300303001796?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T05:00:10Z","timestamp":1733979610000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096300303001796"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,2]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,2]]}},"alternative-id":["S0096300303001796"],"URL":"https:\/\/doi.org\/10.1016\/s0096-3003(03)00179-6","relation":{},"ISSN":["0096-3003"],"issn-type":[{"value":"0096-3003","type":"print"}],"subject":[],"published":{"date-parts":[[2004,2]]}}}