{"id":"https://openalex.org/W2171614919","doi":"https://doi.org/10.1080/10556780902752785","title":"A deficient-basis dual counterpart of Paparrizos, Samaras and Stephanides\u2019 primal-dual simplex-type algorithm\u2020","display_name":"A deficient-basis dual counterpart of Paparrizos, Samaras and Stephanides\u2019 primal-dual simplex-type algorithm\u2020","publication_year":2009,"publication_date":"2009-02-26","ids":{"openalex":"https://openalex.org/W2171614919","doi":"https://doi.org/10.1080/10556780902752785","mag":"2171614919"},"language":"en","primary_location":{"id":"doi:10.1080/10556780902752785","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780902752785","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","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/A5080430870","display_name":"Pablo Guerrero-Garc\u0131\u0301a","orcid":"https://orcid.org/0000-0003-3126-0078"},"institutions":[{"id":"https://openalex.org/I82767444","display_name":"Universidad de M\u00e1laga","ror":"https://ror.org/036b2ww28","country_code":"ES","type":"education","lineage":["https://openalex.org/I82767444"]}],"countries":["ES"],"is_corresponding":true,"raw_author_name":"Pablo Guerrero-Garc\u00eda","raw_affiliation_strings":["Department of Applied Mathematics , University of M\u00e1laga , 29071, M\u00e1laga, Spain"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics , University of M\u00e1laga , 29071, M\u00e1laga, Spain","institution_ids":["https://openalex.org/I82767444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086166044","display_name":"\u00c1ngel Santos-Palomo","orcid":null},"institutions":[{"id":"https://openalex.org/I82767444","display_name":"Universidad de M\u00e1laga","ror":"https://ror.org/036b2ww28","country_code":"ES","type":"education","lineage":["https://openalex.org/I82767444"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"\u00c1ngel Santos-Palomo","raw_affiliation_strings":["Department of Applied Mathematics , University of M\u00e1laga , 29071, M\u00e1laga, Spain"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics , University of M\u00e1laga , 29071, M\u00e1laga, Spain","institution_ids":["https://openalex.org/I82767444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5080430870"],"corresponding_institution_ids":["https://openalex.org/I82767444"],"apc_list":null,"apc_paid":null,"fwci":0.4752,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.68979685,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"24","issue":"2","first_page":"187","last_page":"204"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"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":0.9998000264167786,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9882000088691711,"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/simplex","display_name":"Simplex","score":0.7311320304870605},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.722844660282135},{"id":"https://openalex.org/keywords/cholesky-decomposition","display_name":"Cholesky decomposition","score":0.612601637840271},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.6017299890518188},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.5724300742149353},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5710607767105103},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46600446105003357},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4470057487487793},{"id":"https://openalex.org/keywords/least-squares-function-approximation","display_name":"Least-squares function approximation","score":0.4188682436943054},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4057428240776062},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37358030676841736},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.15539535880088806}],"concepts":[{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.7311320304870605},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.722844660282135},{"id":"https://openalex.org/C34727166","wikidata":"https://www.wikidata.org/wiki/Q515375","display_name":"Cholesky decomposition","level":3,"score":0.612601637840271},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.6017299890518188},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.5724300742149353},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5710607767105103},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46600446105003357},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4470057487487793},{"id":"https://openalex.org/C9936470","wikidata":"https://www.wikidata.org/wiki/Q6510405","display_name":"Least-squares function approximation","level":3,"score":0.4188682436943054},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4057428240776062},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37358030676841736},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.15539535880088806},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/10556780902752785","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780902752785","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.104.3409","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.3409","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.satd.uma.es/matap/investig/tr/ma07_01.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W17198020","https://openalex.org/W70151521","https://openalex.org/W81069787","https://openalex.org/W102721416","https://openalex.org/W1593443060","https://openalex.org/W1965005420","https://openalex.org/W1980375371","https://openalex.org/W2009043297","https://openalex.org/W2017497050","https://openalex.org/W2019319378","https://openalex.org/W2036438040","https://openalex.org/W2047110758","https://openalex.org/W2113043717","https://openalex.org/W2132236914","https://openalex.org/W2141002044","https://openalex.org/W2149454052","https://openalex.org/W2167553361","https://openalex.org/W2345370749"],"related_works":["https://openalex.org/W2133667137","https://openalex.org/W2380756614","https://openalex.org/W2384679317","https://openalex.org/W2477407501","https://openalex.org/W1570109187","https://openalex.org/W2366013513","https://openalex.org/W3125083766","https://openalex.org/W4244786412","https://openalex.org/W2028887049","https://openalex.org/W3143155029"],"abstract_inverted_index":{"...":[0],"their":[1],"authors":[2],"show":[3],"how":[4,44,68],"to":[5,45,66,131],"take":[6,46],"advantage":[7,47],"of":[8,11,36,48,51,97,112,119],"the":[9,24,49,69,75,98,133],"knowledge":[10,50],"a":[12,20,52,57,87,113],"primal":[13],"feasible":[14,54],"point":[15,55],"and":[16,86,121,141],"they":[17],"work":[18],"with":[19,79],"square":[21],"basis":[22],"during":[23],"whole":[25],"process.":[26],"In":[27],"this":[28],"paper":[29],"we":[30,108],"address":[31],"what":[32],"could":[33],"be":[34],"thought":[35],"as":[37],"its":[38],"deficient-basis":[39,58],"dual":[40,53,81,84,99],"counterpart":[41],"by":[42,91],"showing":[43],"in":[56,117],"simplex-type":[59],"environment.":[60],"Three":[61],"small":[62],"examples":[63],"are":[64,105],"given":[65],"illustrate":[67],"specific":[70],"pivoting":[71],"rules":[72],"designed":[73],"for":[74],"proposed":[76],"algorithm":[77],"deal":[78],"unbounded":[80],"objectives,":[82],"non-unique":[83],"solutions":[85],"classical":[88],"exponential":[89],"example":[90],"Goldfarb,":[92],"thus":[93],"avoiding":[94],"some":[95,110],"caveats":[96],"simplex":[100],"method.":[101],"No":[102],"computational":[103],"results":[104],"reported,":[106],"but":[107],"sketch":[109],"details":[111],"sparse":[114,124],"projected-gradient":[115],"implementation":[116],"terms":[118],"Davis":[120],"Hager\u2019s":[122],"cholmod":[123],"Cholesky":[125],"factorization":[126],"(which":[127],"is":[128],"row":[129],"updatable/downdatable)":[130],"solve":[132],"underlying":[134],"least-squares":[135,139],"subproblems,":[136],"namely":[137],"linear":[138,144],"problems":[140],"projections":[142],"onto":[143],"manifolds.":[145]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":25},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}