{"id":"https://openalex.org/W4315488708","doi":"https://doi.org/10.1109/cdc51059.2022.9992908","title":"A Non-Interior-Point Method for the Optimal Control Problem with Equilibrium Constraints","display_name":"A Non-Interior-Point Method for the Optimal Control Problem with Equilibrium Constraints","publication_year":2022,"publication_date":"2022-12-06","ids":{"openalex":"https://openalex.org/W4315488708","doi":"https://doi.org/10.1109/cdc51059.2022.9992908"},"language":"en","primary_location":{"id":"doi:10.1109/cdc51059.2022.9992908","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc51059.2022.9992908","pdf_url":null,"source":{"id":"https://openalex.org/S4363607710","display_name":"2022 IEEE 61st Conference on Decision and Control (CDC)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE 61st Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5025445787","display_name":"Kangyu Lin","orcid":"https://orcid.org/0000-0003-0140-2557"},"institutions":[{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kangyu Lin","raw_affiliation_strings":["Kyoto University,Graduate School of Informatics,Department of Systems Science,Kyoto,Japan","Department of Systems Science, Graduate School of Informatics, Kyoto University, Kyoto, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kyoto University,Graduate School of Informatics,Department of Systems Science,Kyoto,Japan","institution_ids":["https://openalex.org/I22299242"]},{"raw_affiliation_string":"Department of Systems Science, Graduate School of Informatics, Kyoto University, Kyoto, Japan","institution_ids":["https://openalex.org/I22299242"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014103535","display_name":"Toshiyuki Ohtsuka","orcid":"https://orcid.org/0000-0003-3554-8933"},"institutions":[{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Toshiyuki Ohtsuka","raw_affiliation_strings":["Kyoto University,Graduate School of Informatics,Department of Systems Science,Kyoto,Japan","Department of Systems Science, Graduate School of Informatics, Kyoto University, Kyoto, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kyoto University,Graduate School of Informatics,Department of Systems Science,Kyoto,Japan","institution_ids":["https://openalex.org/I22299242"]},{"raw_affiliation_string":"Department of Systems Science, Graduate School of Informatics, Kyoto University, Kyoto, Japan","institution_ids":["https://openalex.org/I22299242"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I22299242"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1204","last_page":"1210"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9988999962806702,"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.9988999962806702,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T11082","display_name":"Spacecraft Dynamics and Control","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/interior-point-method","display_name":"Interior point method","score":0.8279691934585571},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6791485548019409},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6595413684844971},{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.6153106689453125},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.598597526550293},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.5263556241989136},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5183240175247192},{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.5018954277038574},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5007584095001221},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4790302813053131},{"id":"https://openalex.org/keywords/smoothing","display_name":"Smoothing","score":0.476682186126709},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.46470704674720764},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4644828736782074},{"id":"https://openalex.org/keywords/numerical-continuation","display_name":"Numerical continuation","score":0.45070359110832214},{"id":"https://openalex.org/keywords/continuation","display_name":"Continuation","score":0.4267335534095764},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.42528679966926575},{"id":"https://openalex.org/keywords/numerical-analysis","display_name":"Numerical analysis","score":0.42422282695770264},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4105582535266876},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.3812260925769806},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.30375540256500244}],"concepts":[{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.8279691934585571},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6791485548019409},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6595413684844971},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.6153106689453125},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.598597526550293},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.5263556241989136},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5183240175247192},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.5018954277038574},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5007584095001221},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4790302813053131},{"id":"https://openalex.org/C3770464","wikidata":"https://www.wikidata.org/wiki/Q775963","display_name":"Smoothing","level":2,"score":0.476682186126709},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.46470704674720764},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4644828736782074},{"id":"https://openalex.org/C2775978667","wikidata":"https://www.wikidata.org/wiki/Q7069654","display_name":"Numerical continuation","level":4,"score":0.45070359110832214},{"id":"https://openalex.org/C88626702","wikidata":"https://www.wikidata.org/wiki/Q1128903","display_name":"Continuation","level":2,"score":0.4267335534095764},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.42528679966926575},{"id":"https://openalex.org/C48753275","wikidata":"https://www.wikidata.org/wiki/Q11216","display_name":"Numerical analysis","level":2,"score":0.42422282695770264},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4105582535266876},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.3812260925769806},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.30375540256500244},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2781349735","wikidata":"https://www.wikidata.org/wiki/Q4904824","display_name":"Bifurcation","level":3,"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc51059.2022.9992908","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc51059.2022.9992908","pdf_url":null,"source":{"id":"https://openalex.org/S4363607710","display_name":"2022 IEEE 61st Conference on Decision and Control (CDC)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE 61st Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.4699999988079071,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1512520166","https://openalex.org/W1560867458","https://openalex.org/W1967759264","https://openalex.org/W2008814958","https://openalex.org/W2012726395","https://openalex.org/W2035072927","https://openalex.org/W2037678919","https://openalex.org/W2040164128","https://openalex.org/W2051269616","https://openalex.org/W2065066829","https://openalex.org/W2065691568","https://openalex.org/W2101340954","https://openalex.org/W2109783572","https://openalex.org/W2123871098","https://openalex.org/W2314779162","https://openalex.org/W2346982517","https://openalex.org/W2842089854","https://openalex.org/W2886884779","https://openalex.org/W2951805468","https://openalex.org/W2963240955","https://openalex.org/W3102384508","https://openalex.org/W3202328163","https://openalex.org/W3211454553"],"related_works":["https://openalex.org/W1986602928","https://openalex.org/W2905382927","https://openalex.org/W2116098329","https://openalex.org/W1004667392","https://openalex.org/W2018102019","https://openalex.org/W2168617555","https://openalex.org/W1966113063","https://openalex.org/W1990909561","https://openalex.org/W1983813429","https://openalex.org/W2005079237"],"abstract_inverted_index":{"In":[0],"this":[1],"study,":[2],"we":[3],"propose":[4],"a":[5,37,82,110,129,134,158],"non-interior-point":[6],"method":[7,49,107,163],"to":[8,24,44,55,66,70,122,140],"solve":[9,97,124],"the":[10,32,47,58,68,72,86,93,98,102,105,125,142,146,149],"optimal":[11],"control":[12],"problem":[13,22],"with":[14,133,160],"equilibrium":[15],"constraints":[16,91],"(OCPEC).":[17],"OCPEC":[18,100],"is":[19,78,120,138],"an":[20,161],"intractable":[21],"owing":[23],"its":[25],"inherently":[26],"unstable":[27],"constraint":[28],"system,":[29,127],"resulting":[30],"in":[31,57,92,101],"numerical":[33,73,154],"difficulties":[34],"such":[35],"as":[36],"feasible":[38,59],"region":[39],"without":[40],"strict":[41],"interior.":[42],"Compared":[43],"interior-point":[45,162],"methods,":[46],"proposed":[48,150],"does":[50],"not":[51],"require":[52],"all":[53],"iterates":[54],"remain":[56],"region,":[60],"and":[61,128,156],"therefore":[62],"has":[63],"more":[64],"freedom":[65,77],"select":[67],"stepsize":[69,76],"mitigate":[71],"difficulties.":[74],"This":[75],"achieved":[79],"by":[80],"introducing":[81],"smoothing-equation":[83],"reformulation":[84],"for":[85],"complementary":[87],"conditions":[88],"of":[89,104,112,148],"inequality":[90],"Karush\u2013Kuhn\u2013Tucker":[94],"conditions.":[95],"We":[96,144],"discretized":[99],"framework":[103],"continuation":[106],"that":[108],"solves":[109],"sequence":[111],"nonlinear":[113],"programming":[114],"problems.":[115],"A":[116],"sparsity":[117],"exploitation":[118],"technique":[119],"introduced":[121,139],"efficiently":[123],"linear":[126],"line":[130],"search":[131],"strategy":[132],"dedicated":[135],"merit":[136],"function":[137],"guarantee":[141],"convergence.":[143],"demonstrate":[145],"effectiveness":[147],"algorithm":[151],"using":[152],"several":[153],"examples":[155],"make":[157],"comparison":[159],"solver.":[164]},"counts_by_year":[{"year":2024,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}