{"id":"https://openalex.org/W1976240149","doi":"https://doi.org/10.1080/10556780500137116","title":"Exploiting problem structure in pattern search methods for unconstrained optimization","display_name":"Exploiting problem structure in pattern search methods for unconstrained optimization","publication_year":2006,"publication_date":"2006-01-17","ids":{"openalex":"https://openalex.org/W1976240149","doi":"https://doi.org/10.1080/10556780500137116","mag":"1976240149"},"language":"en","primary_location":{"id":"doi:10.1080/10556780500137116","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780500137116","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":true,"oa_status":"green","oa_url":"https://researchportal.unamur.be/en/publications/43a0751b-4536-40db-85cf-08237a7f4596","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000759705","display_name":"C. J. Price","orcid":"https://orcid.org/0000-0001-6776-0037"},"institutions":[{"id":"https://openalex.org/I185492890","display_name":"University of Canterbury","ror":"https://ror.org/03y7q9t39","country_code":"NZ","type":"education","lineage":["https://openalex.org/I185492890"]}],"countries":["NZ"],"is_corresponding":true,"raw_author_name":"C. J. Price","raw_affiliation_strings":["Department of Mathematics and Statistics, University of Canterbury, Christchurch, New Zealand","Department of Mathematics and Statistics , University of Canterbury , Christchurch, New Zealand"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, University of Canterbury, Christchurch, New Zealand","institution_ids":["https://openalex.org/I185492890"]},{"raw_affiliation_string":"Department of Mathematics and Statistics , University of Canterbury , Christchurch, New Zealand","institution_ids":["https://openalex.org/I185492890"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002913605","display_name":"Philippe L. Toint","orcid":"https://orcid.org/0000-0002-6166-1860"},"institutions":[{"id":"https://openalex.org/I149768937","display_name":"University of Namur","ror":"https://ror.org/03d1maw17","country_code":"BE","type":"education","lineage":["https://openalex.org/I149768937"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"PH. L. Toint","raw_affiliation_strings":["Department of Mathematics , University of Namur , Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics , University of Namur , Belgium","institution_ids":["https://openalex.org/I149768937"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5000759705"],"corresponding_institution_ids":["https://openalex.org/I185492890"],"apc_list":null,"apc_paid":null,"fwci":1.7214,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.82205029,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"21","issue":"3","first_page":"479","last_page":"491"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9991999864578247,"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.9991999864578247,"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.9977999925613403,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9918000102043152,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.6767807602882385},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.6117451190948486},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5998608469963074},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49715760350227356},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4876157343387604},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4399165213108063}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6767807602882385},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.6117451190948486},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5998608469963074},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49715760350227356},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4876157343387604},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4399165213108063},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/10556780500137116","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780500137116","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"},{"id":"pmh:oai:pure.unamur.be:openaire/43a0751b-4536-40db-85cf-08237a7f4596","is_oa":true,"landing_page_url":"https://researchportal.unamur.be/en/publications/43a0751b-4536-40db-85cf-08237a7f4596","pdf_url":null,"source":{"id":"https://openalex.org/S4406922457","display_name":"Repository of the University of Namur","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Price, C & Toint, P 2006, 'Exploiting problem structure in pattern search methods for unconstrained optimization', Optimization Methods and Software, vol. 21, no. 3, pp. 479-491. https://doi.org/10.1080/10556780500137116","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.unamur.be:openaire/43a0751b-4536-40db-85cf-08237a7f4596","is_oa":true,"landing_page_url":"https://researchportal.unamur.be/en/publications/43a0751b-4536-40db-85cf-08237a7f4596","pdf_url":null,"source":{"id":"https://openalex.org/S4406922457","display_name":"Repository of the University of Namur","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Price, C & Toint, P 2006, 'Exploiting problem structure in pattern search methods for unconstrained optimization', Optimization Methods and Software, vol. 21, no. 3, pp. 479-491. https://doi.org/10.1080/10556780500137116","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W34402415","https://openalex.org/W75078828","https://openalex.org/W1484494266","https://openalex.org/W1551360398","https://openalex.org/W1973518536","https://openalex.org/W2014337138","https://openalex.org/W2054875385","https://openalex.org/W2056603712","https://openalex.org/W2061368966","https://openalex.org/W2107073443","https://openalex.org/W2120129882","https://openalex.org/W2150051236","https://openalex.org/W2152710595","https://openalex.org/W2164338644","https://openalex.org/W2171074980","https://openalex.org/W2312715465","https://openalex.org/W2883109957","https://openalex.org/W4205795514","https://openalex.org/W4244913592"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2042127053","https://openalex.org/W2142036596","https://openalex.org/W4238204885"],"abstract_inverted_index":{"A":[0],"direct":[1],"search":[2],"method":[3,10,25],"for":[4],"unconstrained":[5],"optimization":[6],"is":[7,128],"described.":[8],"The":[9,24],"makes":[11],"use":[12],"of":[13,55,103,118,139],"any":[14],"partial":[15,52,96],"separability":[16,53,97],"structure":[17,54],"that":[18,94,125],"the":[19,33,46,51,56,68,76,101,126],"objective":[20,34,57],"function":[21,35,58,73,82,104],"may":[22],"have.":[23],"uses":[26],"successively":[27],"finer":[28],"nested":[29],"grids,":[30],"and":[31,79,135],"minimizes":[32],"over":[36],"each":[37],"grid":[38],"in":[39,111],"turn.":[40],"All":[41],"grids":[42],"are":[43],"aligned":[44],"with":[45,116],"coordinate":[47],"directions,":[48],"which":[49],"allows":[50],"to":[59,71,107,120],"be":[60,121],"exploited.":[61],"This":[62],"has":[63],"two":[64],"advantages:":[65],"it":[66,80],"reduces":[67],"work":[69],"needed":[70,106],"calculate":[72],"values":[74,83],"at":[75,84],"points":[77,86],"required":[78],"provides":[81],"other":[85],"as":[87],"a":[88,109,137],"free":[89],"by-product.":[90],"Numerical":[91],"results":[92],"show":[93,124],"using":[95],"can":[98],"dramatically":[99],"reduce":[100],"number":[102],"evaluations":[105],"minimize":[108],"function,":[110],"some":[112],"cases":[113],"allowing":[114],"problems":[115,134],"thousands":[117],"variables":[119],"solved.":[122],"Results":[123],"algorithm":[127],"effective":[129],"on":[130,136],"strictly":[131],"C":[132],"1":[133],"class":[138],"non-smooth":[140],"problems.":[141]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}