{"id":"https://openalex.org/W6964075513","doi":"https://doi.org/10.2312/sca.20141120","title":"Optimization Integrator for Large Time Steps","display_name":"Optimization Integrator for Large Time Steps","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W6964075513","doi":"https://doi.org/10.2312/sca.20141120"},"language":"en","primary_location":{"id":"doi:10.2312/sca.20141120","is_oa":true,"landing_page_url":"https://doi.org/10.2312/sca.20141120","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"other","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.2312/sca.20141120","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Gast, Theodore F.","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Gast, Theodore F.","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Schroeder, Craig","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Schroeder, Craig","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"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":true,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7235000133514404},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6740000247955322},{"id":"https://openalex.org/keywords/integrator","display_name":"Integrator","score":0.6225000023841858},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.49779999256134033},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4959999918937683},{"id":"https://openalex.org/keywords/backward-euler-method","display_name":"Backward Euler method","score":0.48899999260902405},{"id":"https://openalex.org/keywords/frame","display_name":"Frame (networking)","score":0.43560001254081726}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7235000133514404},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6740000247955322},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6492000222206116},{"id":"https://openalex.org/C79518650","wikidata":"https://www.wikidata.org/wiki/Q2081431","display_name":"Integrator","level":3,"score":0.6225000023841858},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.49779999256134033},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4959999918937683},{"id":"https://openalex.org/C768646","wikidata":"https://www.wikidata.org/wiki/Q2736820","display_name":"Backward Euler method","level":3,"score":0.48899999260902405},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.43560001254081726},{"id":"https://openalex.org/C75380026","wikidata":"https://www.wikidata.org/wiki/Q868454","display_name":"Euler method","level":3,"score":0.4316999912261963},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4122999906539917},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.4025000035762787},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.39739999175071716},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.3882000148296356},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.3783999979496002},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35989999771118164},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.3321000039577484},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.25600001215934753}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2312/sca.20141120","is_oa":true,"landing_page_url":"https://doi.org/10.2312/sca.20141120","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.2312/sca.20141120","is_oa":true,"landing_page_url":"https://doi.org/10.2312/sca.20141120","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"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":null,"license_id":null,"version":null,"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":{"Practical":[0],"time":[1,26,33],"steps":[2,27,34],"in":[3],"today's":[4],"state-of-the-art":[5],"simulators":[6],"typically":[7],"rely":[8],"on":[9],"Newton's":[10,58],"method":[11,59],"to":[12,60],"solve":[13],"large":[14,32],"systems":[15],"of":[16,71,79,130],"nonlinear":[17],"equations.":[18],"In":[19],"practice,":[20],"this":[21,131],"works":[22],"well":[23],"for":[24,42,117,126],"small":[25],"but":[28],"is":[29,77],"unreliable":[30],"at":[31,35,85],"or":[36,44],"near":[37],"the":[38,82,86,102,127],"frame":[39,88],"rate,":[40],"particularly":[41],"difficult":[43],"stiff":[45],"simulations.":[46],"We":[47,92,110],"show":[48,93],"that":[49],"recasting":[50],"backward":[51],"Euler":[52],"as":[53],"a":[54],"minimization":[55,106],"problem":[56],"allows":[57],"be":[61,98],"stabilized":[62],"by":[63],"standard":[64],"optimization":[65],"techniques":[66],"with":[67],"some":[68],"novel":[69,113],"improvements":[70],"our":[72],"own.":[73],"The":[74],"resulting":[75],"solver":[76,103],"capable":[78],"solving":[80],"even":[81],"toughest":[83],"simulations":[84],"24Hz":[87],"rate":[89],"and":[90,120],"beyond.":[91],"how":[94],"simple":[95],"collisions":[96,119,121],"can":[97],"incorporated":[99],"directly":[100],"into":[101],"through":[104],"constrained":[105],"without":[107],"sacrificing":[108],"efficiency.":[109],"also":[111],"present":[112],"penalty":[114],"collision":[115],"formulations":[116],"self":[118],"against":[122],"scripted":[123],"bodies":[124],"designed":[125],"unique":[128],"demands":[129],"solver.":[132]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}