{"id":"https://openalex.org/W2027586974","doi":"https://doi.org/10.1137/070710810","title":"Computing Points that Satisfy Second Order Necessary Optimality Conditions for Unconstrained Minimization","display_name":"Computing Points that Satisfy Second Order Necessary Optimality Conditions for Unconstrained Minimization","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2027586974","doi":"https://doi.org/10.1137/070710810","mag":"2027586974"},"language":"en","primary_location":{"id":"doi:10.1137/070710810","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070710810","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/A5045265039","display_name":"A. Auslender","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Alfred Auslender","raw_affiliation_strings":["[email\u00a0protected]#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[email\u00a0protected]#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5045265039"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.12308045,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"20","issue":"4","first_page":"1868","last_page":"1884"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.996999979019165,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/line-search","display_name":"Line search","score":0.8017441630363464},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.776766300201416},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6765940189361572},{"id":"https://openalex.org/keywords/descent","display_name":"Descent (aeronautics)","score":0.6291224360466003},{"id":"https://openalex.org/keywords/descent-direction","display_name":"Descent direction","score":0.6174162030220032},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.589385449886322},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5848960280418396},{"id":"https://openalex.org/keywords/curvilinear-coordinates","display_name":"Curvilinear coordinates","score":0.5636582374572754},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5571261048316956},{"id":"https://openalex.org/keywords/curvature","display_name":"Curvature","score":0.5328382253646851},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.513568639755249},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.49831366539001465},{"id":"https://openalex.org/keywords/newtons-method","display_name":"Newton's method","score":0.47787347435951233},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.43892234563827515},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4245002865791321},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3513804078102112},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1786324381828308},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.10116651654243469},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.08706715703010559},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06662476062774658},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.06653404235839844}],"concepts":[{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.8017441630363464},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.776766300201416},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6765940189361572},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.6291224360466003},{"id":"https://openalex.org/C116149140","wikidata":"https://www.wikidata.org/wiki/Q2070951","display_name":"Descent direction","level":4,"score":0.6174162030220032},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.589385449886322},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5848960280418396},{"id":"https://openalex.org/C98343798","wikidata":"https://www.wikidata.org/wiki/Q1790208","display_name":"Curvilinear coordinates","level":2,"score":0.5636582374572754},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5571261048316956},{"id":"https://openalex.org/C195065555","wikidata":"https://www.wikidata.org/wiki/Q214881","display_name":"Curvature","level":2,"score":0.5328382253646851},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.513568639755249},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.49831366539001465},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.47787347435951233},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.43892234563827515},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4245002865791321},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3513804078102112},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1786324381828308},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.10116651654243469},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.08706715703010559},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06662476062774658},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.06653404235839844},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","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/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/070710810","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070710810","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:HAL:hal-00965641v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00965641","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Optimization, 2010, 20 (4), pp.1868-1884","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1580352598","https://openalex.org/W1967942590","https://openalex.org/W1984488466","https://openalex.org/W1993650230","https://openalex.org/W2004381194","https://openalex.org/W2009941369","https://openalex.org/W2012766316","https://openalex.org/W2022090011","https://openalex.org/W2031623512","https://openalex.org/W2043430160","https://openalex.org/W2053940560","https://openalex.org/W2062294426","https://openalex.org/W2075184363","https://openalex.org/W2087070363","https://openalex.org/W2110017196","https://openalex.org/W2167137033","https://openalex.org/W2256578114"],"related_works":["https://openalex.org/W2117094612","https://openalex.org/W9059077","https://openalex.org/W39176023","https://openalex.org/W1985812215","https://openalex.org/W2111200844","https://openalex.org/W4364382936","https://openalex.org/W2048294433","https://openalex.org/W2611695268","https://openalex.org/W2058731384","https://openalex.org/W4311325154"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"present":[4],"a":[5,26,30,35,38,44,79,86],"new":[6,74],"class":[7],"of":[8,37,40,68],"algorithms":[9,75],"for":[10,20],"computing":[11],"points":[12],"that":[13],"satisfy":[14],"second":[15],"order":[16],"necessary":[17],"optimality":[18],"conditions":[19],"unconstrained":[21],"minimization":[22],"problems.":[23],"We":[24,63],"introduce":[25],"framework":[27],"based":[28],"on":[29],"curvilinear":[31],"line":[32],"search":[33],"using":[34],"combination":[36],"direction":[39,47,70],"negative":[41],"curvature":[42],"and":[43,55,94],"Newton-type":[45],"descent":[46,69],"which":[48,72],"covers":[49],"the":[50,83],"scheme":[51],"proposed":[52],"by":[53],"Mor\u00e9":[54],"Sorensen":[56],"[Math.":[57],"Program.,":[58],"16":[59],"(1979),":[60],"pp.":[61],"1\u201320].":[62],"then":[64],"propose":[65],"two":[66,73],"kinds":[67],"from":[71],"emerge.":[76],"One":[77],"is":[78,85],"Levenberg\u2013Marquardt":[80],"direction,":[81],"while":[82],"other":[84],"cubic":[87],"regularized":[88],"Newton":[89],"direction.":[90],"Global":[91],"convergence":[92],"results":[93],"asymptotic":[95],"quadratic":[96],"rate":[97],"are":[98],"proven":[99],"under":[100],"mild":[101],"assumptions.":[102]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}