In this tesis, we present a new Infeasible Interior-Point Method (IPM) for monotone Linear Complementarity Problem (LPC). The advantage of the method is that it uses full Newton-steps, thus, avoiding the calculation of the step size at each iteration. However, by suitable choice of parameters the iterates are forced to stay in the neighborhood of the central path, hence, still guaranteeing the global convergence of the method under strict feasibility assumption. The number of iterations necessary to find -approximate solution of the problem matches the best known iteration bounds for these types of methods. The preliminary implementation of the method and numerical results indicate robustness and practical validity of the method.
","abstract_html":"<p>In this tesis, we present a new Infeasible Interior-Point Method (IPM) for monotone Linear Complementarity Problem (LPC). The advantage of the method is that it uses full Newton-steps, thus, avoiding the calculation of the step size at each iteration. However, by suitable choice of parameters the iterates are forced to stay in the neighborhood of the central path, hence, still guaranteeing the global convergence of the method under strict feasibility assumption. The number of iterations necessary to find -approximate solution of the problem matches the best known iteration bounds for these types of methods. The preliminary implementation of the method and numerical results indicate robustness and practical validity of the method.</p>","abstract_has_math":false,"creators":["Drummer, Antré Marquel"],"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":["Scott Kersey","Frederick Mynard"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2012,"date_issued":"2012-01-01T08:00:00Z","date_published":"2012-01-01T08:00:00Z","updated_at":"2026-07-24T02:26:17Z","subjects":["ETD","Linear complementarity problem","Interior-point method","Full Newton-step","Polynomial convergence","Applied Mathematics","Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.georgiasouthern.edu/etd/18","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Scott Kersey","Frederick Mynard"]},{"key":"dc:creator","label":"Author","values":["Drummer, Antré Marquel"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2013-07-19T07: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","Linear complementarity problem","Interior-point method","Full Newton-step","Polynomial convergence","Applied Mathematics","Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.georgiasouthern.edu/etd/18"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In this tesis, we present a new Infeasible Interior-Point Method (IPM) for monotone Linear Complementarity Problem (LPC). The advantage of the method is that it uses full Newton-steps, thus, avoiding the calculation of the step size at each iteration. However, by suitable choice of parameters the iterates are forced to stay in the neighborhood of the central path, hence, still guaranteeing the global convergence of the method under strict feasibility assumption. The number of iterations necessary to find -approximate solution of the problem matches the best known iteration bounds for these types of methods. The preliminary implementation of the method and numerical results indicate robustness and practical validity of the method.
"]},{"key":"dc:title","label":"Title","values":["Infeasible Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems"]}]}],"canonical_facts":{"dc:contributor":["Scott Kersey","Frederick Mynard"],"dc:creator":["Drummer, Antré Marquel"],"dc:date.available":["2013-07-19T07:00:00Z"],"dc:description.abstract":["In this tesis, we present a new Infeasible Interior-Point Method (IPM) for monotone Linear Complementarity Problem (LPC). The advantage of the method is that it uses full Newton-steps, thus, avoiding the calculation of the step size at each iteration. However, by suitable choice of parameters the iterates are forced to stay in the neighborhood of the central path, hence, still guaranteeing the global convergence of the method under strict feasibility assumption. The number of iterations necessary to find -approximate solution of the problem matches the best known iteration bounds for these types of methods. The preliminary implementation of the method and numerical results indicate robustness and practical validity of the method.
"],"dc:identifier":["https://digitalcommons.georgiasouthern.edu/etd/18"],"dc:subject":["ETD","Linear complementarity problem","Interior-point method","Full Newton-step","Polynomial convergence","Applied Mathematics","Mathematics"],"dc:title":["Infeasible Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems"],"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:26:17Z"}