{"id":"https://openalex.org/W1724112669","doi":"https://doi.org/10.1023/a:1018322318259","title":"Minimizing a Sum of Norms Subject to Linear Equality Constraints","display_name":"Minimizing a Sum of Norms Subject to Linear Equality Constraints","publication_year":1998,"publication_date":"1998-10-01","ids":{"openalex":"https://openalex.org/W1724112669","doi":"https://doi.org/10.1023/a:1018322318259","mag":"1724112669"},"language":"en","primary_location":{"id":"doi:10.1023/a:1018322318259","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1018322318259","pdf_url":null,"source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"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":"Computational Optimization and Applications","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/A5063394505","display_name":"Knud D. Andersen","orcid":null},"institutions":[{"id":"https://openalex.org/I95674353","display_name":"UCLouvain","ror":"https://ror.org/02495e989","country_code":"BE","type":"education","lineage":["https://openalex.org/I95674353"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Knud D. Andersen","raw_affiliation_strings":["Universit\u00e9 Catholique de Louvain, Belgium","CORE, Universit\u00e9 Catholique de Louvain, Belgium. E-mail: kda@eka.globalnet.co.uk#TAB#"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Catholique de Louvain, Belgium","institution_ids":["https://openalex.org/I95674353"]},{"raw_affiliation_string":"CORE, Universit\u00e9 Catholique de Louvain, Belgium. E-mail: kda@eka.globalnet.co.uk#TAB#","institution_ids":["https://openalex.org/I95674353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065605352","display_name":"Edmund Christiansen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Edmund Christiansen","raw_affiliation_strings":["Department of Mathematics and Computer Science, Odense University, Denmark","Department of Mathematics and Computer Science,  Odense University, Denmark. E-mail: edc@imada.ou.dk"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Odense University, Denmark","institution_ids":[]},{"raw_affiliation_string":"Department of Mathematics and Computer Science,  Odense University, Denmark. E-mail: edc@imada.ou.dk","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5063394505"],"corresponding_institution_ids":["https://openalex.org/I95674353"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":3.254,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.91948399,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"11","issue":"1","first_page":"65","last_page":"79"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9660000205039978,"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.9660000205039978,"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/mathematics","display_name":"Mathematics","score":0.8566739559173584},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.703757643699646},{"id":"https://openalex.org/keywords/duality-gap","display_name":"Duality gap","score":0.6406310200691223},{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.637478768825531},{"id":"https://openalex.org/keywords/strong-duality","display_name":"Strong duality","score":0.5850580930709839},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4719088673591614},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4552227258682251},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.4507661759853363},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.44995149970054626},{"id":"https://openalex.org/keywords/numerical-analysis","display_name":"Numerical analysis","score":0.4279938340187073},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.33526837825775146},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2485625147819519},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.23519638180732727}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8566739559173584},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.703757643699646},{"id":"https://openalex.org/C5274546","wikidata":"https://www.wikidata.org/wiki/Q5310264","display_name":"Duality gap","level":3,"score":0.6406310200691223},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.637478768825531},{"id":"https://openalex.org/C163863214","wikidata":"https://www.wikidata.org/wiki/Q7624553","display_name":"Strong duality","level":3,"score":0.5850580930709839},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4719088673591614},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4552227258682251},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.4507661759853363},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.44995149970054626},{"id":"https://openalex.org/C48753275","wikidata":"https://www.wikidata.org/wiki/Q11216","display_name":"Numerical analysis","level":2,"score":0.4279938340187073},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.33526837825775146},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2485625147819519},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.23519638180732727},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1023/a:1018322318259","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1018322318259","pdf_url":null,"source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"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":"Computational Optimization and Applications","raw_type":"journal-article"},{"id":"pmh:oai:sdu.dk:publications/dd4cc5f1-e7f0-4b75-97d0-77c84b1a91cb","is_oa":false,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/dd4cc5f1-e7f0-4b75-97d0-77c84b1a91cb","pdf_url":null,"source":{"id":"https://openalex.org/S4306400423","display_name":"University of Southern Denmark Research Portal (University of Southern Denmark)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177969490","host_organization_name":"University of Southern Denmark","host_organization_lineage":["https://openalex.org/I177969490"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Andersen, K D & Christiansen, E 1998, 'Minimizing a sum of norms subject to linear equality constraints', Computational Optimization and Applications, vol. 11, no. 1, pp. 65-79. https://doi.org/10.1023/A:1018322318259","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:dial.uclouvain.be:boreal:45593","is_oa":false,"landing_page_url":"http://hdl.handle.net/2078.1/45593","pdf_url":null,"source":{"id":"https://openalex.org/S4306400166","display_name":"Digital Access to Libraries","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800384882","host_organization_name":"Harris County Public Library","host_organization_lineage":["https://openalex.org/I2800384882"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computational Optimization and Applications : an international journal, Vol. 11, no. 1, p. 65-79 (1998)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.4099999964237213},{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.4000000059604645}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W189195062","https://openalex.org/W1876521012","https://openalex.org/W1981970116","https://openalex.org/W1994126718","https://openalex.org/W2053661713","https://openalex.org/W2072446998","https://openalex.org/W2086594463","https://openalex.org/W2116956225","https://openalex.org/W2162256165","https://openalex.org/W2406860903","https://openalex.org/W4249667877","https://openalex.org/W6639411594"],"related_works":["https://openalex.org/W4220928172","https://openalex.org/W2725387418","https://openalex.org/W2201555914","https://openalex.org/W3213165575","https://openalex.org/W2614523486","https://openalex.org/W2136200239","https://openalex.org/W1821047009","https://openalex.org/W2038258422","https://openalex.org/W2080941243","https://openalex.org/W1687657632"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}