Iteration complexity analysis of dual first order methods for conic convex programming

Name: Work Video:
Duration: 3 min 30 s
Ion Necoara; Andrei Pătraşcu
{'id': 'https://openalex.org/W2953178205', 'doi': None, 'title': 'Iteration complexity analysis of dual first order methods for conic convex programming', 'display_name': 'Iteration complexity analysis of dual first order methods for conic convex programming', 'publication_year': 2014, 'publication_date': '2014-09-04', 'ids': {'openalex': 'https://openalex.org/W2953178205', 'mag': '2953178205'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://arxiv.org/pdf/1409.1462', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4306400194', 'display_name': 'arXiv (Cornell University)', 'issn_l': None, 'issn': None, 'is_oa': True, 'is_in_doaj': False, 'is_core': False, 'host_organization': 'https://openalex.org/I205783295', 'host_organization_name': 'Cornell University', 'host_organization_lineage': ['https://openalex.org/I205783295'], 'host_organization_lineage_names': ['Cornell University'], 'type': 'repository'}, 'license': None, 'license_id': None, 'version': 'submittedVersion', 'is_accepted': False, 'is_published': False}, 'type': 'preprint', 'type_crossref': 'posted-content', '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/A5019114471', 'display_name': 'Ion Necoara', 'orcid': 'https://orcid.org/0000-0003-1102-2654'}, 'institutions': [{'id': 'https://openalex.org/I61641377', 'display_name': 'Universitatea Națională de Știință și Tehnologie Politehnica București', 'ror': 'https://ror.org/0558j5q12', 'country_code': 'RO', 'type': 'education', 'lineage': ['https://openalex.org/I61641377']}], 'countries': ['RO'], 'is_corresponding': False, 'raw_author_name': 'Ion Necoara', 'raw_affiliation_strings': ['Automatic Control and Systems Engineering Department, University Politehnica Bucharest, 060042Bucharest, Romania#TAB#'], 'affiliations': [{'raw_affiliation_string': 'Automatic Control and Systems Engineering Department, University Politehnica Bucharest, 060042Bucharest, Romania#TAB#', 'institution_ids': ['https://openalex.org/I61641377']}]}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5049988389', 'display_name': 'Andrei Pătraşcu', 'orcid': 'https://orcid.org/0000-0002-9293-9386'}, 'institutions': [{'id': 'https://openalex.org/I61641377', 'display_name': 'Universitatea Națională de Știință și Tehnologie Politehnica București', 'ror': 'https://ror.org/0558j5q12', 'country_code': 'RO', 'type': 'education', 'lineage': ['https://openalex.org/I61641377']}], 'countries': ['RO'], 'is_corresponding': False, 'raw_author_name': 'Andrei Patrascu', 'raw_affiliation_strings': ['Automatic Control and Systems Engineering Department, University Politehnica Bucharest, 060042Bucharest, Romania#TAB#'], 'affiliations': [{'raw_affiliation_string': 'Automatic Control and Systems Engineering Department, University Politehnica Bucharest, 060042Bucharest, Romania#TAB#', 'institution_ids': ['https://openalex.org/I61641377']}]}], 'institution_assertions': [], 'countries_distinct_count': 1, 'institutions_distinct_count': 1, 'corresponding_author_ids': [], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': None, 'has_fulltext': False, 'cited_by_count': 8, 'citation_normalized_percentile': {'value': 0.845912, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 84, 'max': 85}, 'biblio': {'volume': None, 'issue': None, 'first_page': None, 'last_page': None}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T10963', 'display_name': 'Advanced Optimization Algorithms Research', 'score': 0.9996, '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.9996, '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/T10500', 'display_name': 'Sparse and Compressive Sensing Techniques', 'score': 0.9991, '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'}}, {'id': 'https://openalex.org/T10545', 'display_name': 'Optimization and Variational Analysis', 'score': 0.9986, '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/sublinear-function', 'display_name': 'Sublinear function', 'score': 0.67448634}, {'id': 'https://openalex.org/keywords/conic-section', 'display_name': 'Conic section', 'score': 0.4804782}, {'id': 'https://openalex.org/keywords/proximal-gradient-methods', 'display_name': 'Proximal Gradient Methods', 'score': 0.47203696}], 'concepts': [{'id': 'https://openalex.org/C117160843', 'wikidata': 'https://www.wikidata.org/wiki/Q338652', 'display_name': 'Sublinear function', 'level': 2, 'score': 0.67448634}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.6067768}, {'id': 'https://openalex.org/C126255220', 'wikidata': 'https://www.wikidata.org/wiki/Q141495', 'display_name': 'Mathematical optimization', 'level': 1, 'score': 0.57434094}, {'id': 'https://openalex.org/C22324862', 'wikidata': 'https://www.wikidata.org/wiki/Q652707', 'display_name': 'Lipschitz continuity', 'level': 2, 'score': 0.5515579}, {'id': 'https://openalex.org/C2780980858', 'wikidata': 'https://www.wikidata.org/wiki/Q110022', 'display_name': 'Dual (grammatical number)', 'level': 2, 'score': 0.5363072}, {'id': 'https://openalex.org/C108598597', 'wikidata': 'https://www.wikidata.org/wiki/Q124255', 'display_name': 'Conic section', 'level': 2, 'score': 0.4804782}, {'id': 'https://openalex.org/C145446738', 'wikidata': 'https://www.wikidata.org/wiki/Q319913', 'display_name': 'Convex function', 'level': 3, 'score': 0.47793248}, {'id': 'https://openalex.org/C10494615', 'wikidata': 'https://www.wikidata.org/wiki/Q17086765', 'display_name': 'Proximal Gradient Methods', 'level': 4, 'score': 0.47203696}, {'id': 'https://openalex.org/C2776029896', 'wikidata': 'https://www.wikidata.org/wiki/Q3935810', 'display_name': 'Relaxation (psychology)', 'level': 2, 'score': 0.45623565}, {'id': 'https://openalex.org/C2777303404', 'wikidata': 'https://www.wikidata.org/wiki/Q759757', 'display_name': 'Convergence (economics)', 'level': 2, 'score': 0.44035786}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.33179304}, {'id': 'https://openalex.org/C112680207', 'wikidata': 'https://www.wikidata.org/wiki/Q714886', 'display_name': 'Regular polygon', 'level': 2, 'score': 0.30024964}, {'id': 'https://openalex.org/C118615104', 'wikidata': 'https://www.wikidata.org/wiki/Q121416', 'display_name': 'Discrete mathematics', 'level': 1, 'score': 0.12139931}, {'id': 'https://openalex.org/C142362112', 'wikidata': 'https://www.wikidata.org/wiki/Q735', 'display_name': 'Art', '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/C77805123', 'wikidata': 'https://www.wikidata.org/wiki/Q161272', 'display_name': 'Social psychology', 'level': 1, 'score': 0.0}, {'id': 'https://openalex.org/C15744967', 'wikidata': 'https://www.wikidata.org/wiki/Q9418', 'display_name': 'Psychology', '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/C124952713', 'wikidata': 'https://www.wikidata.org/wiki/Q8242', 'display_name': 'Literature', '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': 'https://arxiv.org/pdf/1409.1462', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4306400194', 'display_name': 'arXiv (Cornell University)', 'issn_l': None, 'issn': None, 'is_oa': True, 'is_in_doaj': False, 'is_core': False, 'host_organization': 'https://openalex.org/I205783295', 'host_organization_name': 'Cornell University', 'host_organization_lineage': ['https://openalex.org/I205783295'], 'host_organization_lineage_names': ['Cornell University'], 'type': 'repository'}, 'license': None, 'license_id': None, 'version': 'submittedVersion', 'is_accepted': False, 'is_published': False}], 'best_oa_location': None, 'sustainable_development_goals': [], 'grants': [], 'datasets': [], 'versions': [], 'referenced_works_count': 22, 'referenced_works': ['https://openalex.org/W1963529497', 'https://openalex.org/W1981832695', 'https://openalex.org/W2030121914', 'https://openalex.org/W2030161963', 'https://openalex.org/W2032606187', 'https://openalex.org/W2044774602', 'https://openalex.org/W2053764342', 'https://openalex.org/W2088624648', 'https://openalex.org/W2100556411', 'https://openalex.org/W2101868363', 'https://openalex.org/W2104842473', 'https://openalex.org/W2106424475', 'https://openalex.org/W2106821132', 'https://openalex.org/W2114085163', 'https://openalex.org/W2117669906', 'https://openalex.org/W2149192560', 'https://openalex.org/W2153745131', 'https://openalex.org/W2159715570', 'https://openalex.org/W2167732364', 'https://openalex.org/W2169391377', 'https://openalex.org/W2951002577', 'https://openalex.org/W3141595720'], 'related_works': ['https://openalex.org/W618403043', 'https://openalex.org/W3210217805', 'https://openalex.org/W3197462066', 'https://openalex.org/W3197127237', 'https://openalex.org/W3094805694', 'https://openalex.org/W2985873675', 'https://openalex.org/W2963043933', 'https://openalex.org/W2962713896', 'https://openalex.org/W2899571732', 'https://openalex.org/W2801307826', 'https://openalex.org/W2773963532', 'https://openalex.org/W2585429438', 'https://openalex.org/W2344362920', 'https://openalex.org/W2234873940', 'https://openalex.org/W2116534411', 'https://openalex.org/W2035193411', 'https://openalex.org/W2032415977', 'https://openalex.org/W2019589394', 'https://openalex.org/W1976062981', 'https://openalex.org/W1877361590'], 'abstract_inverted_index': {'In': [0], 'this': [1], 'paper': [2], 'we': [3, 37, 49, 76], 'provide': [4, 77], 'a': [5], 'detailed': [6], 'analysis': [7, 64, 96, 121], 'of': [8, 12, 89, 102, 105, 114, 127], 'the': [9, 29, 39, 44, 57, 83, 90, 99, 103, 106, 115, 118, 131], 'iteration': [10, 119], 'complexity': [11, 120], 'dual': [13, 51, 59, 66, 107], 'first': [14, 52, 67], 'order': [15, 53, 68], 'methods': [16], 'for': [17, 55, 65], 'solving': [18, 56], 'conic': [19], 'convex': [20, 35], 'problems.': [21], 'When': [22], 'it': [23], 'is': [24, 122], 'difficult': [25], 'to': [26, 42], 'project': [27], 'on': [28, 82, 98, 124], 'primal': [30, 84, 93, 129, 133, 138], 'feasible': [31], 'set': [32], 'described': [33], 'by': [34], 'constraints,': [36], 'use': [38], 'Lagrangian': [40], 'relaxation': [41], 'handle': [43], 'complicated': [45], 'constraints': [46], 'and': [47, 72, 86], 'then,': [48], 'apply': [50], 'algorithms': [54, 69], 'corresponding': [58], 'problem.': [60], 'We': [61], 'give': [62], 'convergence': [63], '(dual': [70], 'gradient': [71, 74, 104], 'fast': [73], 'algorithms):': [75], 'sublinear': [78], 'or': [79, 109, 135], 'linear': [80], 'estimates': [81], 'suboptimality': [85], 'feasibility': [87], 'violation': [88], 'generated': [91], 'approximate': [92, 128], 'solutions.': [94], 'Our': [95], 'relies': [97], 'Lipschitz': [100], 'property': [101, 113], 'function': [108], 'an': [110, 136], 'error': [111], 'bound': [112], 'dual.': [116], 'Furthermore,': [117], 'based': [123], 'two': [125], 'types': [126], 'solutions:': [130], 'last': [132], 'iterate': [134], 'average': [137], 'sequence.': [139]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2953178205', 'counts_by_year': [{'year': 2019, 'cited_by_count': 1}, {'year': 2016, 'cited_by_count': 1}, {'year': 2015, 'cited_by_count': 6}], 'updated_date': '2024-12-15T06:49:09.236847', 'created_date': '2019-06-27'}
Publication Information

Basic Information

Access and Citation

AI Researcher Chatbot

Primary Location

Authors

Topics

Keywords

Related Works
