{"id":"https://openalex.org/W7128501930","doi":"https://doi.org/10.48550/arxiv.2602.07862","title":"Optimality Conditions for Rational Minimax Approximations: Bridging Ruttan's Criteria to Dual-Based Methods","display_name":"Optimality Conditions for Rational Minimax Approximations: Bridging Ruttan's Criteria to Dual-Based Methods","publication_year":2026,"publication_date":"2026-02-08","ids":{"openalex":"https://openalex.org/W7128501930","doi":"https://doi.org/10.48550/arxiv.2602.07862"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.07862","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5125536620","display_name":"Lei-Hong Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Zhang, Lei-Hong","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5125536620"],"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/T10545","display_name":"Optimization and Variational Analysis","score":0.5410000085830688,"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.5410000085830688,"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.35569998621940613,"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/T11115","display_name":"Topology Optimization in Engineering","score":0.024800000712275505,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"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/minimax","display_name":"Minimax","score":0.8682000041007996},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5536999702453613},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.5218999981880188},{"id":"https://openalex.org/keywords/minimax-theorem","display_name":"Minimax theorem","score":0.5073999762535095},{"id":"https://openalex.org/keywords/bridging","display_name":"Bridging (networking)","score":0.44920000433921814},{"id":"https://openalex.org/keywords/optimality-criterion","display_name":"Optimality criterion","score":0.335999995470047}],"concepts":[{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.8682000041007996},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7060999870300293},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5536999702453613},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.5218999981880188},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5134000182151794},{"id":"https://openalex.org/C2780861221","wikidata":"https://www.wikidata.org/wiki/Q913849","display_name":"Minimax theorem","level":3,"score":0.5073999762535095},{"id":"https://openalex.org/C174348530","wikidata":"https://www.wikidata.org/wiki/Q188635","display_name":"Bridging (networking)","level":2,"score":0.44920000433921814},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.430400013923645},{"id":"https://openalex.org/C2778153524","wikidata":"https://www.wikidata.org/wiki/Q4241335","display_name":"Optimality criterion","level":2,"score":0.335999995470047},{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.31130000948905945},{"id":"https://openalex.org/C117148685","wikidata":"https://www.wikidata.org/wiki/Q6865376","display_name":"Minimax approximation algorithm","level":2,"score":0.29600000381469727},{"id":"https://openalex.org/C182310444","wikidata":"https://www.wikidata.org/wiki/Q1332643","display_name":"Boundary value problem","level":2,"score":0.2930999994277954},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.2858999967575073},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.25839999318122864}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.07862","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.07862","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.07862","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.07862","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"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":{"This":[0],"paper":[1],"presents":[2],"a":[3,104,131],"theoretical":[4],"discussion":[5],"on":[6,103,130],"Ruttan's":[7,37,93,107],"optimality":[8,29,110],"conditions":[9,67],"for":[10,31,40],"rational":[11],"minimax":[12,101,116,128],"approximations":[13,117],"in":[14,86],"discrete":[15,33,115,134],"and":[16,68,94],"continuum":[17,105,132],"settings,":[18],"integrating":[19],"analytical":[20],"foundations":[21],"with":[22],"computational":[23],"practice.":[24],"We":[25],"develop":[26],"extended":[27],"second-order":[28],"criteria":[30],"the":[32,52,69],"case,":[34],"demonstrating":[35],"that":[36,83,100],"sufficient":[38,108],"condition":[39],"global":[41,109],"solutions":[42],"[Ruttan,":[43],"{Constr.":[44],"Approx.},":[45],"1":[46],"(1985),":[47],"287-296]":[48],"becomes":[49],"necessary":[50],"when":[51],"number":[53],"of":[54,91,127],"extreme":[55],"points":[56],"is":[57],"minimal.":[58],"Our":[59],"analysis":[60],"further":[61],"uncovers":[62],"fundamental":[63],"relationships":[64],"between":[65],"these":[66],"dual-based":[70],"{d-Lawson}":[71,87],"method":[72],"[L.-H.":[73],"Zhang":[74],"et":[75],"al.,":[76],"{Math.":[77],"Comp.},":[78],"94":[79],"(2025),":[80],"2457-2494],":[81],"proving":[82],"strong":[84],"duality":[85],"ensures":[88],"simultaneous":[89],"satisfaction":[90],"both":[92],"Kolmogorov's":[95],"criteria.":[96],"Additionally,":[97],"we":[98],"show":[99],"approximants":[102,129],"satisfying":[106],"can":[111],"be":[112],"captured":[113],"through":[114],"at":[118],"properly":[119],"chosen":[120],"boundary":[121],"points,":[122],"thereby":[123],"enabling":[124],"efficient":[125],"computation":[126],"using":[133],"methods.":[135]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-11T00:00:00"}