One of mathematical problems, that have many practical applications, is the well-known linear complementary problem (LCP) which consists of finding a certain vector that satisfy a set of linear inequalities and complementary equation. In this thesis, after introducing and analyzing a kernel-based primal-dual interior-point method (IPM) for solving LCP, we consider several, fairly general, eligible kernel functions. We show that the algorithm, with some of those kernel functions, has comparable complexity with the best complexity results obtained in the literature for these type of methods. Three basic implementations of the algorithm in MATLAB were used to conduct a series of numerical tests for different kernel functions, showing promising performance.
","abstract_html":"<p>One of mathematical problems, that have many practical applications, is the well-known linear complementary problem (LCP) which consists of finding a certain vector that satisfy a set of linear inequalities and complementary equation. In this thesis, after introducing and analyzing a kernel-based primal-dual interior-point method (IPM) for solving LCP, we consider several, fairly general, eligible kernel functions. We show that the algorithm, with some of those kernel functions, has comparable complexity with the best complexity results obtained in the literature for these type of methods. Three basic implementations of the algorithm in MATLAB were used to conduct a series of numerical tests for different kernel functions, showing promising performance.</p>","abstract_has_math":false,"creators":["Katic, Robert"],"institution":null,"degree_name":"Master of Science in Mathematics (M.S.)","degree_level":"Thesis (restricted to Georgia Southern)","degree_discipline":"Department of Mathematical Sciences","degree_department":null,"school":null,"contributors":["Hua Wang","Yan Wu"],"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","Kernel function","Primal-dual","Interior-point method","Linear complementarity problem","Numerical Analysis and Computation","Other Applied Mathematics","Other Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.georgiasouthern.edu/etd/1304","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Hua Wang","Yan Wu"]},{"key":"dc:creator","label":"Author","values":["Katic, Robert"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2015-06-30T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Department of Mathematical Sciences"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis (restricted to Georgia Southern)"]},{"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","Kernel function","Primal-dual","Interior-point method","Linear complementarity problem","Numerical Analysis and Computation","Other Applied Mathematics","Other Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.georgiasouthern.edu/etd/1304"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["One of mathematical problems, that have many practical applications, is the well-known linear complementary problem (LCP) which consists of finding a certain vector that satisfy a set of linear inequalities and complementary equation. In this thesis, after introducing and analyzing a kernel-based primal-dual interior-point method (IPM) for solving LCP, we consider several, fairly general, eligible kernel functions. We show that the algorithm, with some of those kernel functions, has comparable complexity with the best complexity results obtained in the literature for these type of methods. Three basic implementations of the algorithm in MATLAB were used to conduct a series of numerical tests for different kernel functions, showing promising performance.
"]},{"key":"dc:title","label":"Title","values":["Computational Study of Kernel - Based Interior - Point Method for LCP"]}]}],"canonical_facts":{"dc:contributor":["Hua Wang","Yan Wu"],"dc:creator":["Katic, Robert"],"dc:date.available":["2015-06-30T07:00:00Z"],"dc:description.abstract":["One of mathematical problems, that have many practical applications, is the well-known linear complementary problem (LCP) which consists of finding a certain vector that satisfy a set of linear inequalities and complementary equation. In this thesis, after introducing and analyzing a kernel-based primal-dual interior-point method (IPM) for solving LCP, we consider several, fairly general, eligible kernel functions. We show that the algorithm, with some of those kernel functions, has comparable complexity with the best complexity results obtained in the literature for these type of methods. Three basic implementations of the algorithm in MATLAB were used to conduct a series of numerical tests for different kernel functions, showing promising performance.
"],"dc:identifier":["https://digitalcommons.georgiasouthern.edu/etd/1304"],"dc:subject":["ETD","Kernel function","Primal-dual","Interior-point method","Linear complementarity problem","Numerical Analysis and Computation","Other Applied Mathematics","Other Mathematics"],"dc:title":["Computational Study of Kernel - Based Interior - Point Method for LCP"],"thesis:degree_discipline":["Department of Mathematical Sciences"],"thesis:degree_level":["Thesis (restricted to Georgia Southern)"],"thesis:degree_name":["Master of Science in Mathematics (M.S.)"]},"updated_at":"2026-07-24T02:28:22Z"}