{"id":"https://openalex.org/W1973338922","doi":"https://doi.org/10.1080/10556780600627552","title":"Combined projected gradient algorithm for linear programming","display_name":"Combined projected gradient algorithm for linear programming","publication_year":2006,"publication_date":"2006-06-27","ids":{"openalex":"https://openalex.org/W1973338922","doi":"https://doi.org/10.1080/10556780600627552","mag":"1973338922"},"language":"en","primary_location":{"id":"doi:10.1080/10556780600627552","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780600627552","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/A5100318457","display_name":"Wei Li","orcid":"https://orcid.org/0000-0003-4589-2711"},"institutions":[{"id":"https://openalex.org/I50760025","display_name":"Hangzhou Dianzi University","ror":"https://ror.org/0576gt767","country_code":"CN","type":"education","lineage":["https://openalex.org/I50760025"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Wei Li","raw_affiliation_strings":["School of Science, Hangzhou Dianzi University, Hangzhou, 310018, P.R. China","School of Science, Hangzhou Dianzi University, Hangzhou, 310018, P. R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Science, Hangzhou Dianzi University, Hangzhou, 310018, P.R. China","institution_ids":["https://openalex.org/I50760025"]},{"raw_affiliation_string":"School of Science, Hangzhou Dianzi University, Hangzhou, 310018, P. R. China","institution_ids":["https://openalex.org/I50760025"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045437510","display_name":"Ping-Qi PAN","orcid":"https://orcid.org/0000-0001-5413-1573"},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ping-Qi Pan","raw_affiliation_strings":["Department of Mathematics, Southeast University, Nanjing, 210096, P.R. China","Department of Mathematics, Southeast University, Nanjing 210096, P. R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Southeast University, Nanjing, 210096, P.R. China","institution_ids":["https://openalex.org/I76569877"]},{"raw_affiliation_string":"Department of Mathematics, Southeast University, Nanjing 210096, P. R. China","institution_ids":["https://openalex.org/I76569877"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043628347","display_name":"Guangting Chen","orcid":"https://orcid.org/0000-0003-3013-3325"},"institutions":[{"id":"https://openalex.org/I50760025","display_name":"Hangzhou Dianzi University","ror":"https://ror.org/0576gt767","country_code":"CN","type":"education","lineage":["https://openalex.org/I50760025"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guangting Chen","raw_affiliation_strings":["School of Science, Hangzhou Dianzi University, Hangzhou, 310018, P.R. China","School of Science, Hangzhou Dianzi University, Hangzhou, 310018, P. R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Science, Hangzhou Dianzi University, Hangzhou, 310018, P.R. China","institution_ids":["https://openalex.org/I50760025"]},{"raw_affiliation_string":"School of Science, Hangzhou Dianzi University, Hangzhou, 310018, P. R. China","institution_ids":["https://openalex.org/I50760025"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100318457"],"corresponding_institution_ids":["https://openalex.org/I50760025"],"apc_list":null,"apc_paid":null,"fwci":0.4303,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.5974026,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"21","issue":"4","first_page":"541","last_page":"550"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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.9976000189781189,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9943000078201294,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/degeneracy","display_name":"Degeneracy (biology)","score":0.8540374040603638},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.8076128959655762},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6635967493057251},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6257801055908203},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5738598704338074},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.53849858045578},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5018372535705566},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.4198625683784485},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3360080122947693},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06492975354194641}],"concepts":[{"id":"https://openalex.org/C2777727622","wikidata":"https://www.wikidata.org/wiki/Q5251772","display_name":"Degeneracy (biology)","level":2,"score":0.8540374040603638},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.8076128959655762},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6635967493057251},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6257801055908203},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5738598704338074},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.53849858045578},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5018372535705566},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.4198625683784485},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3360080122947693},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06492975354194641},{"id":"https://openalex.org/C60644358","wikidata":"https://www.wikidata.org/wiki/Q128570","display_name":"Bioinformatics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556780600627552","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780600627552","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1493426390","https://openalex.org/W1509805685","https://openalex.org/W1986414193","https://openalex.org/W2017497050","https://openalex.org/W2040063808","https://openalex.org/W2086095490","https://openalex.org/W2132250012","https://openalex.org/W2363953851","https://openalex.org/W4255870372","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2965106131","https://openalex.org/W2114808974","https://openalex.org/W2094757704","https://openalex.org/W25030584","https://openalex.org/W29231041","https://openalex.org/W2610104823","https://openalex.org/W2074889170","https://openalex.org/W2092044038","https://openalex.org/W2144582354","https://openalex.org/W3125179639"],"abstract_inverted_index":{"The":[0,77],"pivot":[1,26,81],"algorithm":[2,6,69,79],"and":[3,10,82,108],"interior":[4,83],"point":[5,40,84],"are":[7,120],"two":[8],"diverging":[9],"competitive":[11],"types":[12],"of":[13,21,25,95,105,117],"algorithms":[14,27],"for":[15],"solving":[16],"linear":[17],"programming":[18],"problems.":[19],"One":[20],"the":[22,71,93],"main":[23],"disadvantages":[24],"is":[28],"that":[29,73],"they":[30],"suffer":[31],"from":[32,37,98],"problems":[33,119],"especially":[34],"stalling,":[35],"arising":[36,97],"degeneracy.":[38],"Interior":[39],"methods,":[41],"although":[42],"not":[43,90],"affected":[44],"by":[45],"degeneracy,":[46,99],"require":[47],"a":[48,60,103,115],"purification":[49],"procedure":[50],"to":[51],"obtain":[52],"an":[53],"exact":[54,106],"optimal":[55,110],"solution.":[56],"This":[57],"paper":[58],"derives":[59],"new":[61,78],"general-purpose":[62],"solution":[63],"algorithm,":[64],"called":[65],"combined":[66],"projected":[67],"gradient":[68],"with":[70],"proof":[72],"it":[74],"converges":[75],"successfully.":[76],"combines":[80],"techniques":[85],"naturally.":[86],"It":[87],"in":[88],"fact":[89],"only":[91],"reduces":[92],"possibility":[94],"difficulty":[96],"but":[100],"also":[101],"reaches":[102],"pair":[104],"primal":[107],"dual":[109],"solutions.":[111],"Numerical":[112],"results":[113],"on":[114],"group":[116],"NETLIB":[118],"encouraging.":[121]},"counts_by_year":[{"year":2013,"cited_by_count":26}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}