{"id":"https://openalex.org/W7214970835","doi":"https://doi.org/10.48550/arxiv.2609.36282","title":"A projected descent method for minimization of weakly semismooth functions over polyhedral sets","display_name":"A projected descent method for minimization of weakly semismooth functions over polyhedral sets","publication_year":2026,"publication_date":"2026-09-28","ids":{"openalex":"https://openalex.org/W7214970835","doi":"https://doi.org/10.48550/arxiv.2609.36282"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.36282","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.36282","pdf_url":"https://arxiv.org/pdf/2609.36282","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2609.36282","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042638754","display_name":"Morteza Maleknia","orcid":"https://orcid.org/0000-0001-8576-3119","observed_orcids":["https://orcid.org/0000-0001-8576-3119"]},"institutions":[{"id":"https://openalex.org/I170013655","display_name":"Isfahan University of Technology","ror":"https://ror.org/00af3sa43","country_code":"IR","type":"education","lineage":["https://openalex.org/I170013655"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Maleknia, Morteza","raw_affiliation_strings":["Department of Mathematical Sciences , Isfahan University of Technology , Isfahan 84156-83111 , Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences , Isfahan University of Technology , Isfahan 84156-83111 , Iran","institution_ids":["https://openalex.org/I170013655"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072327042","display_name":"Majid Soleimani-damaneh","orcid":"https://orcid.org/0000-0002-5913-1035","observed_orcids":["https://orcid.org/0000-0002-5913-1035"]},"institutions":[{"id":"https://openalex.org/I23946033","display_name":"University of Tehran","ror":"https://ror.org/05vf56z40","country_code":"IR","type":"education","lineage":["https://openalex.org/I23946033"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Soleimani-damaneh, Majid","raw_affiliation_strings":["School of Mathematics, Statistics and Computer Science , College of Science , University of Tehran , Tehran , Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics, Statistics and Computer Science , College of Science , University of Tehran , Tehran , Iran","institution_ids":["https://openalex.org/I23946033"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.8960000276565552,"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"}},"topics":[{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.8960000276565552,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.10019999742507935,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.0003000000142492354,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/polyhedral-sets","display_name":"polyhedral sets","score":0.9340000152587891},{"id":"https://openalex.org/keywords/nonsmooth-nonconvex-optimization","display_name":"nonsmooth nonconvex optimization","score":0.8759999871253967},{"id":"https://openalex.org/keywords/backtracking-line-search","display_name":"backtracking line search","score":0.8379999995231628},{"id":"https://openalex.org/keywords/optimality-conditions","display_name":"optimality conditions","score":0.6790000200271606},{"id":"https://openalex.org/keywords/convergence-analysis","display_name":"convergence analysis","score":0.7300000190734863},{"id":"https://openalex.org/keywords/image-denoising","display_name":"image denoising","score":0.800000011920929},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"multi-objective optimization","score":0.9620000123977661},{"id":"https://openalex.org/keywords/clustering","display_name":"clustering","score":0.9629999995231628},{"id":"https://openalex.org/keywords/sequential-linearization","display_name":"sequential linearization","score":0.859000027179718}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6977999806404114},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.6331999897956848},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5512999892234802},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5087000131607056},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.49459999799728394},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.48429998755455017},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4796999990940094},{"id":"https://openalex.org/C116149140","wikidata":"https://www.wikidata.org/wiki/Q2070951","display_name":"Descent direction","level":4,"score":0.4699999988079071},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4447000026702881},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4180000126361847},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4081999957561493},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.39879998564720154},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.3912999927997589},{"id":"https://openalex.org/C189237950","wikidata":"https://www.wikidata.org/wiki/Q2500758","display_name":"Stationary point","level":2,"score":0.37929999828338623},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.3783000111579895},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.36970001459121704},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.3395000100135803},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.329800009727478},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.32190001010894775},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.30730000138282776},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.3034000098705292},{"id":"https://openalex.org/C65557600","wikidata":"https://www.wikidata.org/wiki/Q7249451","display_name":"Projection method","level":3,"score":0.2955000102519989},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.2799000144004822},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2752000093460083},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.27239999175071716},{"id":"https://openalex.org/C21080849","wikidata":"https://www.wikidata.org/wiki/Q13611879","display_name":"Data point","level":2,"score":0.2718999981880188},{"id":"https://openalex.org/C204259536","wikidata":"https://www.wikidata.org/wiki/Q787903","display_name":"Linear search","level":2,"score":0.265500009059906},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.2623000144958496},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.2621000111103058},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.25690001249313354},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.2554999887943268},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.25029999017715454}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.36282","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.36282","pdf_url":"https://arxiv.org/pdf/2609.36282","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},{"id":"doi:10.48550/arxiv.2609.36282","doi":"https://doi.org/10.48550/arxiv.2609.36282","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.36282","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2609.36282","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.36282","pdf_url":"https://arxiv.org/pdf/2609.36282","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7214970835.pdf","grobid_xml":"https://content.openalex.org/works/W7214970835.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4364382936","https://openalex.org/W4392366352","https://openalex.org/W7207824053","https://openalex.org/W2129765420","https://openalex.org/W2044502366","https://openalex.org/W2008444055","https://openalex.org/W2083406795","https://openalex.org/W2090084467","https://openalex.org/W193527633","https://openalex.org/W2049774238"],"abstract_inverted_index":{"This":[0],"study":[1],"develops":[2],"a":[3,57,78,102,113,171,187,220],"projection-based":[4,21],"descent":[5,22],"method":[6,33,127,185,210],"for":[7,117],"minimizing":[8],"weakly":[9],"semismooth":[10],"functions":[11],"over":[12,46],"polyhedral":[13],"sets,":[14],"taking":[15],"an":[16,35],"initial":[17],"step":[18,169],"toward":[19],"extending":[20],"algorithms":[23],"to":[24,55,69,87,211],"nonsmooth,":[25],"nonconvex":[26],"optimization":[27],"problems.":[28],"At":[29],"each":[30,151],"iteration,":[31],"the":[32,39,43,47,71,74,93,109,118,125,134,156,166,177,183,205,208],"considers":[34],"inner":[36],"approximation":[37,96],"of":[38,73,81,104,124,150,158,182,190,207],"Clarke":[40,94],"$\\varepsilon$-subdifferential":[41,95],"at":[42],"current":[44],"iterate":[45],"feasible":[48],"region":[49],"and":[50,179,200],"uses":[51],"its":[52],"least-norm":[53],"element":[54],"generate":[56],"search":[58,65,84],"direction.":[59],"An":[60],"exponential":[61],"limited":[62],"backtracking":[63],"line":[64,83],"is":[66,85,153,161],"then":[67],"developed":[68],"assess":[70],"quality":[72],"generated":[75],"direction,":[76],"while":[77],"projected":[79],"variant":[80],"Mifflin's":[82],"proposed":[86,119,126,184,209],"identify":[88,142],"nonredundant":[89],"subgradients":[90],"that":[91,146,165],"enrich":[92],"when":[97],"necessary.":[98],"To":[99,203],"quantify":[100],"stationarity,":[101],"characterization":[103],"stationary":[105,172],"points":[106],"based":[107,223],"on":[108,224],"projection":[110],"operator":[111],"yields":[112],"computable":[114],"optimality":[115],"measure":[116],"method.":[120],"The":[121],"convergence":[122],"properties":[123],"are":[128],"established":[129],"under":[130],"mild":[131],"assumptions.":[132],"If":[133,155],"algorithm":[135],"generates":[136,170],"infinitely":[137],"many":[138],"serious":[139,159,168],"steps,":[140],"we":[141,163,218],"two":[143],"subsequences":[144],"such":[145],"every":[147],"cluster":[148],"point":[149],"subsequence":[152],"stationary.":[154],"number":[157],"steps":[160],"finite,":[162],"show":[164],"final":[167],"point.":[173],"Numerical":[174],"experiments":[175],"demonstrate":[176],"efficiency":[178],"broad":[180],"applicability":[181,206],"across":[186],"wide":[188],"range":[189],"test":[191],"problems,":[192],"including":[193],"applications":[194],"in":[195],"image":[196],"denoising,":[197],"multiobjective":[198],"optimization,":[199],"data":[201],"clustering.":[202],"extend":[204],"problems":[212],"with":[213],"general":[214],"smooth":[215],"nonlinear":[216],"constraints,":[217],"propose":[219],"heuristic":[221],"approach":[222],"sequential":[225],"linearization.":[226]},"counts_by_year":[],"updated_date":"2026-11-06T12:05:46.655746","created_date":"2026-10-01T00:00:00"}