{"id":"https://openalex.org/W2290719478","doi":"https://doi.org/10.1007/s11590-011-0282-6","title":"On duality gap in linear conic problems","display_name":"On duality gap in linear conic problems","publication_year":2011,"publication_date":"2011-01-31","ids":{"openalex":"https://openalex.org/W2290719478","doi":"https://doi.org/10.1007/s11590-011-0282-6","mag":"2290719478"},"language":"en","primary_location":{"id":"doi:10.1007/s11590-011-0282-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11590-011-0282-6","pdf_url":null,"source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"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":"Optimization Letters","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/A5034884075","display_name":"Constantin Z\u0103linescu","orcid":"https://orcid.org/0000-0001-8461-818X"},"institutions":[{"id":"https://openalex.org/I138164181","display_name":"Alexandru Ioan Cuza University","ror":"https://ror.org/022kvet57","country_code":"RO","type":"education","lineage":["https://openalex.org/I138164181"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"C. Z\u0103linescu","raw_affiliation_strings":["Institute of Mathematics Octav Mayer, Ia\u015fi, Romania","University \u201cAl. I. Cuza\u201d Ia\u015fi, Faculty of Mathematics, Ia\u015fi, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Mathematics Octav Mayer, Ia\u015fi, Romania","institution_ids":[]},{"raw_affiliation_string":"University \u201cAl. I. Cuza\u201d Ia\u015fi, Faculty of Mathematics, Ia\u015fi, Romania","institution_ids":["https://openalex.org/I138164181"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5034884075"],"corresponding_institution_ids":["https://openalex.org/I138164181"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":1.213,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.7966683,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"6","issue":"3","first_page":"393","last_page":"402"},"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9986000061035156,"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.996999979019165,"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/conic-section","display_name":"Conic section","score":0.8918064832687378},{"id":"https://openalex.org/keywords/duality-gap","display_name":"Duality gap","score":0.8294202089309692},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.812171459197998},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.755976676940918},{"id":"https://openalex.org/keywords/cone","display_name":"Cone (formal languages)","score":0.7091536521911621},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6525670886039734},{"id":"https://openalex.org/keywords/convex-cone","display_name":"Convex cone","score":0.6106376051902771},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5914314985275269},{"id":"https://openalex.org/keywords/strong-duality","display_name":"Strong duality","score":0.5153788924217224},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.4748133420944214},{"id":"https://openalex.org/keywords/conic-optimization","display_name":"Conic optimization","score":0.4735157787799835},{"id":"https://openalex.org/keywords/dual-cone-and-polar-cone","display_name":"Dual cone and polar cone","score":0.4452272951602936},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.43417638540267944},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.4041592478752136},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.2588235139846802},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.21137169003486633},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.11931803822517395},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11484569311141968},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.07240238785743713}],"concepts":[{"id":"https://openalex.org/C108598597","wikidata":"https://www.wikidata.org/wiki/Q124255","display_name":"Conic section","level":2,"score":0.8918064832687378},{"id":"https://openalex.org/C5274546","wikidata":"https://www.wikidata.org/wiki/Q5310264","display_name":"Duality gap","level":3,"score":0.8294202089309692},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.812171459197998},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.755976676940918},{"id":"https://openalex.org/C30014739","wikidata":"https://www.wikidata.org/wiki/Q5159445","display_name":"Cone (formal languages)","level":2,"score":0.7091536521911621},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6525670886039734},{"id":"https://openalex.org/C28340159","wikidata":"https://www.wikidata.org/wiki/Q2256541","display_name":"Convex cone","level":5,"score":0.6106376051902771},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5914314985275269},{"id":"https://openalex.org/C163863214","wikidata":"https://www.wikidata.org/wiki/Q7624553","display_name":"Strong duality","level":3,"score":0.5153788924217224},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.4748133420944214},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.4735157787799835},{"id":"https://openalex.org/C24484764","wikidata":"https://www.wikidata.org/wiki/Q2687694","display_name":"Dual cone and polar cone","level":3,"score":0.4452272951602936},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.43417638540267944},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.4041592478752136},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.2588235139846802},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.21137169003486633},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.11931803822517395},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11484569311141968},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.07240238785743713},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s11590-011-0282-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11590-011-0282-6","pdf_url":null,"source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"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":"Optimization Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1577338488","https://openalex.org/W1632601927","https://openalex.org/W2112800266","https://openalex.org/W2114605231","https://openalex.org/W2121632648","https://openalex.org/W4249667877","https://openalex.org/W4293820388","https://openalex.org/W4300079171"],"related_works":["https://openalex.org/W2155425983","https://openalex.org/W1877581457","https://openalex.org/W4297816335","https://openalex.org/W3149289119","https://openalex.org/W2290719478","https://openalex.org/W3122542532","https://openalex.org/W1835789250","https://openalex.org/W2388930172","https://openalex.org/W3122463578","https://openalex.org/W4226459055"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}