{"id":"https://openalex.org/W1497401739","doi":"https://doi.org/10.1137/130930339","title":"An Iterative Minimization Formulation for Saddle Point Search","display_name":"An Iterative Minimization Formulation for Saddle Point Search","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W1497401739","doi":"https://doi.org/10.1137/130930339","mag":"1497401739"},"language":"en","primary_location":{"id":"doi:10.1137/130930339","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130930339","pdf_url":null,"source":{"id":"https://openalex.org/S203348814","display_name":"SIAM Journal on Numerical Analysis","issn_l":"0036-1429","issn":["0036-1429","1095-7170"],"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 Numerical Analysis","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://scholars.cityu.edu.hk/en/publications/an-iterative-minimization-formulation-for-saddle-point-search","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033363297","display_name":"Weiguo Gao","orcid":"https://orcid.org/0000-0003-0043-8320"},"institutions":[{"id":"https://openalex.org/I24943067","display_name":"Fudan University","ror":"https://ror.org/013q1eq08","country_code":"CN","type":"education","lineage":["https://openalex.org/I24943067"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Weiguo Gao","raw_affiliation_strings":["Fudan University"],"affiliations":[{"raw_affiliation_string":"Fudan University","institution_ids":["https://openalex.org/I24943067"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101383321","display_name":"Jing Leng","orcid":"https://orcid.org/0000-0003-2447-3876"},"institutions":[{"id":"https://openalex.org/I24943067","display_name":"Fudan University","ror":"https://ror.org/013q1eq08","country_code":"CN","type":"education","lineage":["https://openalex.org/I24943067"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jing Leng","raw_affiliation_strings":["Fudan University"],"affiliations":[{"raw_affiliation_string":"Fudan University","institution_ids":["https://openalex.org/I24943067"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030761097","display_name":"Xiang Zhou","orcid":"https://orcid.org/0000-0002-3835-3894"},"institutions":[{"id":"https://openalex.org/I530967","display_name":"Toronto Metropolitan University","ror":"https://ror.org/05g13zd79","country_code":"CA","type":"education","lineage":["https://openalex.org/I530967"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Xiang Zhou","raw_affiliation_strings":["Department of Mathematics"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics","institution_ids":["https://openalex.org/I530967"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5033363297"],"corresponding_institution_ids":["https://openalex.org/I24943067"],"apc_list":null,"apc_paid":null,"fwci":3.9183,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.9346341,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"53","issue":"4","first_page":"1786","last_page":"1805"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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/T11520","display_name":"Advanced Thermodynamics and Statistical Mechanics","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10044","display_name":"Protein Structure and Dynamics","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7833255529403687},{"id":"https://openalex.org/keywords/saddle-point","display_name":"Saddle point","score":0.5927239060401917},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5865057110786438},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.5592907667160034},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5529202222824097},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.5250437259674072},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.522996187210083},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5133427977561951},{"id":"https://openalex.org/keywords/local-convergence","display_name":"Local convergence","score":0.42116445302963257},{"id":"https://openalex.org/keywords/manifold","display_name":"Manifold (fluid mechanics)","score":0.4193595051765442},{"id":"https://openalex.org/keywords/saddle","display_name":"Saddle","score":0.4127430319786072},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1618555188179016},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09731060266494751}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7833255529403687},{"id":"https://openalex.org/C2681867","wikidata":"https://www.wikidata.org/wiki/Q690935","display_name":"Saddle point","level":2,"score":0.5927239060401917},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5865057110786438},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.5592907667160034},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5529202222824097},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.5250437259674072},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.522996187210083},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5133427977561951},{"id":"https://openalex.org/C117898588","wikidata":"https://www.wikidata.org/wiki/Q6664310","display_name":"Local convergence","level":3,"score":0.42116445302963257},{"id":"https://openalex.org/C529865628","wikidata":"https://www.wikidata.org/wiki/Q1790740","display_name":"Manifold (fluid mechanics)","level":2,"score":0.4193595051765442},{"id":"https://openalex.org/C2777127463","wikidata":"https://www.wikidata.org/wiki/Q10862618","display_name":"Saddle","level":2,"score":0.4127430319786072},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1618555188179016},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09731060266494751},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/130930339","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130930339","pdf_url":null,"source":{"id":"https://openalex.org/S203348814","display_name":"SIAM Journal on Numerical Analysis","issn_l":"0036-1429","issn":["0036-1429","1095-7170"],"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 Numerical Analysis","raw_type":"journal-article"},{"is_oa":true,"landing_page_url":"https://scholars.cityu.edu.hk/en/publications/an-iterative-minimization-formulation-for-saddle-point-search","pdf_url":null,"source":{"id":"https://openalex.org/S7407055387","display_name":"CityU Scholars","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Gao, W, Leng, J & Zhou, X 2015, 'An iterative minimization formulation for saddle point search', SIAM Journal on Numerical Analysis, vol. 53, no. 4, pp. 1786-1805. https://doi.org/10.1137/130930339","raw_type":"article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.749.7937","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.749.7937","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1406.1991.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/b506acde-424c-413f-9764-4621579c1252","is_oa":true,"landing_page_url":"https://hdl.handle.net/2031/b506acde-424c-413f-9764-4621579c1252","pdf_url":null,"source":{"id":"https://openalex.org/S7407055387","display_name":"CityU Scholars","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Gao, W, Leng, J & Zhou, X 2015, 'An iterative minimization formulation for saddle point search', SIAM Journal on Numerical Analysis, vol. 53, no. 4, pp. 1786-1805. https://doi.org/10.1137/130930339","raw_type":"article"}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://scholars.cityu.edu.hk/en/publications/an-iterative-minimization-formulation-for-saddle-point-search","pdf_url":null,"source":{"id":"https://openalex.org/S7407055387","display_name":"CityU Scholars","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Gao, W, Leng, J & Zhou, X 2015, 'An iterative minimization formulation for saddle point search', SIAM Journal on Numerical Analysis, vol. 53, no. 4, pp. 1786-1805. https://doi.org/10.1137/130930339","raw_type":"article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.8899999856948853}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1601132577","https://openalex.org/W1967722756","https://openalex.org/W1984414107","https://openalex.org/W1988675445","https://openalex.org/W1991241052","https://openalex.org/W1995102330","https://openalex.org/W1999513324","https://openalex.org/W1999527055","https://openalex.org/W2000125728","https://openalex.org/W2004751437","https://openalex.org/W2005775192","https://openalex.org/W2031173889","https://openalex.org/W2042732538","https://openalex.org/W2049738344","https://openalex.org/W2065376268","https://openalex.org/W2078123111","https://openalex.org/W2108806320","https://openalex.org/W2112378505","https://openalex.org/W2136958763","https://openalex.org/W2169281157"],"related_works":["https://openalex.org/W4236459141","https://openalex.org/W4205304778","https://openalex.org/W2020252434","https://openalex.org/W73248859","https://openalex.org/W2584253892","https://openalex.org/W2350324449","https://openalex.org/W119381072","https://openalex.org/W2034033896","https://openalex.org/W2351377961","https://openalex.org/W2170408898"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"and":[3,22,84,92,112],"analyzes":[4],"an":[5,15,34],"iterative":[6,30,128],"minimization":[7,129],"formulation":[8,130],"for":[9,106,113],"searching":[10],"index-1":[11],"saddle":[12,107],"points":[13,108],"of":[14,25,67,69,77,102,109,126],"energy":[16,115],"function.":[17],"We":[18,54,97],"give":[19],"a":[20,60],"general":[21],"rigorous":[23],"description":[24],"eigenvector-following":[26],"methodology":[27,105],"in":[28,41,65,71],"this":[29,57,127],"scheme":[31,58],"by":[32],"considering":[33],"auxiliary":[35],"optimization":[36],"problem":[37],"at":[38],"each":[39],"iteration":[40],"which":[42],"the":[43,51,74,78,100,103,118,124],"new":[44,104],"objective":[45],"function":[46],"is":[47],"locally":[48],"defined":[49],"near":[50],"current":[52],"guess.":[53],"prove":[55],"that":[56],"has":[59],"quadratic":[61],"local":[62],"convergence":[63],"rate":[64,76],"terms":[66],"number":[68],"iterations,":[70],"comparison":[72],"to":[73],"linear":[75],"gentlest":[79],"ascent":[80],"dynamics":[81],"[W.":[82],"E":[83],"X.":[85],"Zhou,":[86],"Nonlinearity,":[87],"24":[88],"(2011),":[89],"pp.":[90],"1831--1842]":[91],"many":[93],"other":[94],"existing":[95],"methods.":[96],"also":[98],"propose":[99],"generalization":[101],"higher":[110],"index":[111],"constrained":[114],"functions":[116],"on":[117,123],"manifold.":[119],"Preliminary":[120],"numerical":[121],"results":[122],"nature":[125],"are":[131],"presented.":[132]},"counts_by_year":[{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":7}],"updated_date":"2026-04-22T08:38:42.863108","created_date":"2025-10-10T00:00:00"}