{"id":"https://openalex.org/W4414789109","doi":"https://doi.org/10.48550/arxiv.2509.20746","title":"Automated algorithm design for convex optimization problems with linear equality constraints","display_name":"Automated algorithm design for convex optimization problems with linear equality constraints","publication_year":2025,"publication_date":"2025-09-25","ids":{"openalex":"https://openalex.org/W4414789109","doi":"https://doi.org/10.48550/arxiv.2509.20746"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2509.20746","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.20746","pdf_url":"https://arxiv.org/pdf/2509.20746","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2509.20746","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012854172","display_name":"Ibrahim K. Ozaslan","orcid":"https://orcid.org/0000-0001-9974-4998"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ozaslan, Ibrahim K.","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077515669","display_name":"Wuwei Wu","orcid":"https://orcid.org/0000-0003-3754-8427"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wu, Wuwei","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100428821","display_name":"Jie Chen","orcid":"https://orcid.org/0000-0003-3171-1887"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Jie","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035194316","display_name":"Tryphon T. Georgiou","orcid":"https://orcid.org/0000-0003-0012-5447"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Georgiou, Tryphon T.","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5087790067","display_name":"Mihailo R. Jovanovi\u0107","orcid":"https://orcid.org/0000-0002-4181-2924"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jovanovic, Mihailo R.","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5012854172"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9726999998092651,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9726999998092651,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9451000094413757,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9283999800682068,"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/constraint","display_name":"Constraint (computer-aided design)","score":0.5040000081062317},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4575999975204468},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.4562999904155731},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.43720000982284546},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3917999863624573},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.39100000262260437},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.3903999924659729},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.3833000063896179},{"id":"https://openalex.org/keywords/frank\u2013wolfe-algorithm","display_name":"Frank\u2013Wolfe algorithm","score":0.3817000091075897}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.597599983215332},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5960000157356262},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5040000081062317},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4575999975204468},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.4562999904155731},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4560000002384186},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.43720000982284546},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41110000014305115},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3917999863624573},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.39100000262260437},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.3903999924659729},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.3833000063896179},{"id":"https://openalex.org/C122268817","wikidata":"https://www.wikidata.org/wiki/Q2020318","display_name":"Frank\u2013Wolfe algorithm","level":5,"score":0.3817000091075897},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.37790000438690186},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.34279999136924744},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.3425999879837036},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.33500000834465027},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.31060001254081726},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.2924000024795532},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.2921000123023987},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.27730000019073486},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.27129998803138733},{"id":"https://openalex.org/C50862404","wikidata":"https://www.wikidata.org/wiki/Q3075259","display_name":"Proper convex function","level":5,"score":0.2619999945163727},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.26100000739097595},{"id":"https://openalex.org/C201829737","wikidata":"https://www.wikidata.org/wiki/Q2022760","display_name":"Linear matrix inequality","level":2,"score":0.25369998812675476},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.25220000743865967}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2509.20746","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.20746","pdf_url":"https://arxiv.org/pdf/2509.20746","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2509.20746","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2509.20746","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2509.20746","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.20746","pdf_url":"https://arxiv.org/pdf/2509.20746","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Synthesis":[0],"of":[1,21,59,98,102,123,127],"optimization":[2,80],"algorithms":[3,22,60,75],"typically":[4],"follows":[5],"a":[6,29,39,89],"{\\em":[7],"design-then-analyze\\/}":[8],"approach,":[9],"which":[10,118],"can":[11],"obscure":[12],"fundamental":[13,52],"performance":[14,53],"limits":[15],"and":[16,49,57,131],"hinder":[17],"the":[18,99,103,109,114,121,124,128,132],"systematic":[19],"development":[20],"that":[23,61],"operate":[24],"near":[25],"these":[26],"limits.":[27],"Recently,":[28],"framework":[30,72],"grounded":[31],"in":[32],"robust":[33],"control":[34],"theory":[35],"has":[36],"emerged":[37],"as":[38],"powerful":[40],"tool":[41],"for":[42,76],"automating":[43],"algorithm":[44,92,116],"synthesis.":[45],"By":[46],"integrating":[47],"design":[48,74],"analysis":[50],"stages,":[51],"bounds":[54],"are":[55],"revealed":[56],"synthesis":[58],"achieve":[62],"them":[63],"is":[64,96],"enabled.":[65],"In":[66],"this":[67,71],"paper,":[68],"we":[69],"apply":[70],"to":[73],"solving":[77],"strongly":[78],"convex":[79],"problems":[81],"with":[82],"linear":[83],"equality":[84],"constraints.":[85],"Our":[86],"approach":[87],"yields":[88],"single-loop,":[90],"gradient-based":[91],"whose":[93],"convergence":[94],"rate":[95,112],"independent":[97],"condition":[100,125],"number":[101],"constraint":[104,133],"matrix.":[105,134],"This":[106],"improves":[107],"upon":[108],"best":[110],"known":[111],"within":[113],"same":[115],"class,":[117],"depends":[119],"on":[120],"product":[122],"numbers":[126],"objective":[129],"function":[130]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-10T00:00:00"}