{"id":"https://openalex.org/W1589101049","doi":"https://doi.org/10.1109/cdc.2002.1184356","title":"On optimality conditions for cone-constrained optimization","display_name":"On optimality conditions for cone-constrained optimization","publication_year":2003,"publication_date":"2003-08-27","ids":{"openalex":"https://openalex.org/W1589101049","doi":"https://doi.org/10.1109/cdc.2002.1184356","mag":"1589101049"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2002.1184356","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2002.1184356","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 41st IEEE Conference on Decision and Control, 2002.","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/A5085617315","display_name":"A. F. Izmailov","orcid":"https://orcid.org/0000-0001-9851-0524"},"institutions":[{"id":"https://openalex.org/I19880235","display_name":"Lomonosov Moscow State University","ror":"https://ror.org/010pmpe69","country_code":"RU","type":"education","lineage":["https://openalex.org/I19880235"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"A.F. Izmailov","raw_affiliation_strings":["Department of Computational Mathematics and Cybernetics, Moscow State University, Moscow, Russia","Dept. of Comput. Math. & Cybern., Moscow State Univ., Russia"],"affiliations":[{"raw_affiliation_string":"Department of Computational Mathematics and Cybernetics, Moscow State University, Moscow, Russia","institution_ids":["https://openalex.org/I19880235"]},{"raw_affiliation_string":"Dept. of Comput. Math. & Cybern., Moscow State Univ., Russia","institution_ids":["https://openalex.org/I19880235"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110039123","display_name":"M. V. Solodov","orcid":null},"institutions":[{"id":"https://openalex.org/I141883831","display_name":"Instituto Nacional de Matem\u00e1tica Pura e Aplicada","ror":"https://ror.org/028caqe42","country_code":"BR","type":"facility","lineage":["https://openalex.org/I141883831","https://openalex.org/I4210151455"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"M.V. Solodov","raw_affiliation_strings":["Instituto de Matem\u00e1tica Pura e Aplicada, Rio de Janeiro, Brazil","Instituto Nacional de Matem\u00e1tica Pura e Aplicada,"],"affiliations":[{"raw_affiliation_string":"Instituto de Matem\u00e1tica Pura e Aplicada, Rio de Janeiro, Brazil","institution_ids":["https://openalex.org/I141883831"]},{"raw_affiliation_string":"Instituto Nacional de Matem\u00e1tica Pura e Aplicada,","institution_ids":["https://openalex.org/I141883831"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5085617315"],"corresponding_institution_ids":["https://openalex.org/I19880235"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.07505605,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":null,"first_page":"3162","last_page":"3167"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":1.0,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9980000257492065,"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/T11115","display_name":"Topology Optimization in Engineering","score":0.9771999716758728,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"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/conic-section","display_name":"Conic section","score":0.7738035917282104},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.747509241104126},{"id":"https://openalex.org/keywords/tangent-cone","display_name":"Tangent cone","score":0.7409111261367798},{"id":"https://openalex.org/keywords/cone","display_name":"Cone (formal languages)","score":0.6556316614151001},{"id":"https://openalex.org/keywords/differentiable-function","display_name":"Differentiable function","score":0.6231011748313904},{"id":"https://openalex.org/keywords/conic-optimization","display_name":"Conic optimization","score":0.47627395391464233},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4704163372516632},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.47007066011428833},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.4661133885383606},{"id":"https://openalex.org/keywords/second-order-cone-programming","display_name":"Second-order cone programming","score":0.46391239762306213},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.45016440749168396},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.4483741521835327},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.419231116771698},{"id":"https://openalex.org/keywords/tangent","display_name":"Tangent","score":0.38293346762657166},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.29714322090148926},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.2367337942123413},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17047804594039917},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.13824564218521118},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.10807287693023682}],"concepts":[{"id":"https://openalex.org/C108598597","wikidata":"https://www.wikidata.org/wiki/Q124255","display_name":"Conic section","level":2,"score":0.7738035917282104},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.747509241104126},{"id":"https://openalex.org/C149944404","wikidata":"https://www.wikidata.org/wiki/Q2392464","display_name":"Tangent cone","level":3,"score":0.7409111261367798},{"id":"https://openalex.org/C30014739","wikidata":"https://www.wikidata.org/wiki/Q5159445","display_name":"Cone (formal languages)","level":2,"score":0.6556316614151001},{"id":"https://openalex.org/C202615002","wikidata":"https://www.wikidata.org/wiki/Q783507","display_name":"Differentiable function","level":2,"score":0.6231011748313904},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.47627395391464233},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4704163372516632},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.47007066011428833},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4661133885383606},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.46391239762306213},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.45016440749168396},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.4483741521835327},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.419231116771698},{"id":"https://openalex.org/C138187205","wikidata":"https://www.wikidata.org/wiki/Q131251","display_name":"Tangent","level":2,"score":0.38293346762657166},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.29714322090148926},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.2367337942123413},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17047804594039917},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.13824564218521118},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.10807287693023682},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2002.1184356","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2002.1184356","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 41st IEEE Conference on Decision and Control, 2002.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1601741115","https://openalex.org/W2021113044","https://openalex.org/W2021890623","https://openalex.org/W2049592925","https://openalex.org/W2086280280","https://openalex.org/W2093404847","https://openalex.org/W2122019917","https://openalex.org/W2499159698","https://openalex.org/W2524091391","https://openalex.org/W4237731557","https://openalex.org/W6727449477"],"related_works":["https://openalex.org/W3199026565","https://openalex.org/W4323321439","https://openalex.org/W3124564720","https://openalex.org/W2952330476","https://openalex.org/W2180827833","https://openalex.org/W3035234178","https://openalex.org/W2525685476","https://openalex.org/W3168920267","https://openalex.org/W2969918314","https://openalex.org/W2054608381"],"abstract_inverted_index":{"We":[0,19],"consider":[1],"feasible":[2,25],"sets":[3],"given":[4],"by":[5],"conic":[6],"constraints,":[7],"where":[8,23],"the":[9,12,21,24,34,45,74,77,93,105,117,122,125,129],"cone":[10,47,75],"defining":[11,76],"constraints":[13,68,78],"is":[14,27,79,132],"convex":[15],"with":[16,128],"nonempty":[17],"interior.":[18],"study":[20],"case":[22],"set":[26],"not":[28],"assumed":[29],"to":[30],"be":[31],"regular":[32,107,110],"in":[33,116,121],"classical":[35,58,106],"sense":[36,123],"of":[37,44,88],"Robinson":[38],"and":[39,108],"obtain":[40],"a":[41,49,61,85],"constructive":[42],"description":[43],"tangent":[46],"under":[48],"certain":[50],"new":[51],"second-order":[52,109],"regularity":[53,59],"condition.":[54],"This":[55],"condition":[56],"contains":[57],"as":[60],"special":[62,86],"case,":[63],"while":[64,112],"being":[65,114],"weaker":[66],"when":[67],"are":[69],"twice":[70],"differentiable.":[71],"Assuming":[72],"that":[73,124],"finitely":[80],"generated,":[81],"we":[82],"also":[83],"derive":[84],"form":[87],"primal-dual":[89],"optimality":[90,101],"conditions":[91,102],"for":[92,103],"corresponding":[94],"constrained":[95],"optimization":[96],"problem.":[97],"Our":[98],"results":[99],"subsume":[100],"both":[104],"cases,":[111],"still":[113],"meaningful":[115],"more":[118],"general":[119],"setting":[120],"multiplier":[126],"associated":[127],"objective":[130],"function":[131],"nonzero.":[133]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}