{"id":"https://openalex.org/W2020833697","doi":"https://doi.org/10.1137/0803024","title":"A Noninterior Continuation Method for Quadratic and Linear Programming","display_name":"A Noninterior Continuation Method for Quadratic and Linear Programming","publication_year":1993,"publication_date":"1993-08-01","ids":{"openalex":"https://openalex.org/W2020833697","doi":"https://doi.org/10.1137/0803024","mag":"2020833697"},"language":"en","primary_location":{"id":"doi:10.1137/0803024","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0803024","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5112191147","display_name":"Bintong Chen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bintong Chen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5019512091","display_name":"Patrick T. Harker","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Patrick T. Harker","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.884,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.85528942,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"3","issue":"3","first_page":"503","last_page":"515"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9930999875068665,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/linear-complementarity-problem","display_name":"Linear complementarity problem","score":0.8113642930984497},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7800226807594299},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.7755681276321411},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6944091320037842},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.6828078031539917},{"id":"https://openalex.org/keywords/criss-cross-algorithm","display_name":"Criss-cross algorithm","score":0.5957270860671997},{"id":"https://openalex.org/keywords/continuation","display_name":"Continuation","score":0.5675749778747559},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5664336085319519},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.555036723613739},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.536882758140564},{"id":"https://openalex.org/keywords/complementarity","display_name":"Complementarity (molecular biology)","score":0.5311666131019592},{"id":"https://openalex.org/keywords/second-order-cone-programming","display_name":"Second-order cone programming","score":0.4850996732711792},{"id":"https://openalex.org/keywords/mixed-complementarity-problem","display_name":"Mixed complementarity problem","score":0.46858519315719604},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4476991593837738},{"id":"https://openalex.org/keywords/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.43065375089645386},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.425165593624115},{"id":"https://openalex.org/keywords/complementarity-theory","display_name":"Complementarity theory","score":0.41611388325691223},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4076560139656067},{"id":"https://openalex.org/keywords/linear-fractional-programming","display_name":"Linear-fractional programming","score":0.374087929725647},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16410645842552185},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.11143282055854797},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.08460786938667297}],"concepts":[{"id":"https://openalex.org/C34320192","wikidata":"https://www.wikidata.org/wiki/Q783105","display_name":"Linear complementarity problem","level":3,"score":0.8113642930984497},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7800226807594299},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.7755681276321411},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6944091320037842},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.6828078031539917},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.5957270860671997},{"id":"https://openalex.org/C88626702","wikidata":"https://www.wikidata.org/wiki/Q1128903","display_name":"Continuation","level":2,"score":0.5675749778747559},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5664336085319519},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.555036723613739},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.536882758140564},{"id":"https://openalex.org/C202269582","wikidata":"https://www.wikidata.org/wiki/Q2644277","display_name":"Complementarity (molecular biology)","level":2,"score":0.5311666131019592},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.4850996732711792},{"id":"https://openalex.org/C77196050","wikidata":"https://www.wikidata.org/wiki/Q6883962","display_name":"Mixed complementarity problem","level":3,"score":0.46858519315719604},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4476991593837738},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.43065375089645386},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.425165593624115},{"id":"https://openalex.org/C85404239","wikidata":"https://www.wikidata.org/wiki/Q5156417","display_name":"Complementarity theory","level":3,"score":0.41611388325691223},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4076560139656067},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.374087929725647},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16410645842552185},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.11143282055854797},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.08460786938667297},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0803024","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0803024","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W51359543","https://openalex.org/W1533868172","https://openalex.org/W1968425795","https://openalex.org/W1973117121","https://openalex.org/W2011419097","https://openalex.org/W2030674458","https://openalex.org/W2055978654","https://openalex.org/W2065554534","https://openalex.org/W2065691568","https://openalex.org/W2074316151","https://openalex.org/W2131448432","https://openalex.org/W2154951198","https://openalex.org/W2168825111","https://openalex.org/W2318205745","https://openalex.org/W2611147814"],"related_works":["https://openalex.org/W4289075993","https://openalex.org/W1979597395","https://openalex.org/W2994981659","https://openalex.org/W2043587525","https://openalex.org/W2052159915","https://openalex.org/W2349445207","https://openalex.org/W2571013927","https://openalex.org/W1480635288","https://openalex.org/W2046380970","https://openalex.org/W1985553727"],"abstract_inverted_index":{"The":[0,27],"noninterior":[1],"point":[2,40],"path-following":[3,41],"algorithm":[4,29],"presented":[5],"by":[6],"the":[7,14,38],"authors":[8],"in":[9],"1990":[10],"is":[11,30],"specialized":[12],"to":[13],"mixed":[15],"linear":[16,25],"complementarity":[17],"problem":[18],"and":[19,24],"its":[20],"special":[21],"cases":[22],"(quadratic":[23],"programming).":[26],"new":[28],"related":[31],"to,":[32],"but":[33],"has":[34],"several":[35],"advantages":[36],"over,":[37],"interior":[39],"algorithms.":[42]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}