{"id":"https://openalex.org/W3087504907","doi":"https://doi.org/10.1080/10556788.2020.1818079","title":"Newton projection method as applied to assembly simulation","display_name":"Newton projection method as applied to assembly simulation","publication_year":2020,"publication_date":"2020-09-18","ids":{"openalex":"https://openalex.org/W3087504907","doi":"https://doi.org/10.1080/10556788.2020.1818079","mag":"3087504907"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2020.1818079","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2020.1818079","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},"type":"article","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/A5012160666","display_name":"Stanislav Baklanov","orcid":"https://orcid.org/0000-0002-3351-5639"},"institutions":[{"id":"https://openalex.org/I212220629","display_name":"Peter the Great St. Petersburg Polytechnic University","ror":"https://ror.org/02x91aj62","country_code":"RU","type":"education","lineage":["https://openalex.org/I212220629"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"S. Baklanov","raw_affiliation_strings":["Peter the Great St. Petersburg Polytechnic University","Peter the Great St. Petersburg Polytechnic University, Saint Petersburg, Russia"],"raw_orcid":"https://orcid.org/0000-0002-3351-5639","affiliations":[{"raw_affiliation_string":"Peter the Great St. Petersburg Polytechnic University","institution_ids":["https://openalex.org/I212220629"]},{"raw_affiliation_string":"Peter the Great St. Petersburg Polytechnic University, Saint Petersburg, Russia","institution_ids":["https://openalex.org/I212220629"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112305715","display_name":"Maria Stefanova","orcid":null},"institutions":[{"id":"https://openalex.org/I212220629","display_name":"Peter the Great St. Petersburg Polytechnic University","ror":"https://ror.org/02x91aj62","country_code":"RU","type":"education","lineage":["https://openalex.org/I212220629"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"M. Stefanova","raw_affiliation_strings":["Peter the Great St. Petersburg Polytechnic University","Peter the Great St. Petersburg Polytechnic University, Saint Petersburg, Russia"],"raw_orcid":"https://orcid.org/0000-0002-0266-5159","affiliations":[{"raw_affiliation_string":"Peter the Great St. Petersburg Polytechnic University","institution_ids":["https://openalex.org/I212220629"]},{"raw_affiliation_string":"Peter the Great St. Petersburg Polytechnic University, Saint Petersburg, Russia","institution_ids":["https://openalex.org/I212220629"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075403037","display_name":"Sergey Lupuleac","orcid":"https://orcid.org/0000-0003-0210-1705"},"institutions":[{"id":"https://openalex.org/I212220629","display_name":"Peter the Great St. Petersburg Polytechnic University","ror":"https://ror.org/02x91aj62","country_code":"RU","type":"education","lineage":["https://openalex.org/I212220629"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"S. Lupuleac","raw_affiliation_strings":["Peter the Great St. Petersburg Polytechnic University","Peter the Great St. Petersburg Polytechnic University, Saint Petersburg, Russia"],"raw_orcid":"https://orcid.org/0000-0003-0210-1705","affiliations":[{"raw_affiliation_string":"Peter the Great St. Petersburg Polytechnic University","institution_ids":["https://openalex.org/I212220629"]},{"raw_affiliation_string":"Peter the Great St. Petersburg Polytechnic University, Saint Petersburg, Russia","institution_ids":["https://openalex.org/I212220629"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5012160666"],"corresponding_institution_ids":["https://openalex.org/I212220629"],"apc_list":null,"apc_paid":null,"fwci":0.8986,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.70220687,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"37","issue":"2","first_page":"577","last_page":"604"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11245","display_name":"Advanced Numerical Analysis Techniques","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T11245","display_name":"Advanced Numerical Analysis Techniques","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T11159","display_name":"Manufacturing Process and Optimization","score":0.9987999796867371,"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/T10571","display_name":"Robotic Mechanisms and Dynamics","score":0.9977999925613403,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hessian-matrix","display_name":"Hessian matrix","score":0.7885059118270874},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5852680802345276},{"id":"https://openalex.org/keywords/newtons-method","display_name":"Newton's method","score":0.5837908983230591},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.5782656073570251},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5181776285171509},{"id":"https://openalex.org/keywords/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.5109742879867554},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5067303776741028},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.49569475650787354},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47975170612335205},{"id":"https://openalex.org/keywords/projection-method","display_name":"Projection method","score":0.4772341549396515},{"id":"https://openalex.org/keywords/quasi-newton-method","display_name":"Quasi-Newton method","score":0.4748925268650055},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4418959617614746},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4400591552257538},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4175509512424469},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4082905948162079},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.39857926964759827},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.345664381980896},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.29469090700149536},{"id":"https://openalex.org/keywords/dykstras-projection-algorithm","display_name":"Dykstra's projection algorithm","score":0.23292860388755798},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.08343526721000671}],"concepts":[{"id":"https://openalex.org/C203616005","wikidata":"https://www.wikidata.org/wiki/Q620495","display_name":"Hessian matrix","level":2,"score":0.7885059118270874},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5852680802345276},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.5837908983230591},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.5782656073570251},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5181776285171509},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.5109742879867554},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5067303776741028},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.49569475650787354},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47975170612335205},{"id":"https://openalex.org/C65557600","wikidata":"https://www.wikidata.org/wiki/Q7249451","display_name":"Projection method","level":3,"score":0.4772341549396515},{"id":"https://openalex.org/C114954040","wikidata":"https://www.wikidata.org/wiki/Q1476018","display_name":"Quasi-Newton method","level":4,"score":0.4748925268650055},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4418959617614746},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4400591552257538},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4175509512424469},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4082905948162079},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.39857926964759827},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.345664381980896},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.29469090700149536},{"id":"https://openalex.org/C202426404","wikidata":"https://www.wikidata.org/wiki/Q5318686","display_name":"Dykstra's projection algorithm","level":2,"score":0.23292860388755798},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.08343526721000671},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556788.2020.1818079","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2020.1818079","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":51,"referenced_works":["https://openalex.org/W5954235","https://openalex.org/W92038506","https://openalex.org/W93673468","https://openalex.org/W391578156","https://openalex.org/W1482750774","https://openalex.org/W1489619838","https://openalex.org/W1583497301","https://openalex.org/W1632601927","https://openalex.org/W1871194732","https://openalex.org/W1965261669","https://openalex.org/W1968165559","https://openalex.org/W1983599491","https://openalex.org/W2001674163","https://openalex.org/W2013243898","https://openalex.org/W2015049819","https://openalex.org/W2018538340","https://openalex.org/W2026289804","https://openalex.org/W2030239401","https://openalex.org/W2040006905","https://openalex.org/W2044106880","https://openalex.org/W2049943687","https://openalex.org/W2054853607","https://openalex.org/W2058343463","https://openalex.org/W2068531154","https://openalex.org/W2082823058","https://openalex.org/W2086867325","https://openalex.org/W2098132613","https://openalex.org/W2102790339","https://openalex.org/W2113202765","https://openalex.org/W2118100773","https://openalex.org/W2124541940","https://openalex.org/W2132347401","https://openalex.org/W2143101939","https://openalex.org/W2159307101","https://openalex.org/W2162988958","https://openalex.org/W2278792291","https://openalex.org/W2482864519","https://openalex.org/W2490082247","https://openalex.org/W2525211851","https://openalex.org/W2739680746","https://openalex.org/W2741906455","https://openalex.org/W2908182292","https://openalex.org/W2910669218","https://openalex.org/W2925918685","https://openalex.org/W2929599826","https://openalex.org/W2951595972","https://openalex.org/W2963425072","https://openalex.org/W3001933230","https://openalex.org/W3009274308","https://openalex.org/W4251143728","https://openalex.org/W4300666158"],"related_works":["https://openalex.org/W2336762304","https://openalex.org/W2996136316","https://openalex.org/W2462842724","https://openalex.org/W114133465","https://openalex.org/W2983297293","https://openalex.org/W2039312875","https://openalex.org/W2972343833","https://openalex.org/W2970432723","https://openalex.org/W2463007134","https://openalex.org/W4388964614"],"abstract_inverted_index":{"In":[0,139],"this":[1],"paper,":[2],"we":[3,141,150],"consider":[4],"Newton":[5,58,133,152],"projection":[6,134,153],"method":[7,59,76,135,154],"for":[8,21,50,77,92],"solving":[9,73,78],"the":[10,51,56,72,79,97,105,121,127,143,146,156],"quadratic":[11,62,158],"programming":[12,159],"problem":[13,107,125],"that":[14],"emerges":[15],"in":[16],"simulation":[17,166],"of":[18,29,43,64,81,104,145,164],"joining":[19],"process":[20],"assembly":[22,165],"with":[23,60,126,155],"compliant":[24],"parts.":[25],"This":[26],"particular":[27],"class":[28],"problems":[30],"has":[31],"specific":[32],"features":[33],"such":[34],"as":[35,45,47,109],"an":[36],"ill-conditioned":[37],"Hessian":[38],"and":[39,66,88,136],"a":[40,48,61,75,110,162],"sparse":[41],"matrix":[42],"constraints":[44],"well":[46],"requirement":[49],"large-scale":[52],"computations.":[53],"We":[54,95,116],"use":[55,96],"projected":[57],"rate":[63],"convergence":[65,144],"suggest":[67],"some":[68],"improvements":[69],"to":[70,100,119],"reduce":[71],"time:":[74],"system":[80],"linear":[82],"equations,":[83],"so-called":[84],"constraint":[85],"recalculation":[86],"method,":[87],"compare":[89,151],"different":[90],"approaches":[91],"step-size":[93],"selection.":[94],"duality":[98],"principle":[99],"formulate":[101],"alternative":[102],"forms":[103],"minimization":[106,124],"that,":[108],"rule,":[111],"can":[112],"be":[113],"solved":[114],"faster.":[115],"describe":[117],"how":[118],"solve":[120],"considered":[122],"nonlinear":[123],"nonsmooth":[128],"objective":[129],"function":[130],"by":[131],"modifying":[132],"employing":[137],"subgradients.":[138],"addition,":[140],"prove":[142],"suggested":[147],"algorithm.":[148],"Finally,":[149],"other":[157],"techniques":[160],"on":[161],"number":[163],"problems.":[167]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
