{"id":"https://openalex.org/W2016095019","doi":"https://doi.org/10.1007/bf02108465","title":"A projected conjugate gradient method for sparse minimax problems","display_name":"A projected conjugate gradient method for sparse minimax problems","publication_year":1993,"publication_date":"1993-06-01","ids":{"openalex":"https://openalex.org/W2016095019","doi":"https://doi.org/10.1007/bf02108465","mag":"2016095019"},"language":"en","primary_location":{"id":"doi:10.1007/bf02108465","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02108465","pdf_url":null,"source":{"id":"https://openalex.org/S117494069","display_name":"Numerical Algorithms","issn_l":"1017-1398","issn":["1017-1398","1572-9265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Numerical Algorithms","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/A5022247093","display_name":"Kristj\u00e1n J\u00f3nasson","orcid":"https://orcid.org/0000-0002-9066-3128"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Kristj\u00e1n J\u00f3nasson","raw_affiliation_strings":["Institute for Numerical Analysis, The Technical University of Denmark, DK-2800, Lyngby, Denmark","Institute for Numerical Analysis, The Technical University of Denmark, Lyngby, Denmark"],"affiliations":[{"raw_affiliation_string":"Institute for Numerical Analysis, The Technical University of Denmark, DK-2800, Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]},{"raw_affiliation_string":"Institute for Numerical Analysis, The Technical University of Denmark, Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5022247093"],"corresponding_institution_ids":["https://openalex.org/I96673099"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.14858382,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"5","issue":"6","first_page":"309","last_page":"323"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9883999824523926,"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"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9883999824523926,"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/T11205","display_name":"Numerical methods in inverse problems","score":0.9740999937057495,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9592999815940857,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/conjugate-gradient-method","display_name":"Conjugate gradient method","score":0.7089974880218506},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7020902037620544},{"id":"https://openalex.org/keywords/trust-region","display_name":"Trust region","score":0.6940115094184875},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.684846818447113},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.6505835056304932},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5962308645248413},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5403878688812256},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.5168336033821106},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5080742835998535},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.5022730827331543},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.46281468868255615},{"id":"https://openalex.org/keywords/biconjugate-gradient-stabilized-method","display_name":"Biconjugate gradient stabilized method","score":0.46096986532211304},{"id":"https://openalex.org/keywords/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.45893073081970215},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.44458574056625366},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.44027090072631836},{"id":"https://openalex.org/keywords/numerical-analysis","display_name":"Numerical analysis","score":0.44019052386283875},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.43685969710350037},{"id":"https://openalex.org/keywords/conjugate-residual-method","display_name":"Conjugate residual method","score":0.4289034605026245},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42711761593818665},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.38799533247947693},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2865845859050751},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2835356891155243},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.17365902662277222},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.15259918570518494}],"concepts":[{"id":"https://openalex.org/C81184566","wikidata":"https://www.wikidata.org/wiki/Q1191895","display_name":"Conjugate gradient method","level":2,"score":0.7089974880218506},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7020902037620544},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.6940115094184875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.684846818447113},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.6505835056304932},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5962308645248413},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5403878688812256},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.5168336033821106},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5080742835998535},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.5022730827331543},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.46281468868255615},{"id":"https://openalex.org/C120553275","wikidata":"https://www.wikidata.org/wiki/Q4903720","display_name":"Biconjugate gradient stabilized method","level":3,"score":0.46096986532211304},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.45893073081970215},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.44458574056625366},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.44027090072631836},{"id":"https://openalex.org/C48753275","wikidata":"https://www.wikidata.org/wiki/Q11216","display_name":"Numerical analysis","level":2,"score":0.44019052386283875},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.43685969710350037},{"id":"https://openalex.org/C91394653","wikidata":"https://www.wikidata.org/wiki/Q5161159","display_name":"Conjugate residual method","level":4,"score":0.4289034605026245},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42711761593818665},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.38799533247947693},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2865845859050751},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2835356891155243},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.17365902662277222},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.15259918570518494},{"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","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":1,"locations":[{"id":"doi:10.1007/bf02108465","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02108465","pdf_url":null,"source":{"id":"https://openalex.org/S117494069","display_name":"Numerical Algorithms","issn_l":"1017-1398","issn":["1017-1398","1572-9265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Numerical Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Climate action","score":0.46000000834465027,"id":"https://metadata.un.org/sdg/13"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W45153371","https://openalex.org/W75530403","https://openalex.org/W170686111","https://openalex.org/W1502501036","https://openalex.org/W1981724380","https://openalex.org/W1987556593","https://openalex.org/W2002052347","https://openalex.org/W2018429185","https://openalex.org/W2063767894","https://openalex.org/W2067824962","https://openalex.org/W2075194837","https://openalex.org/W2079901371","https://openalex.org/W2085370962","https://openalex.org/W2094457339","https://openalex.org/W2117861286","https://openalex.org/W2159686234","https://openalex.org/W2912430942","https://openalex.org/W4252894371"],"related_works":["https://openalex.org/W2073922269","https://openalex.org/W2100815210","https://openalex.org/W2018579258","https://openalex.org/W1848849174","https://openalex.org/W2365504875","https://openalex.org/W2356771840","https://openalex.org/W81845748","https://openalex.org/W2744145798","https://openalex.org/W94257380","https://openalex.org/W2118010673"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}