{"id":"https://openalex.org/W2151092342","doi":"https://doi.org/10.1137/130940037","title":"A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization","display_name":"A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2151092342","doi":"https://doi.org/10.1137/130940037","mag":"2151092342"},"language":"en","primary_location":{"id":"doi:10.1137/130940037","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130940037","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"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 Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/10278/42404","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008549672","display_name":"Giovanni Fasano","orcid":"https://orcid.org/0000-0003-4721-8114"},"institutions":[{"id":"https://openalex.org/I149461666","display_name":"Ca' Foscari University of Venice","ror":"https://ror.org/04yzxz566","country_code":"IT","type":"education","lineage":["https://openalex.org/I149461666"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"G. Fasano","raw_affiliation_strings":["Dipartimento di Management, Universit\u00e0 Ca'Foscari Venezia, San Giobbe, Cannaregio 873, 30121 Venice, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Management, Universit\u00e0 Ca'Foscari Venezia, San Giobbe, Cannaregio 873, 30121 Venice, Italy","institution_ids":["https://openalex.org/I149461666"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030824254","display_name":"Giampaolo Liuzzi","orcid":"https://orcid.org/0000-0002-4063-8370"},"institutions":[{"id":"https://openalex.org/I4210162062","display_name":"Istituto di Analisi dei Sistemi ed Informatica Antonio Ruberti","ror":"https://ror.org/054ye0e45","country_code":"IT","type":"facility","lineage":["https://openalex.org/I4210155236","https://openalex.org/I4210162062"]},{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"G. Liuzzi","raw_affiliation_strings":["Dipartimento di Ingegneria Informatica Automatica e Gestionale \"A. Ruberti,\" \"Sapienza\" Uni-versit\u00e0 di Roma, Via Ariosto 25, 00185 Rome, Italy","Istituto di Analisi dei Sistemi ed Informatica \"A. Ruberti,\" Consiglio Nazionale delle Ricerche, Viale Manzoni 30, 00185 Rome, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria Informatica Automatica e Gestionale \"A. Ruberti,\" \"Sapienza\" Uni-versit\u00e0 di Roma, Via Ariosto 25, 00185 Rome, Italy","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"Istituto di Analisi dei Sistemi ed Informatica \"A. Ruberti,\" Consiglio Nazionale delle Ricerche, Viale Manzoni 30, 00185 Rome, Italy","institution_ids":["https://openalex.org/I4210162062"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067509935","display_name":"Stefano Lucidi","orcid":"https://orcid.org/0000-0003-4356-7958"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S. Lucidi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5040000503","display_name":"Francesco Rinaldi","orcid":"https://orcid.org/0000-0001-8978-6027"},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"F. Rinaldi","raw_affiliation_strings":["Dipartimento di Matematica, Universit\u00e0 di Padova, Via Trieste 63, 35121 Padua, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e0 di Padova, Via Trieste 63, 35121 Padua, Italy","institution_ids":["https://openalex.org/I138689650"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.6992,"has_fulltext":false,"cited_by_count":59,"citation_normalized_percentile":{"value":0.93129771,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"24","issue":"3","first_page":"959","last_page":"992"},"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/T11115","display_name":"Topology Optimization in Engineering","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural 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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9927999973297119,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6971607208251953},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6607051491737366},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.6393160820007324},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.6087182760238647},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.5864851474761963},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5766076445579529},{"id":"https://openalex.org/keywords/stationary-point","display_name":"Stationary point","score":0.5175365805625916},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.48898446559906006},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4868887960910797},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.4252723455429077},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.41927242279052734},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.41744542121887207},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.4095454812049866}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6971607208251953},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6607051491737366},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.6393160820007324},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.6087182760238647},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.5864851474761963},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5766076445579529},{"id":"https://openalex.org/C189237950","wikidata":"https://www.wikidata.org/wiki/Q2500758","display_name":"Stationary point","level":2,"score":0.5175365805625916},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.48898446559906006},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4868887960910797},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.4252723455429077},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.41927242279052734},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.41744542121887207},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.4095454812049866},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/130940037","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130940037","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"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 Optimization","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.704.9704","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.704.9704","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.iasi.cnr.it/%7Eliuzzi/papers/SIOPT_NONDIFF.pdf","raw_type":"text"},{"id":"pmh:oai:iris.uniroma1.it:11573/645124","is_oa":false,"landing_page_url":"http://www.siam.org/journals/siopt/24-3/94003.html","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","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":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:iris.unive.it:10278/42404","is_oa":true,"landing_page_url":"http://hdl.handle.net/10278/42404","pdf_url":null,"source":{"id":"https://openalex.org/S4306402336","display_name":"ARCA (Universit\u00e0 Ca' Foscari Venezia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149461666","host_organization_name":"Ca' Foscari University of Venice","host_organization_lineage":["https://openalex.org/I149461666"],"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":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:www.research.unipd.it:11577/3147001","is_oa":false,"landing_page_url":"http://hdl.handle.net/11577/3147001","pdf_url":null,"source":{"id":"https://openalex.org/S4306402547","display_name":"Padua Research Archive (University of Padova)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I138689650","host_organization_name":"University of Padua","host_organization_lineage":["https://openalex.org/I138689650"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:iris.unive.it:10278/42404","is_oa":true,"landing_page_url":"http://hdl.handle.net/10278/42404","pdf_url":null,"source":{"id":"https://openalex.org/S4306402336","display_name":"ARCA (Universit\u00e0 Ca' Foscari Venezia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149461666","host_organization_name":"Ca' Foscari University of Venice","host_organization_lineage":["https://openalex.org/I149461666"],"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":"","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"score":0.6399999856948853,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W181733065","https://openalex.org/W1451881698","https://openalex.org/W1507162258","https://openalex.org/W1539546977","https://openalex.org/W1551360398","https://openalex.org/W1552227532","https://openalex.org/W1601972095","https://openalex.org/W1971953595","https://openalex.org/W1979869067","https://openalex.org/W1990599485","https://openalex.org/W1998855065","https://openalex.org/W2000030456","https://openalex.org/W2002561307","https://openalex.org/W2017001763","https://openalex.org/W2021940557","https://openalex.org/W2024948279","https://openalex.org/W2026977976","https://openalex.org/W2028527358","https://openalex.org/W2032752826","https://openalex.org/W2034145183","https://openalex.org/W2037504242","https://openalex.org/W2039542900","https://openalex.org/W2042925520","https://openalex.org/W2048799772","https://openalex.org/W2054875385","https://openalex.org/W2057830724","https://openalex.org/W2077594413","https://openalex.org/W2077752576","https://openalex.org/W2084186221","https://openalex.org/W2084806369","https://openalex.org/W2084936896","https://openalex.org/W2093404847","https://openalex.org/W2094132822","https://openalex.org/W2094268929","https://openalex.org/W2109348499","https://openalex.org/W2110930696","https://openalex.org/W2133356919","https://openalex.org/W2148563791","https://openalex.org/W2155382668","https://openalex.org/W2162737890","https://openalex.org/W2167511885","https://openalex.org/W2184805749","https://openalex.org/W2561080469"],"related_works":["https://openalex.org/W2912146214","https://openalex.org/W2152334450","https://openalex.org/W2377522634","https://openalex.org/W3123416417","https://openalex.org/W2911717707","https://openalex.org/W2016611441","https://openalex.org/W1533819690","https://openalex.org/W2060646159","https://openalex.org/W2026979186","https://openalex.org/W3092127437"],"abstract_inverted_index":{"In":[0,23,47,67,165],"this":[1,68],"paper,":[2,171],"we":[3,27,51,70,90,102,122,137,172],"propose":[4],"new":[5],"linesearch-based":[6],"methods":[7],"for":[8,32,127],"nonsmooth":[9],"constrained":[10,54,163,182],"optimization":[11,55],"problems":[12,34,56],"when":[13,190],"first-order":[14],"information":[15],"on":[16,86,146,177],"the":[17,24,43,48,73,87,98,105,112,116,124,128,133,147,151,161,166,170,197],"problem":[18,107],"functions":[19],"is":[20,156,188],"not":[21],"available.":[22],"first":[25,71],"part,":[26,50],"describe":[28],"a":[29,157],"general":[30,79],"framework":[31,125],"bound-constrained":[33,113,129,179],"and":[35,61,82,101,180],"analyze":[36],"its":[37],"convergence":[38],"toward":[39],"stationary":[40,158],"points,":[41],"using":[42],"Clarke--Jahn":[44],"directional":[45],"derivative.":[46],"second":[49],"consider":[52],"inequality":[53],"where":[57],"both":[58,178],"objective":[59],"function":[60,95],"constraints":[62,74,81,85,100],"can":[63,108],"possibly":[64],"be":[65,109],"nonsmooth.":[66],"case,":[69],"split":[72],"into":[75],"two":[76],"subsets:":[77],"difficult":[78,99],"nonlinear":[80],"simple":[83],"bound":[84],"variables.":[88],"Then,":[89],"use":[91,123],"an":[92],"exact":[93,118],"penalty":[94,119],"to":[96,131,192],"tackle":[97],"prove":[103,138],"that":[104,139,185],"original":[106,162],"reformulated":[110],"as":[111],"minimization":[114],"of":[115,150,154,160,169],"proposed":[117],"function.":[120],"Finally,":[121],"developed":[126],"case":[130],"solve":[132],"penalized":[134],"problem.":[135,164],"Moreover,":[136],"every":[140],"accumulation":[141],"point,":[142],"under":[143],"standard":[144],"assumptions":[145],"search":[148],"directions,":[149],"generated":[152],"sequence":[153],"iterates":[155],"point":[159],"last":[167],"part":[168],"report":[173],"extended":[174],"numerical":[175],"results":[176],"nonlinearly":[181],"problems,":[183],"showing":[184],"our":[186],"approach":[187],"promising":[189],"compared":[191],"some":[193],"state-of-the-art":[194],"codes":[195],"from":[196],"literature.":[198]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}