{"id":"https://openalex.org/W2006575733","doi":"https://doi.org/10.1137/s105262340138983x","title":"A Pattern Search Filter Method for Nonlinear Programming without Derivatives","display_name":"A Pattern Search Filter Method for Nonlinear Programming without Derivatives","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2006575733","doi":"https://doi.org/10.1137/s105262340138983x","mag":"2006575733"},"language":"en","primary_location":{"id":"doi:10.1137/s105262340138983x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s105262340138983x","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089929904","display_name":"Charles Audet","orcid":"https://orcid.org/0000-0002-3043-5393"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Charles Audet","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5109961247","display_name":"J. E. Dennis","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J. E. Dennis","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5089929904"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":28.3257,"has_fulltext":false,"cited_by_count":273,"citation_normalized_percentile":{"value":0.99909201,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"14","issue":"4","first_page":"980","last_page":"1010"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9997000098228455,"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.9997000098228455,"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.9995999932289124,"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/T11115","display_name":"Topology Optimization in Engineering","score":0.9965999722480774,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7189067006111145},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6715521812438965},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.557871401309967},{"id":"https://openalex.org/keywords/filter","display_name":"Filter (signal processing)","score":0.5029777884483337},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.5003845691680908},{"id":"https://openalex.org/keywords/pattern-search","display_name":"Pattern search","score":0.4730324447154999},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.44317159056663513},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.4276151955127716},{"id":"https://openalex.org/keywords/smoothness","display_name":"Smoothness","score":0.41209501028060913},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37687504291534424},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.3589666485786438},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20430916547775269}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7189067006111145},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6715521812438965},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.557871401309967},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.5029777884483337},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.5003845691680908},{"id":"https://openalex.org/C82691427","wikidata":"https://www.wikidata.org/wiki/Q4291856","display_name":"Pattern search","level":2,"score":0.4730324447154999},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.44317159056663513},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.4276151955127716},{"id":"https://openalex.org/C102634674","wikidata":"https://www.wikidata.org/wiki/Q868473","display_name":"Smoothness","level":2,"score":0.41209501028060913},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37687504291534424},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.3589666485786438},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20430916547775269},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","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/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s105262340138983x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s105262340138983x","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:publications.polymtl.ca:25323","is_oa":false,"landing_page_url":"https://publications.polymtl.ca/25323/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401013","display_name":"PolyPublie (\u00c9cole Polytechnique de Montr\u00e9al)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45683168","host_organization_name":"Polytechnique Montr\u00e9al","host_organization_lineage":["https://openalex.org/I45683168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article de revue"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W125310434","https://openalex.org/W1525928598","https://openalex.org/W1551360398","https://openalex.org/W1552227532","https://openalex.org/W1973518536","https://openalex.org/W1981978261","https://openalex.org/W1982087768","https://openalex.org/W1985412770","https://openalex.org/W1989288162","https://openalex.org/W1996272892","https://openalex.org/W1997138910","https://openalex.org/W1997965167","https://openalex.org/W2005874105","https://openalex.org/W2014337138","https://openalex.org/W2016670346","https://openalex.org/W2024731739","https://openalex.org/W2036255495","https://openalex.org/W2042613327","https://openalex.org/W2048799772","https://openalex.org/W2054875385","https://openalex.org/W2056621397","https://openalex.org/W2084186221","https://openalex.org/W2107073443","https://openalex.org/W4212993107","https://openalex.org/W4244913592"],"related_works":["https://openalex.org/W2089015038","https://openalex.org/W3125179639","https://openalex.org/W1983813429","https://openalex.org/W2058475249","https://openalex.org/W2079260672","https://openalex.org/W2032043463","https://openalex.org/W2102482069","https://openalex.org/W2348264490","https://openalex.org/W1971720918","https://openalex.org/W2410228078"],"abstract_inverted_index":{"This":[0],"paper":[1],"formulates":[2],"and":[3,75,183,194,208],"analyzes":[4],"a":[5,21,25,118,125,144,170],"pattern":[6,198],"search":[7,89],"method":[8,23],"for":[9,17,135,143,162],"general":[10,178],"constrained":[11,141,196],"optimization":[12],"based":[13],"on":[14,110,121,150,190,204,209],"filter":[15,22],"methods":[16],"step":[18,26],"acceptance.":[19],"Roughly,":[20],"accepts":[24],"that":[27,40,68,99],"improves":[28],"either":[29],"the":[30,35,42,64,71,81,92,100,114,122,140,148,152,175,180],"objective":[31],"function":[32,39],"value":[33,36],"or":[34,51,57,87],"of":[37,63,84,113,124,128,147,177],"some":[38,205],"measures":[41],"constraint":[43],"violation.":[44],"The":[45,200],"new":[46,65],"algorithm":[47,66,101,153,182,201],"does":[48],"not":[49,168],"compute":[50],"approximate":[52],"any":[53],"derivatives,":[54],"penalty":[55],"constants,":[56],"Lagrange":[58],"multipliers.":[59],"A":[60],"key":[61],"feature":[62],"is":[67,96,202],"it":[69],"preserves":[70],"division":[72],"into":[73],"SEARCH":[74,93],"local":[76,111],"POLL":[77],"steps,":[78],"which":[79,106,151],"allows":[80],"explicit":[82],"use":[83],"inexpensive":[85],"surrogates":[86],"random":[88],"heuristics":[90],"in":[91,139],"step.":[94],"It":[95],"shown":[97],"here":[98],"identifies":[102],"limit":[103],"points":[104],"at":[105],"optimality":[107,131],"conditions":[108,132,157],"depend":[109],"smoothness":[112],"functions":[115,137],"and,":[116,138],"to":[117],"greater":[119],"extent,":[120],"choice":[123,146],"certain":[126],"set":[127],"directions.":[129],"Stronger":[130],"are":[133],"guaranteed":[134],"smoother":[136],"case,":[142],"fortunate":[145],"directions":[149],"depends.":[154],"These":[155],"directional":[156],"generalize":[158,187],"those":[159],"given":[160],"previously":[161],"linear":[163],"constraints,":[164,179],"but":[165],"they":[166],"do":[167],"require":[169],"feasible":[171],"starting":[172],"point.":[173],"In":[174],"absence":[176],"proposed":[181],"its":[184],"convergence":[185],"analysis":[186],"previous":[188],"work":[189],"unconstrained,":[191],"bound":[192],"constrained,":[193],"linearly":[195],"generalized":[197],"search.":[199],"illustrated":[203],"test":[206],"examples":[207],"an":[210],"industrial":[211],"wing":[212],"planform":[213],"engineering":[214],"design":[215],"application.":[216]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":12},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":21},{"year":2013,"cited_by_count":20},{"year":2012,"cited_by_count":18}],"updated_date":"2026-04-02T15:55:50.835912","created_date":"2025-10-10T00:00:00"}