{"id":"https://openalex.org/W4313575371","doi":"https://doi.org/10.1080/10556788.2022.2157000","title":"A Newton-type proximal gradient method for nonlinear multi-objective optimization problems","display_name":"A Newton-type proximal gradient method for nonlinear multi-objective optimization problems","publication_year":2023,"publication_date":"2023-01-06","ids":{"openalex":"https://openalex.org/W4313575371","doi":"https://doi.org/10.1080/10556788.2022.2157000"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2022.2157000","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2022.2157000","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/A5045822024","display_name":"Md Abu Talhamainuddin Ansary","orcid":"https://orcid.org/0000-0002-7851-7785"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Md Abu Talhamainuddin Ansary","raw_affiliation_strings":["Department of Economic Sciences, Indian Institute of Technology Kanpur, Kanpur, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Economic Sciences, Indian Institute of Technology Kanpur, Kanpur, India","institution_ids":["https://openalex.org/I94234084"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5045822024"],"corresponding_institution_ids":["https://openalex.org/I94234084"],"apc_list":null,"apc_paid":null,"fwci":6.9028,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.984383,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"38","issue":"3","first_page":"570","last_page":"590"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9995999932289124,"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.9995999932289124,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12661","display_name":"Iterative Methods for Nonlinear Equations","score":0.9945999979972839,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8007775545120239},{"id":"https://openalex.org/keywords/descent-direction","display_name":"Descent direction","score":0.6357051134109497},{"id":"https://openalex.org/keywords/newtons-method-in-optimization","display_name":"Newton's method in optimization","score":0.6282276511192322},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6234973073005676},{"id":"https://openalex.org/keywords/proximal-gradient-methods","display_name":"Proximal Gradient Methods","score":0.6175772547721863},{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.5333988666534424},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5244353413581848},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.5074681639671326},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.48525094985961914},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.48076149821281433},{"id":"https://openalex.org/keywords/newtons-method","display_name":"Newton's method","score":0.46464914083480835},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4395199418067932},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4376915991306305},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.4376474618911743},{"id":"https://openalex.org/keywords/quasi-newton-method","display_name":"Quasi-Newton method","score":0.4333834946155548},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4162306785583496},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.4019511938095093},{"id":"https://openalex.org/keywords/local-convergence","display_name":"Local convergence","score":0.2644490599632263},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.2558442950248718},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.21836242079734802},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14943048357963562},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.07187628746032715}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8007775545120239},{"id":"https://openalex.org/C116149140","wikidata":"https://www.wikidata.org/wiki/Q2070951","display_name":"Descent direction","level":4,"score":0.6357051134109497},{"id":"https://openalex.org/C179127668","wikidata":"https://www.wikidata.org/wiki/Q17086396","display_name":"Newton's method in optimization","level":4,"score":0.6282276511192322},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6234973073005676},{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.6175772547721863},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.5333988666534424},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5244353413581848},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.5074681639671326},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.48525094985961914},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.48076149821281433},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.46464914083480835},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4395199418067932},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4376915991306305},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.4376474618911743},{"id":"https://openalex.org/C114954040","wikidata":"https://www.wikidata.org/wiki/Q1476018","display_name":"Quasi-Newton method","level":4,"score":0.4333834946155548},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4162306785583496},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4019511938095093},{"id":"https://openalex.org/C117898588","wikidata":"https://www.wikidata.org/wiki/Q6664310","display_name":"Local convergence","level":3,"score":0.2644490599632263},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.2558442950248718},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.21836242079734802},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14943048357963562},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.07187628746032715},{"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556788.2022.2157000","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2022.2157000","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W116770965","https://openalex.org/W641771830","https://openalex.org/W1553373771","https://openalex.org/W1595498733","https://openalex.org/W1606015457","https://openalex.org/W1967529369","https://openalex.org/W1976159118","https://openalex.org/W2004586020","https://openalex.org/W2022485595","https://openalex.org/W2030161963","https://openalex.org/W2034688818","https://openalex.org/W2050358508","https://openalex.org/W2066753768","https://openalex.org/W2080752182","https://openalex.org/W2081313036","https://openalex.org/W2088624648","https://openalex.org/W2098907614","https://openalex.org/W2100556411","https://openalex.org/W2100717205","https://openalex.org/W2118028531","https://openalex.org/W2126434943","https://openalex.org/W2127519119","https://openalex.org/W2143185749","https://openalex.org/W2157580705","https://openalex.org/W2167159964","https://openalex.org/W2493109494","https://openalex.org/W2531315337","https://openalex.org/W2621394166","https://openalex.org/W2735755676","https://openalex.org/W2763957516","https://openalex.org/W2792284751","https://openalex.org/W2796881136","https://openalex.org/W2887212779","https://openalex.org/W2899313272","https://openalex.org/W2963173886","https://openalex.org/W3022216245","https://openalex.org/W3099035862","https://openalex.org/W3101838719","https://openalex.org/W3120891614","https://openalex.org/W4224309194","https://openalex.org/W4254011475","https://openalex.org/W4302557773","https://openalex.org/W6601324878"],"related_works":["https://openalex.org/W2067520085","https://openalex.org/W4322495452","https://openalex.org/W2563719283","https://openalex.org/W1984402599","https://openalex.org/W2949437822","https://openalex.org/W2014424370","https://openalex.org/W4313575371","https://openalex.org/W4280606446","https://openalex.org/W2065000345","https://openalex.org/W3000493527"],"abstract_inverted_index":{"In":[0],"this":[1,118],"paper,":[2],"a":[3,28,32,69,75,82,98,138],"globally":[4],"convergent":[5],"Newton-type":[6],"proximal":[7],"gradient":[8],"method":[9,37,46,119,128],"is":[10,47,71,94,104,120,129],"developed":[11],"for":[12],"composite":[13],"multi-objective":[14,42],"optimization":[15,43],"problems":[16],"where":[17],"each":[18,86],"objective":[19,60],"function":[20,30],"can":[21],"be":[22],"represented":[23],"as":[24],"the":[25,66,107,111],"sum":[26],"of":[27,52,59,65,85,117,140],"smooth":[29,87],"and":[31,110,131],"nonsmooth":[33],"function.":[34,88],"The":[35,79,114,126],"proposed":[36,67,127],"deals":[38],"with":[39,133],"unconstrained":[40],"convex":[41],"problems.":[44,142],"This":[45],"free":[48],"from":[49],"any":[50],"kind":[51],"priori":[53],"chosen":[54],"parameters":[55],"or":[56],"ordering":[57],"information":[58],"functions.":[61],"At":[62],"every":[63],"iteration":[64],"method,":[68],"subproblem":[70,80],"solved":[72],"to":[73,96],"find":[74,97],"suitable":[76,99],"descent":[77,108],"direction.":[78],"uses":[81],"quadratic":[83],"approximation":[84],"An":[89],"Armijo":[90],"type":[91],"line":[92],"search":[93],"conducted":[95],"step":[100,112],"length.":[101,113],"A":[102],"sequence":[103],"generated":[105],"using":[106,137],"direction":[109],"global":[115],"convergence":[116],"justified":[121],"under":[122],"some":[123,134],"mild":[124],"assumptions.":[125],"verified":[130],"compared":[132],"existing":[135],"methods":[136],"set":[139],"test":[141]},"counts_by_year":[{"year":2026,"cited_by_count":6},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2023-01-06T00:00:00"}