{"id":"https://openalex.org/W1994016165","doi":"https://doi.org/10.1137/040613068","title":"Enhanced Fritz John Conditions for Convex Programming","display_name":"Enhanced Fritz John Conditions for Convex Programming","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1994016165","doi":"https://doi.org/10.1137/040613068","mag":"1994016165"},"language":"en","primary_location":{"id":"doi:10.1137/040613068","is_oa":false,"landing_page_url":"https://doi.org/10.1137/040613068","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","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/A5039911471","display_name":"Dimitri P. Bertsekas","orcid":"https://orcid.org/0000-0001-6909-7208"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dimitri P. Bertsekas","raw_affiliation_strings":["Massachusetts Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067307504","display_name":"Asuman Ozdaglar","orcid":"https://orcid.org/0000-0002-1827-1285"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Asuman E. Ozdaglar","raw_affiliation_strings":["Massachusetts Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110258450","display_name":"Paul Tseng","orcid":null},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Paul Tseng","raw_affiliation_strings":["University of Washington"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Washington","institution_ids":["https://openalex.org/I201448701"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6864,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.83282527,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"16","issue":"3","first_page":"766","last_page":"797"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9994000196456909,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9970999956130981,"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.989300012588501,"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/mathematics","display_name":"Mathematics","score":0.8229496479034424},{"id":"https://openalex.org/keywords/duality-gap","display_name":"Duality gap","score":0.7357335686683655},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.6279841661453247},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.5159638524055481},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48394444584846497},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4832195043563843},{"id":"https://openalex.org/keywords/strong-duality","display_name":"Strong duality","score":0.4425416886806488},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.43514424562454224},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4230087399482727},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3487103581428528},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.26921921968460083}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8229496479034424},{"id":"https://openalex.org/C5274546","wikidata":"https://www.wikidata.org/wiki/Q5310264","display_name":"Duality gap","level":3,"score":0.7357335686683655},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.6279841661453247},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.5159638524055481},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48394444584846497},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4832195043563843},{"id":"https://openalex.org/C163863214","wikidata":"https://www.wikidata.org/wiki/Q7624553","display_name":"Strong duality","level":3,"score":0.4425416886806488},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.43514424562454224},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4230087399482727},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3487103581428528},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.26921921968460083},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","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/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/040613068","is_oa":false,"landing_page_url":"https://doi.org/10.1137/040613068","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.294.9253","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.294.9253","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.mit.edu/asuman/www/documents/FJ-published.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.421.3158","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.421.3158","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.mit.edu/asuman/www/documents/FJ_LIDS.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.68.7549","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.7549","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mit.edu:8001/people/dimitrib/FJ_Paper.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.78.1130","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.78.1130","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.washington.edu/~tseng/papers/FJ_Paper.ps","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":9,"referenced_works":["https://openalex.org/W187211397","https://openalex.org/W1534416612","https://openalex.org/W1583497301","https://openalex.org/W1986490170","https://openalex.org/W2057404142","https://openalex.org/W2133554519","https://openalex.org/W2489268653","https://openalex.org/W2798766386","https://openalex.org/W4249667877"],"related_works":["https://openalex.org/W4220928172","https://openalex.org/W2725387418","https://openalex.org/W2201555914","https://openalex.org/W2593555778","https://openalex.org/W2614523486","https://openalex.org/W2080941243","https://openalex.org/W2136200239","https://openalex.org/W2038258422","https://openalex.org/W3213165575","https://openalex.org/W1687657632"],"abstract_inverted_index":{"We":[0],"consider":[1],"convex":[2],"constrained":[3],"optimization":[4],"problems,":[5],"and":[6,80,108,136],"we":[7,27,60,125],"enhance":[8],"the":[9,17,29,39,51,55,64,72,82,102,109,117,132],"classical":[10],"Fritz":[11,32,128],"John":[12,33,129],"optimality":[13],"conditions":[14,130],"to":[15,50],"assert":[16],"existence":[18,30],"of":[19,31,66,75,85,104,111],"multipliers":[20,34,68],"with":[21],"special":[22],"sensitivity":[23],"properties.":[24],"In":[25,114],"particular,":[26,99,115],"prove":[28],"that":[35,41,62],"are":[36,94],"informative":[37,79],"in":[38,98],"sense":[40],"they":[42],"identify":[43],"constraints":[44],"whose":[45],"relaxation,":[46],"at":[47],"rates":[48],"proportional":[49],"multipliers,":[52],"strictly":[53],"improves":[54],"primal":[56],"optimal":[57,83,112,134,138],"value.":[58],"Moreover,":[59],"show":[61],"if":[63],"set":[65,77],"geometric":[67],"is":[69,78,121],"nonempty,":[70],"then":[71],"minimum-norm":[73],"vector":[74],"this":[76],"defines":[81],"rate":[84],"cost":[86],"improvement":[87],"per":[88],"unit":[89],"constraint":[90],"violation.":[91],"Our":[92],"assumptions":[93],"very":[95],"general":[96],"and,":[97],"allow":[100],"for":[101,116],"presence":[103],"a":[105,122],"duality":[106,123],"gap":[107],"nonexistence":[110],"solutions.":[113,139],"case":[118],"where":[119],"there":[120],"gap,":[124],"establish":[126],"enhanced":[127],"involving":[131],"dual":[133,137],"value":[135]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}