{"id":"https://openalex.org/W7126390797","doi":"https://doi.org/10.3390/a19020106","title":"Algorithm for Scaling Variables in Minimization Methods","display_name":"Algorithm for Scaling Variables in Minimization Methods","publication_year":2026,"publication_date":"2026-02-01","ids":{"openalex":"https://openalex.org/W7126390797","doi":"https://doi.org/10.3390/a19020106"},"language":"en","primary_location":{"id":"doi:10.3390/a19020106","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a19020106","pdf_url":"https://www.mdpi.com/1999-4893/19/2/106/pdf?version=1770598066","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/19/2/106/pdf?version=1770598066","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051694825","display_name":"Elena Tovbis","orcid":"https://orcid.org/0000-0002-8500-2050"},"institutions":[{"id":"https://openalex.org/I4210105890","display_name":"Siberian State University of Telecommunications and Information Science","ror":"https://ror.org/019vbp610","country_code":"RU","type":"education","lineage":["https://openalex.org/I4210105890"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Elena Tovbis","raw_affiliation_strings":["Institute of Informatics and Telecommunications, Reshetnev Siberian State University of Science and Technology, 31 Krasnoyarskii Rabochii Prospekt, Krasnoyarsk 660037, Russia"],"raw_orcid":"https://orcid.org/0000-0002-8500-2050","affiliations":[{"raw_affiliation_string":"Institute of Informatics and Telecommunications, Reshetnev Siberian State University of Science and Technology, 31 Krasnoyarskii Rabochii Prospekt, Krasnoyarsk 660037, Russia","institution_ids":["https://openalex.org/I4210105890"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088654072","display_name":"V. N. Krutikov","orcid":"https://orcid.org/0000-0001-8704-1670"},"institutions":[{"id":"https://openalex.org/I4210105890","display_name":"Siberian State University of Telecommunications and Information Science","ror":"https://ror.org/019vbp610","country_code":"RU","type":"education","lineage":["https://openalex.org/I4210105890"]},{"id":"https://openalex.org/I52135307","display_name":"Kemerovo State University","ror":"https://ror.org/036yvre49","country_code":"RU","type":"education","lineage":["https://openalex.org/I52135307"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Vladimir Krutikov","raw_affiliation_strings":["Department of Applied Mathematics, Kemerovo State University, 6 Krasnaya Street, Kemerovo 650043, Russia","Institute of Informatics and Telecommunications, Reshetnev Siberian State University of Science and Technology, 31 Krasnoyarskii Rabochii Prospekt, Krasnoyarsk 660037, Russia"],"raw_orcid":"https://orcid.org/0000-0001-8704-1670","affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, Kemerovo State University, 6 Krasnaya Street, Kemerovo 650043, Russia","institution_ids":["https://openalex.org/I52135307"]},{"raw_affiliation_string":"Institute of Informatics and Telecommunications, Reshetnev Siberian State University of Science and Technology, 31 Krasnoyarskii Rabochii Prospekt, Krasnoyarsk 660037, Russia","institution_ids":["https://openalex.org/I4210105890"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081398489","display_name":"Lev Kazakovtsev","orcid":"https://orcid.org/0000-0002-0667-4001"},"institutions":[{"id":"https://openalex.org/I4210105890","display_name":"Siberian State University of Telecommunications and Information Science","ror":"https://ror.org/019vbp610","country_code":"RU","type":"education","lineage":["https://openalex.org/I4210105890"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Lev Kazakovtsev","raw_affiliation_strings":["Institute of Informatics and Telecommunications, Reshetnev Siberian State University of Science and Technology, 31 Krasnoyarskii Rabochii Prospekt, Krasnoyarsk 660037, Russia"],"raw_orcid":"https://orcid.org/0000-0002-0667-4001","affiliations":[{"raw_affiliation_string":"Institute of Informatics and Telecommunications, Reshetnev Siberian State University of Science and Technology, 31 Krasnoyarskii Rabochii Prospekt, Krasnoyarsk 660037, Russia","institution_ids":["https://openalex.org/I4210105890"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5081398489"],"corresponding_institution_ids":["https://openalex.org/I4210105890"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15667383,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"19","issue":"2","first_page":"106","last_page":"106"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.3666999936103821,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.3666999936103821,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.18619999289512634,"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/T13983","display_name":"Cybersecurity and Information Systems","score":0.027799999341368675,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/conjugate-gradient-method","display_name":"Conjugate gradient method","score":0.8398000001907349},{"id":"https://openalex.org/keywords/nonlinear-conjugate-gradient-method","display_name":"Nonlinear conjugate gradient method","score":0.7335000038146973},{"id":"https://openalex.org/keywords/derivation-of-the-conjugate-gradient-method","display_name":"Derivation of the conjugate gradient method","score":0.7258999943733215},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.6741999983787537},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6082000136375427},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.6004999876022339},{"id":"https://openalex.org/keywords/biconjugate-gradient-method","display_name":"Biconjugate gradient method","score":0.5831000208854675},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.5672000050544739},{"id":"https://openalex.org/keywords/conjugate-residual-method","display_name":"Conjugate residual method","score":0.5666999816894531}],"concepts":[{"id":"https://openalex.org/C81184566","wikidata":"https://www.wikidata.org/wiki/Q1191895","display_name":"Conjugate gradient method","level":2,"score":0.8398000001907349},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7458000183105469},{"id":"https://openalex.org/C26362088","wikidata":"https://www.wikidata.org/wiki/Q17086453","display_name":"Nonlinear conjugate gradient method","level":4,"score":0.7335000038146973},{"id":"https://openalex.org/C198562538","wikidata":"https://www.wikidata.org/wiki/Q5262612","display_name":"Derivation of the conjugate gradient method","level":5,"score":0.7258999943733215},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.6741999983787537},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6082000136375427},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.6004999876022339},{"id":"https://openalex.org/C89408827","wikidata":"https://www.wikidata.org/wiki/Q855169","display_name":"Biconjugate gradient method","level":5,"score":0.5831000208854675},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.5672000050544739},{"id":"https://openalex.org/C91394653","wikidata":"https://www.wikidata.org/wiki/Q5161159","display_name":"Conjugate residual method","level":4,"score":0.5666999816894531},{"id":"https://openalex.org/C130367717","wikidata":"https://www.wikidata.org/wiki/Q189791","display_name":"Diagonal","level":2,"score":0.5098999738693237},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.498199999332428},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.47209998965263367},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.43479999899864197},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3637999892234802},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.36059999465942383},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35370001196861267},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.34389999508857727},{"id":"https://openalex.org/C113313756","wikidata":"https://www.wikidata.org/wiki/Q332791","display_name":"Diagonal matrix","level":3,"score":0.34299999475479126},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.3411000072956085},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.32330000400543213},{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.32170000672340393},{"id":"https://openalex.org/C166437778","wikidata":"https://www.wikidata.org/wiki/Q50695","display_name":"Quadratic function","level":3,"score":0.30219998955726624},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.28049999475479126},{"id":"https://openalex.org/C132721684","wikidata":"https://www.wikidata.org/wiki/Q2877013","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","level":3,"score":0.2773999869823456},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.26600000262260437},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.26080000400543213},{"id":"https://openalex.org/C2777634741","wikidata":"https://www.wikidata.org/wiki/Q768993","display_name":"Wasserstein metric","level":2,"score":0.26010000705718994}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3390/a19020106","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a19020106","pdf_url":"https://www.mdpi.com/1999-4893/19/2/106/pdf?version=1770598066","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:ff294036949743429f8815048dcbfd45","is_oa":false,"landing_page_url":"https://doaj.org/article/ff294036949743429f8815048dcbfd45","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 19, Iss 2, p 106 (2026)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/a19020106","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a19020106","pdf_url":"https://www.mdpi.com/1999-4893/19/2/106/pdf?version=1770598066","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"No poverty","id":"https://metadata.un.org/sdg/1","score":0.6867175698280334}],"awards":[{"id":"https://openalex.org/G5946599509","display_name":null,"funder_award_id":"FEFE-2023-0004","funder_id":"https://openalex.org/F4320327494","funder_display_name":"Ministry of Science and Higher Education of the Russian Federation"}],"funders":[{"id":"https://openalex.org/F4320327494","display_name":"Ministry of Science and Higher Education of the Russian Federation","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7126390797.pdf","grobid_xml":"https://content.openalex.org/works/W7126390797.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Eliminating":[0],"poor":[1,191],"scaling":[2,44,150,168,185,192],"of":[3,5,28,87,143,184,190,193,196,227],"variables":[4,45,195],"minimized":[6],"functions":[7,115],"is":[8,19,91,151],"a":[9,47,102,117,224],"pressing":[10],"issue":[11],"in":[12,153,187],"solving":[13],"high-dimensional":[14,220],"minimization":[15,57],"problems":[16,222],"where":[17],"it":[18,53],"impossible":[20],"to":[21,54,76,156,204,217],"use":[22],"methods":[23,130,186,209,216],"that":[24,206],"change":[25],"the":[26,29,55,60,71,77,82,85,94,98,109,128,134,140,146,157,163,172,181,188,194,197,207],"metric":[27,33,49,89,104],"space":[30],"with":[31,101,116,133,149,167,223],"full-scale":[32],"matrices.":[34],"In":[35,64,81],"this":[36],"paper,":[37],"we":[38],"propose":[39],"an":[40,106],"iterative":[41],"method":[42,58,100,148,166],"for":[43,68,108],"using":[46],"diagonal":[48,88,103],"matrix":[50],"and":[51,59,127],"apply":[52],"gradient":[56,62,66,79,99,119,137,147,160,165,175,215],"conjugate":[61,65,136,159,164,174,214],"method.":[63,138,176],"methods,":[67],"quadratic":[69],"functions,":[70,145],"descent":[72],"directions":[73],"are":[74],"orthogonal":[75],"previous":[78],"differences.":[80],"proposed":[83],"method,":[84,161],"transformation":[86],"matrices":[90,169],"based":[92],"on":[93,112],"noted":[95],"property.":[96],"For":[97],"matrix,":[105],"estimate":[107],"convergence":[110,154],"rate":[111,155],"strongly":[113],"convex":[114],"Lipschitz":[118],"was":[120,125],"obtained.":[121],"A":[122],"computational":[123],"experiment":[124],"conducted,":[126],"presented":[129],"were":[131],"compared":[132],"Hestenes\u2013Stiefel":[135,158,173],"On":[139],"given":[141],"set":[142],"test":[144],"comparable":[152],"while":[162],"significantly":[170],"outperforms":[171],"The":[177],"obtained":[178],"results":[179],"confirm":[180],"acceleration":[182],"properties":[183],"case":[189],"function":[198],"being":[199],"minimized.":[200],"This":[201],"allows":[202],"us":[203],"conclude":[205],"studied":[208],"can":[210],"be":[211],"used":[212],"alongside":[213],"solve":[218],"smooth,":[219],"optimization":[221],"high":[225],"degree":[226],"conditionality.":[228]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2026-02-02T00:00:00"}