{"id":"https://openalex.org/W2086659547","doi":"https://doi.org/10.1137/070711281","title":"A Sequential Convex Semidefinite Programming Algorithm with an Application to Multiple-Load Free Material Optimization","display_name":"A Sequential Convex Semidefinite Programming Algorithm with an Application to Multiple-Load Free Material Optimization","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2086659547","doi":"https://doi.org/10.1137/070711281","mag":"2086659547"},"language":"en","primary_location":{"id":"doi:10.1137/070711281","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070711281","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/A5013459854","display_name":"Michael Stingl","orcid":"https://orcid.org/0000-0002-3626-0723"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. Stingl","raw_affiliation_strings":["stingl@am.uni-erlangen.de and leugering@am.uni-erlangen.de#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"stingl@am.uni-erlangen.de and leugering@am.uni-erlangen.de#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041987187","display_name":"Michal Ko\u010dvara","orcid":"https://orcid.org/0000-0003-4414-0083"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. Ko\u010dvara","raw_affiliation_strings":["kocvara@maths.bham.ac.uk#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"kocvara@maths.bham.ac.uk#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072544377","display_name":"G\u00fcnter Leugering","orcid":"https://orcid.org/0000-0002-1086-991X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"G. Leugering","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":10.3416,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.97912096,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"20","issue":"1","first_page":"130","last_page":"155"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11115","display_name":"Topology Optimization in Engineering","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T11115","display_name":"Topology Optimization in Engineering","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9980000257492065,"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.9976999759674072,"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/semidefinite-programming","display_name":"Semidefinite programming","score":0.8614760041236877},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7112838625907898},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6226648092269897},{"id":"https://openalex.org/keywords/semidefinite-embedding","display_name":"Semidefinite embedding","score":0.616766095161438},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.6145017743110657},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.5347766876220703},{"id":"https://openalex.org/keywords/conic-optimization","display_name":"Conic optimization","score":0.5251455307006836},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5137966275215149},{"id":"https://openalex.org/keywords/linear-matrix-inequality","display_name":"Linear matrix inequality","score":0.49920010566711426},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.48278963565826416},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.4651912748813629},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.45753127336502075},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4530978500843048},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4032914340496063},{"id":"https://openalex.org/keywords/subderivative","display_name":"Subderivative","score":0.39282897114753723},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.25074148178100586},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.0988113284111023}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.8614760041236877},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7112838625907898},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6226648092269897},{"id":"https://openalex.org/C206818286","wikidata":"https://www.wikidata.org/wiki/Q7449403","display_name":"Semidefinite embedding","level":4,"score":0.616766095161438},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.6145017743110657},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.5347766876220703},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.5251455307006836},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5137966275215149},{"id":"https://openalex.org/C201829737","wikidata":"https://www.wikidata.org/wiki/Q2022760","display_name":"Linear matrix inequality","level":2,"score":0.49920010566711426},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.48278963565826416},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.4651912748813629},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.45753127336502075},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4530978500843048},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4032914340496063},{"id":"https://openalex.org/C200661725","wikidata":"https://www.wikidata.org/wiki/Q289500","display_name":"Subderivative","level":4,"score":0.39282897114753723},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.25074148178100586},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.0988113284111023},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","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/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/070711281","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070711281","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:pure.atira.dk:openaire_cris_publications/de317252-1ac0-4ac1-b978-4846eecdb3ae","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/de317252-1ac0-4ac1-b978-4846eecdb3ae","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Stingl, M, Kocvara, M & Leugering, G 2009, 'A Sequential Convex Semidefinite Programming Algorithm with an Application to Multiple-Load Free Material Optimization', SIAM Journal on Optimization, vol. 20, no. 1, pp. 130-155. https://doi.org/10.1137/070711281","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1654273557","https://openalex.org/W1980882580","https://openalex.org/W1983448475","https://openalex.org/W1991746636","https://openalex.org/W2007421997","https://openalex.org/W2013621063","https://openalex.org/W2021979699","https://openalex.org/W2023437019","https://openalex.org/W2024435613","https://openalex.org/W2038677901","https://openalex.org/W2042360648","https://openalex.org/W2046332585","https://openalex.org/W2055870879","https://openalex.org/W2062523101","https://openalex.org/W2080417806","https://openalex.org/W2082911336","https://openalex.org/W2153245297","https://openalex.org/W2158862486","https://openalex.org/W2166798101"],"related_works":["https://openalex.org/W2348903644","https://openalex.org/W2912522929","https://openalex.org/W2734667871","https://openalex.org/W2941716933","https://openalex.org/W1544933314","https://openalex.org/W4231773446","https://openalex.org/W2771160919","https://openalex.org/W4301659259","https://openalex.org/W2952841129","https://openalex.org/W4224903435"],"abstract_inverted_index":{"A":[0],"new":[1,38,86],"method":[2,19,39,87],"for":[3],"the":[4,21,37,43,110,113],"efficient":[5],"solution":[6],"of":[7,10,36,50,101,112],"a":[8,48,73,99],"class":[9],"convex":[11,23,65],"semidefinite":[12,70],"programming":[13,24],"(SDP)":[14],"problems":[15,29,108],"is":[16,40,88,96],"introduced.":[17],"The":[18,33,67,85,94],"extends":[20],"sequential":[22],"(SCP)":[25],"concept":[26],"to":[27,41,90],"optimization":[28,45,107],"with":[30,72,104],"matrix":[31,58],"variables.":[32],"basic":[34],"idea":[35],"approximate":[42],"original":[44],"problem":[46],"by":[47,62,81,98],"sequence":[49],"subproblems,":[51],"in":[52,57],"which":[53,76],"nonlinear":[54],"functions":[55],"(defined":[56],"variables)":[59],"are":[60,69],"approximated":[61],"block":[63],"separable":[64],"functions.":[66],"subproblems":[68],"programs":[71],"favorable":[74],"structure":[75],"can":[77],"be":[78,91],"efficiently":[79],"solved":[80],"existing":[82],"SDP":[83],"software.":[84],"shown":[89],"globally":[92],"convergent.":[93],"article":[95],"concluded":[97],"series":[100],"numerical":[102],"experiments":[103],"free":[105],"material":[106],"demonstrating":[109],"effectiveness":[111],"generalized":[114],"SCP":[115],"approach.":[116]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":7},{"year":2012,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
