Get quick answers to your questions about the article from our AI researcher chatbot
{'id': 'https://openalex.org/W3149685881', 'doi': None, 'title': 'The Global Convergence of Self-Scaling BFGS Algorithm with Nonmonotone Line Search for Unconstrained Nonconvex Optimization Problems', 'display_name': 'The Global Convergence of Self-Scaling BFGS Algorithm with Nonmonotone Line Search for Unconstrained Nonconvex Optimization Problems', 'publication_year': 2007, 'publication_date': '2007-01-01', 'ids': {'openalex': 'https://openalex.org/W3149685881', 'mag': '3149685881'}, 'language': 'zh-cn', 'primary_location': {'is_oa': False, 'landing_page_url': 'http://www.cqvip.com/QK/85800X/200707/24869783.html', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4306549748', 'display_name': '数学学报:英文版', 'issn_l': None, 'issn': None, 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': None, 'host_organization_name': None, 'host_organization_lineage': [], 'host_organization_lineage_names': [], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'article', 'type_crossref': 'journal-article', 'indexed_in': [], 'open_access': {'is_oa': False, 'oa_status': 'closed', 'oa_url': None, 'any_repository_has_fulltext': False}, 'authorships': [{'author_position': 'first', 'author': {'id': 'https://openalex.org/A5100339372', 'display_name': 'Liangzhi Hong', 'orcid': 'https://orcid.org/0000-0002-2297-8013'}, 'institutions': [], 'countries': [], 'is_corresponding': False, 'raw_author_name': 'Hong', 'raw_affiliation_strings': [], 'affiliations': []}, {'author_position': 'middle', 'author': {'id': 'https://openalex.org/A5002348937', 'display_name': 'Qiuyu Xia', 'orcid': 'https://orcid.org/0000-0002-0717-8210'}, 'institutions': [], 'countries': [], 'is_corresponding': False, 'raw_author_name': 'Xia', 'raw_affiliation_strings': [], 'affiliations': []}, {'author_position': 'middle', 'author': {'id': 'https://openalex.org/A5100688995', 'display_name': 'Yin Yin', 'orcid': 'https://orcid.org/0009-0004-0752-3039'}, 'institutions': [], 'countries': [], 'is_corresponding': False, 'raw_author_name': 'Yin', 'raw_affiliation_strings': [], 'affiliations': []}, {'author_position': 'middle', 'author': {'id': 'https://openalex.org/A5100332432', 'display_name': 'Zongshi Dong', 'orcid': 'https://orcid.org/0000-0001-9716-8464'}, 'institutions': [], 'countries': [], 'is_corresponding': False, 'raw_author_name': 'Dong', 'raw_affiliation_strings': [], 'affiliations': []}, {'author_position': 'middle', 'author': {'id': 'https://openalex.org/A5101754024', 'display_name': 'Lei Lei', 'orcid': 'https://orcid.org/0000-0002-9144-0559'}, 'institutions': [], 'countries': [], 'is_corresponding': False, 'raw_author_name': 'Lei', 'raw_affiliation_strings': [], 'affiliations': []}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5105841445', 'display_name': 'Du', 'orcid': None}, 'institutions': [], 'countries': [], 'is_corresponding': False, 'raw_author_name': 'Du', 'raw_affiliation_strings': [], 'affiliations': []}], 'institution_assertions': [], 'countries_distinct_count': 0, 'institutions_distinct_count': 0, 'corresponding_author_ids': [], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': 0.0, 'has_fulltext': False, 'cited_by_count': 0, 'citation_normalized_percentile': {'value': 0.0, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 0, 'max': 63}, 'biblio': {'volume': '23', 'issue': '7', 'first_page': '1233', 'last_page': '1240'}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T10963', 'display_name': 'Numerical Optimization Techniques', 'score': 0.9985, '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': 'Numerical Optimization Techniques', 'score': 0.9985, '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/T10100', 'display_name': 'Swarm Intelligence Optimization Algorithms', 'score': 0.9914, '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'}}, {'id': 'https://openalex.org/T10500', 'display_name': 'Theory and Applications of Compressed Sensing', 'score': 0.9787, '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/broyden–fletcher–goldfarb–shanno-algorithm', 'display_name': 'Broyden–Fletcher–Goldfarb–Shanno algorithm', 'score': 0.9091313}, {'id': 'https://openalex.org/keywords/line-search', 'display_name': 'Line search', 'score': 0.6229883}, {'id': 'https://openalex.org/keywords/convex-optimization', 'display_name': 'Convex Optimization', 'score': 0.619415}, {'id': 'https://openalex.org/keywords/global-optimization', 'display_name': 'Global Optimization', 'score': 0.56444}, {'id': 'https://openalex.org/keywords/optimization-software', 'display_name': 'Optimization Software', 'score': 0.533797}, {'id': 'https://openalex.org/keywords/optimization-applications', 'display_name': 'Optimization Applications', 'score': 0.530415}, {'id': 'https://openalex.org/keywords/derivative-free-optimization', 'display_name': 'Derivative-Free Optimization', 'score': 0.52655}, {'id': 'https://openalex.org/keywords/line', 'display_name': 'Line (geometry)', 'score': 0.4547131}], 'concepts': [{'id': 'https://openalex.org/C132721684', 'wikidata': 'https://www.wikidata.org/wiki/Q2877013', 'display_name': 'Broyden–Fletcher–Goldfarb–Shanno algorithm', 'level': 3, 'score': 0.9091313}, {'id': 'https://openalex.org/C2777303404', 'wikidata': 'https://www.wikidata.org/wiki/Q759757', 'display_name': 'Convergence (economics)', 'level': 2, 'score': 0.7452356}, {'id': 'https://openalex.org/C126255220', 'wikidata': 'https://www.wikidata.org/wiki/Q141495', 'display_name': 'Mathematical optimization', 'level': 1, 'score': 0.6858539}, {'id': 'https://openalex.org/C85522705', 'wikidata': 'https://www.wikidata.org/wiki/Q3278015', 'display_name': 'Line search', 'level': 3, 'score': 0.6229883}, {'id': 'https://openalex.org/C99844830', 'wikidata': 'https://www.wikidata.org/wiki/Q102441924', 'display_name': 'Scaling', 'level': 2, 'score': 0.5556533}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.5268853}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.4904594}, {'id': 'https://openalex.org/C198352243', 'wikidata': 'https://www.wikidata.org/wiki/Q37105', 'display_name': 'Line (geometry)', 'level': 2, 'score': 0.4547131}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.39679474}, {'id': 'https://openalex.org/C31258907', 'wikidata': 'https://www.wikidata.org/wiki/Q1301371', 'display_name': 'Computer network', '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/C151319957', 'wikidata': 'https://www.wikidata.org/wiki/Q752739', 'display_name': 'Asynchronous communication', '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}, {'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/C162324750', 'wikidata': 'https://www.wikidata.org/wiki/Q8134', 'display_name': 'Economics', 'level': 0, 'score': 0.0}, {'id': 'https://openalex.org/C50522688', 'wikidata': 'https://www.wikidata.org/wiki/Q189833', 'display_name': 'Economic growth', 'level': 1, 'score': 0.0}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'http://www.cqvip.com/QK/85800X/200707/24869783.html', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4306549748', 'display_name': '数学学报:英文版', 'issn_l': None, 'issn': None, 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': None, 'host_organization_name': None, 'host_organization_lineage': [], 'host_organization_lineage_names': [], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}], 'best_oa_location': None, 'sustainable_development_goals': [], 'grants': [], 'datasets': [], 'versions': [], 'referenced_works_count': 0, 'referenced_works': [], 'related_works': ['https://openalex.org/W3148648702', 'https://openalex.org/W3139627051', 'https://openalex.org/W2960461445', 'https://openalex.org/W2384137679', 'https://openalex.org/W2380629935', 'https://openalex.org/W2375120501', 'https://openalex.org/W2369610373', 'https://openalex.org/W2361785493', 'https://openalex.org/W2355814762', 'https://openalex.org/W2349203978', 'https://openalex.org/W2348720316', 'https://openalex.org/W2107832525', 'https://openalex.org/W2064217481', 'https://openalex.org/W2039586685', 'https://openalex.org/W2036558771', 'https://openalex.org/W1993873758', 'https://openalex.org/W1970748391', 'https://openalex.org/W1964934933', 'https://openalex.org/W1888939350', 'https://openalex.org/W118868757'], 'abstract_inverted_index': {'自我可伸缩的伪': [0], '--': [1], '在在客观功能的麻袋布近似矩阵避免可能的大特征值在每次重复被更新以前,牛顿方法由放大麻袋布近似矩阵解决一个非强迫的优化问题。客观功能什么时候是凸的,在文学被证明了这个方法有全球、超级的线性集中(或甚至一致地凸)': [2], '。我们建议由一个自我可伸缩的': [3], 'BFGS': [4, 7, 9], '算法解决非强迫的非凸的优化问题与非单调线性搜索。Nonmonotone': [5], '线搜索为解决大规模非线性的问题作为一条竞争途径在数字惯例被认出了。我们非认为二不同单调线搜索形式和研究这些的全球集中非单调自我规模': [6], '算法。我们比在文学,自我可伸缩的': [8], '算法的两种形式为非强迫的非凸的优化问题是全球性会聚的证明那,在一些下面是更弱的状况。': [10]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W3149685881', 'counts_by_year': [], 'updated_date': '2024-09-14T15:51:26.549117', 'created_date': '2021-04-13'}