In this thesis, we present a new Feasible Interior-Point Method (IPM) for Linear Complementarity Problem (LPC) over Symmetric Cones. The advantage of this method lies in that it uses full Newton-steps, thus, avoiding the calculation of the step size at each iteration. By suitable choice of parameters we prove the global convergence of iterates which always stay in the the central path neighborhood. A global convergence of the method is proved and an upper bound for the number of iterations necessary to find ε-approximate solution of the problem is presented.
","abstract_html":"<p>In this thesis, we present a new Feasible Interior-Point Method (IPM) for Linear Complementarity Problem (LPC) over Symmetric Cones. The advantage of this method lies in that it uses full Newton-steps, thus, avoiding the calculation of the step size at each iteration. By suitable choice of parameters we prove the global convergence of iterates which always stay in the the central path neighborhood. A global convergence of the method is proved and an upper bound for the number of iterations necessary to find ε-approximate solution of the problem is presented.</p>","abstract_has_math":false,"creators":["Berdnikov, Andrii"],"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":["Alina Iacob","Alex Stokolos"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2013,"date_issued":"2013-01-01T08:00:00Z","date_published":"2013-01-01T08:00:00Z","updated_at":"2026-07-24T02:27:41Z","subjects":["ETD","Linear complementarity Problem","Interior-Point Method","Jordan Euclidean Algebra","Symmetric Cones","Algebra","Numerical Analysis and Computation"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.georgiasouthern.edu/etd/881","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Alina Iacob","Alex Stokolos"]},{"key":"dc:creator","label":"Author","values":["Berdnikov, Andrii"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2013-12-02T08: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","Jordan Euclidean Algebra","Symmetric Cones","Algebra","Numerical Analysis and Computation"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.georgiasouthern.edu/etd/881"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In this thesis, we present a new Feasible Interior-Point Method (IPM) for Linear Complementarity Problem (LPC) over Symmetric Cones. The advantage of this method lies in that it uses full Newton-steps, thus, avoiding the calculation of the step size at each iteration. By suitable choice of parameters we prove the global convergence of iterates which always stay in the the central path neighborhood. A global convergence of the method is proved and an upper bound for the number of iterations necessary to find ε-approximate solution of the problem is presented.
"]},{"key":"dc:title","label":"Title","values":["Full Newton Step Interior Point Method for Linear Complementarity Problem Over Symmetric Cones"]}]}],"canonical_facts":{"dc:contributor":["Alina Iacob","Alex Stokolos"],"dc:creator":["Berdnikov, Andrii"],"dc:date.available":["2013-12-02T08:00:00Z"],"dc:description.abstract":["In this thesis, we present a new Feasible Interior-Point Method (IPM) for Linear Complementarity Problem (LPC) over Symmetric Cones. The advantage of this method lies in that it uses full Newton-steps, thus, avoiding the calculation of the step size at each iteration. By suitable choice of parameters we prove the global convergence of iterates which always stay in the the central path neighborhood. A global convergence of the method is proved and an upper bound for the number of iterations necessary to find ε-approximate solution of the problem is presented.
"],"dc:identifier":["https://digitalcommons.georgiasouthern.edu/etd/881"],"dc:subject":["ETD","Linear complementarity Problem","Interior-Point Method","Jordan Euclidean Algebra","Symmetric Cones","Algebra","Numerical Analysis and Computation"],"dc:title":["Full Newton Step Interior Point Method for Linear Complementarity Problem Over Symmetric Cones"],"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:27:41Z"}