We solve the problem of finding a near-interpolant curve, subject to constraints, which minimizes the bending energy of the curve. Using B-splines as our tools, we give a brief overview of spline properties and develop several different cases of inequality constrained optimization problems of this type. In particular, we develop the active set method and use it to solve these problems, emphasizing the fact that this algorithm will converge to a solution in finite iterations. Our solution will solve an open problem regarding near-interpolant spline curves. Furthermore, we supplement this with an iterative technique for better choosing data sites so as to further minimize the bending energy of the spline curve, offering an easy solution to the problem of free data sites.
","abstract_html":"<p>We solve the problem of finding a near-interpolant curve, subject to constraints, which minimizes the bending energy of the curve. Using B-splines as our tools, we give a brief overview of spline properties and develop several different cases of inequality constrained optimization problems of this type. In particular, we develop the active set method and use it to solve these problems, emphasizing the fact that this algorithm will converge to a solution in finite iterations. Our solution will solve an open problem regarding near-interpolant spline curves. Furthermore, we supplement this with an iterative technique for better choosing data sites so as to further minimize the bending energy of the spline curve, offering an easy solution to the problem of free data sites.</p>","abstract_has_math":false,"creators":["Holloway, Joshua A"],"institution":null,"degree_name":"Master of Science in Mathematics (M.S.)","degree_level":"Thesis (open access)","degree_discipline":"Department of Mathematical Sciences","degree_department":null,"school":null,"contributors":["Xiezhang Li","Hua Wang"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-01-01T08:00:00Z","date_published":"2015-01-01T08:00:00Z","updated_at":"2026-07-24T02:28:22Z","subjects":["ETD","Spline curve","B-Spline","Constrained optimization","Quadratic programming","Active set method","Other Applied Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.georgiasouthern.edu/etd/1308","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Xiezhang Li","Hua Wang"]},{"key":"dc:creator","label":"Author","values":["Holloway, Joshua A"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2015-07-01T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Department of Mathematical Sciences"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis (open access)"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science in Mathematics (M.S.)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["ETD","Spline curve","B-Spline","Constrained optimization","Quadratic programming","Active set method","Other Applied Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.georgiasouthern.edu/etd/1308"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["We solve the problem of finding a near-interpolant curve, subject to constraints, which minimizes the bending energy of the curve. Using B-splines as our tools, we give a brief overview of spline properties and develop several different cases of inequality constrained optimization problems of this type. In particular, we develop the active set method and use it to solve these problems, emphasizing the fact that this algorithm will converge to a solution in finite iterations. Our solution will solve an open problem regarding near-interpolant spline curves. Furthermore, we supplement this with an iterative technique for better choosing data sites so as to further minimize the bending energy of the spline curve, offering an easy solution to the problem of free data sites.
"]},{"key":"dc:title","label":"Title","values":["Solutions of Inequality Constrained Spline Optimization Problems with the Active Set Method"]}]}],"canonical_facts":{"dc:contributor":["Xiezhang Li","Hua Wang"],"dc:creator":["Holloway, Joshua A"],"dc:date.available":["2015-07-01T07:00:00Z"],"dc:description.abstract":["We solve the problem of finding a near-interpolant curve, subject to constraints, which minimizes the bending energy of the curve. Using B-splines as our tools, we give a brief overview of spline properties and develop several different cases of inequality constrained optimization problems of this type. In particular, we develop the active set method and use it to solve these problems, emphasizing the fact that this algorithm will converge to a solution in finite iterations. Our solution will solve an open problem regarding near-interpolant spline curves. Furthermore, we supplement this with an iterative technique for better choosing data sites so as to further minimize the bending energy of the spline curve, offering an easy solution to the problem of free data sites.
"],"dc:identifier":["https://digitalcommons.georgiasouthern.edu/etd/1308"],"dc:subject":["ETD","Spline curve","B-Spline","Constrained optimization","Quadratic programming","Active set method","Other Applied Mathematics"],"dc:title":["Solutions of Inequality Constrained Spline Optimization Problems with the Active Set Method"],"thesis:degree_discipline":["Department of Mathematical Sciences"],"thesis:degree_level":["Thesis (open access)"],"thesis:degree_name":["Master of Science in Mathematics (M.S.)"]},"updated_at":"2026-07-24T02:28:22Z"}