{"id":"https://openalex.org/W2143370789","doi":"https://doi.org/10.1109/acc.2007.4282546","title":"Limited memory quasi-Newton methods for problems with box constraints","display_name":"Limited memory quasi-Newton methods for problems with box constraints","publication_year":2007,"publication_date":"2007-07-01","ids":{"openalex":"https://openalex.org/W2143370789","doi":"https://doi.org/10.1109/acc.2007.4282546","mag":"2143370789"},"language":"en","primary_location":{"id":"doi:10.1109/acc.2007.4282546","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acc.2007.4282546","pdf_url":null,"source":{"id":"https://openalex.org/S4210168941","display_name":"Proceedings of the ... American Control Conference/Proceedings of the American Control Conference","issn_l":"0743-1619","issn":["0743-1619","2378-5861"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 American Control Conference","raw_type":"proceedings-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/A5082411810","display_name":"R. Pytlak","orcid":"https://orcid.org/0000-0001-6181-804X"},"institutions":[{"id":"https://openalex.org/I2800249161","display_name":"Military University of Technology in Warsaw","ror":"https://ror.org/05fct5h31","country_code":"PL","type":"education","lineage":["https://openalex.org/I2800249161"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"R. Pytlak","raw_affiliation_strings":["Faculty of Cybernetics, Military University of Technology, Warsaw, Poland","Mil. Univ. of Technol., Warsaw"],"affiliations":[{"raw_affiliation_string":"Faculty of Cybernetics, Military University of Technology, Warsaw, Poland","institution_ids":["https://openalex.org/I2800249161"]},{"raw_affiliation_string":"Mil. Univ. of Technol., Warsaw","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021413609","display_name":"Tomasz Tarnawski","orcid":"https://orcid.org/0000-0002-9756-7307"},"institutions":[{"id":"https://openalex.org/I2800249161","display_name":"Military University of Technology in Warsaw","ror":"https://ror.org/05fct5h31","country_code":"PL","type":"education","lineage":["https://openalex.org/I2800249161"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"T. Tarnawski","raw_affiliation_strings":["Faculty of Cybernetics, Military University of Technology, Warsaw, Poland","Mil. Univ. of Technol., Warsaw"],"affiliations":[{"raw_affiliation_string":"Faculty of Cybernetics, Military University of Technology, Warsaw, Poland","institution_ids":["https://openalex.org/I2800249161"]},{"raw_affiliation_string":"Mil. Univ. of Technol., Warsaw","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5082411810"],"corresponding_institution_ids":["https://openalex.org/I2800249161"],"apc_list":null,"apc_paid":null,"fwci":0.6316,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.61702128,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"29","issue":null,"first_page":"1257","last_page":"1262"},"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.9976999759674072,"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/T12661","display_name":"Iterative Methods for Nonlinear Equations","score":0.989300012588501,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/broyden\u2013fletcher\u2013goldfarb\u2013shanno-algorithm","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","score":0.8181624412536621},{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.6972031593322754},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6613662838935852},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6186753511428833},{"id":"https://openalex.org/keywords/descent-direction","display_name":"Descent direction","score":0.5358473062515259},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5254151821136475},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5168848037719727},{"id":"https://openalex.org/keywords/quasi-newton-method","display_name":"Quasi-Newton method","score":0.49991869926452637},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.4921843111515045},{"id":"https://openalex.org/keywords/newtons-method","display_name":"Newton's method","score":0.48375988006591797},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.48190051317214966},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4523244798183441},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.4313974976539612},{"id":"https://openalex.org/keywords/working-set","display_name":"Working set","score":0.42327481508255005},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.36070388555526733},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2924113869667053},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.2626248002052307},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13762080669403076},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.0777946412563324},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.0774010717868805}],"concepts":[{"id":"https://openalex.org/C132721684","wikidata":"https://www.wikidata.org/wiki/Q2877013","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","level":3,"score":0.8181624412536621},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.6972031593322754},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6613662838935852},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6186753511428833},{"id":"https://openalex.org/C116149140","wikidata":"https://www.wikidata.org/wiki/Q2070951","display_name":"Descent direction","level":4,"score":0.5358473062515259},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5254151821136475},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5168848037719727},{"id":"https://openalex.org/C114954040","wikidata":"https://www.wikidata.org/wiki/Q1476018","display_name":"Quasi-Newton method","level":4,"score":0.49991869926452637},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4921843111515045},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.48375988006591797},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.48190051317214966},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4523244798183441},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.4313974976539612},{"id":"https://openalex.org/C88196245","wikidata":"https://www.wikidata.org/wiki/Q8034984","display_name":"Working set","level":2,"score":0.42327481508255005},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.36070388555526733},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2924113869667053},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.2626248002052307},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13762080669403076},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.0777946412563324},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.0774010717868805},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"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/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"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/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"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":1,"locations":[{"id":"doi:10.1109/acc.2007.4282546","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acc.2007.4282546","pdf_url":null,"source":{"id":"https://openalex.org/S4210168941","display_name":"Proceedings of the ... American Control Conference/Proceedings of the American Control Conference","issn_l":"0743-1619","issn":["0743-1619","2378-5861"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 American Control Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1964152012","https://openalex.org/W2005126631","https://openalex.org/W2018538340","https://openalex.org/W2045968916","https://openalex.org/W2048221927","https://openalex.org/W2058839679","https://openalex.org/W2091917610","https://openalex.org/W2124612350","https://openalex.org/W2132347401","https://openalex.org/W2148589597","https://openalex.org/W2153532571","https://openalex.org/W2162988958","https://openalex.org/W2616867048","https://openalex.org/W2798909945","https://openalex.org/W3029645440","https://openalex.org/W3185399294","https://openalex.org/W4240823076","https://openalex.org/W6655051882","https://openalex.org/W6665091071","https://openalex.org/W6750968397","https://openalex.org/W6799348317"],"related_works":["https://openalex.org/W4293559771","https://openalex.org/W2092087339","https://openalex.org/W2768763952","https://openalex.org/W2615612939","https://openalex.org/W1993453088","https://openalex.org/W2010088179","https://openalex.org/W2067207573","https://openalex.org/W2761098424","https://openalex.org/W2563719283","https://openalex.org/W2949437822"],"abstract_inverted_index":{"The":[0,16],"paper":[1],"describes":[2],"new":[3],"limited":[4,26,78],"memory":[5,27,79],"quasi-Newton":[6,28],"algorithms":[7,17,49,112],"for":[8,61],"large":[9],"scale":[10],"nonconvex":[11],"problems":[12],"with":[13,34],"box":[14,35],"constraints.":[15],"employ":[18],"a":[19,37,41,54,93,105],"direction":[20],"of":[21,96],"descent":[22],"obtained":[23],"by":[24,53],"applying":[25],"updates.":[29],"In":[30],"order":[31],"to":[32,89,115],"cope":[33],"constraints":[36],"projection":[38],"operator":[39],"on":[40],"feasible":[42],"set":[43,103],"is":[44,74],"applied.":[45],"We":[46,58,107,118],"introduce":[47],"several":[48],"which":[50,123],"mainly":[51],"differ":[52],"directional":[55],"minimization":[56],"rule.":[57],"show":[59,90],"that":[60,70,91,109],"the":[62,68,71,77,98,110],"considered":[63],"line":[64],"search":[65],"rules,":[66],"under":[67],"assumption":[69],"objective":[72],"function":[73],"strictly":[75],"convex,":[76],"BFGS":[80],"versions":[81],"are":[82,87,113],"globally":[83],"convergent.":[84],"Furthermore,":[85],"we":[86],"able":[88],"after":[92],"finite":[94],"number":[95],"iterations":[97],"methods":[99],"identify":[100],"an":[101],"active":[102],"at":[104],"solution.":[106],"believe":[108],"proposed":[111],"competitive":[114],"L-BFGS-B":[116],"algorithm.":[117],"give":[119],"some":[120],"numerical":[121],"results":[122],"support":[124],"our":[125],"claim.":[126]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}