{"id":"https://openalex.org/W1995978630","doi":"https://doi.org/10.1080/10556780500159128","title":"Cutting plane algorithms for robust conic convex optimization problems","display_name":"Cutting plane algorithms for robust conic convex optimization problems","publication_year":2006,"publication_date":"2006-06-27","ids":{"openalex":"https://openalex.org/W1995978630","doi":"https://doi.org/10.1080/10556780500159128","mag":"1995978630"},"language":"en","primary_location":{"id":"doi:10.1080/10556780500159128","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780500159128","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://americanae.aecid.es/americanae/es/registros/registro.do?tipoRegistro=MTD&idBib=3267348","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102084102","display_name":"Juan A. G\u00f3mez","orcid":null},"institutions":[{"id":"https://openalex.org/I11944219","display_name":"Universidad de La Frontera","ror":"https://ror.org/04v0snf24","country_code":"CL","type":"education","lineage":["https://openalex.org/I11944219"]}],"countries":["CL"],"is_corresponding":false,"raw_author_name":"J. A. Gomez","raw_affiliation_strings":["Departamento de Ingenier\u00eda Matem\u00e1tica, Universidad de La Frontera, Temuco, Chile","Departamento de Ingenieria Matematica, Universidad de La Frontera, Temuco, Chile.;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departamento de Ingenier\u00eda Matem\u00e1tica, Universidad de La Frontera, Temuco, Chile","institution_ids":["https://openalex.org/I11944219"]},{"raw_affiliation_string":"Departamento de Ingenieria Matematica, Universidad de La Frontera, Temuco, Chile.;","institution_ids":["https://openalex.org/I11944219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101442153","display_name":"Walter G\u00f3mez","orcid":"https://orcid.org/0000-0003-4366-5451"},"institutions":[{"id":"https://openalex.org/I172787465","display_name":"University of Concepci\u00f3n","ror":"https://ror.org/0460jpj73","country_code":"CL","type":"education","lineage":["https://openalex.org/I172787465"]}],"countries":["CL"],"is_corresponding":true,"raw_author_name":"W. Gomez","raw_affiliation_strings":["Departamento de Ingenier\u00eda Matem\u00e1tica, Universidad de Concepci\u00f3n, Casilla 160-C, Concepci\u00f3n, Chile","Departamento de Ingenier\u00eda Matem\u00e1tica, Universidad de Concepci\u00f3n, Casilla 160-C, Concepci\u00f3n - Chile"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departamento de Ingenier\u00eda Matem\u00e1tica, Universidad de Concepci\u00f3n, Casilla 160-C, Concepci\u00f3n, Chile","institution_ids":["https://openalex.org/I172787465"]},{"raw_affiliation_string":"Departamento de Ingenier\u00eda Matem\u00e1tica, Universidad de Concepci\u00f3n, Casilla 160-C, Concepci\u00f3n - Chile","institution_ids":["https://openalex.org/I172787465"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101442153"],"corresponding_institution_ids":["https://openalex.org/I172787465"],"apc_list":null,"apc_paid":null,"fwci":1.7214,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.8250898,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"21","issue":"5","first_page":"779","last_page":"803"},"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.9997000098228455,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9850999712944031,"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/cutting-plane-method","display_name":"Cutting-plane method","score":0.6563507318496704},{"id":"https://openalex.org/keywords/conic-optimization","display_name":"Conic optimization","score":0.6216638088226318},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.6197911500930786},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.5974388122558594},{"id":"https://openalex.org/keywords/conic-section","display_name":"Conic section","score":0.5487034916877747},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5187963843345642},{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.5106444954872131},{"id":"https://openalex.org/keywords/convex-cone","display_name":"Convex cone","score":0.49811697006225586},{"id":"https://openalex.org/keywords/second-order-cone-programming","display_name":"Second-order cone programming","score":0.49701693654060364},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48490458726882935},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4804779589176178},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.47980931401252747},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.46624770760536194},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.43928828835487366},{"id":"https://openalex.org/keywords/strong-duality","display_name":"Strong duality","score":0.4349077343940735},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.3852565288543701},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.37605705857276917},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3134341239929199},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.15980052947998047},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.13615569472312927},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.09812486171722412},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06140458583831787}],"concepts":[{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.6563507318496704},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.6216638088226318},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.6197911500930786},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.5974388122558594},{"id":"https://openalex.org/C108598597","wikidata":"https://www.wikidata.org/wiki/Q124255","display_name":"Conic section","level":2,"score":0.5487034916877747},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5187963843345642},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.5106444954872131},{"id":"https://openalex.org/C28340159","wikidata":"https://www.wikidata.org/wiki/Q2256541","display_name":"Convex cone","level":5,"score":0.49811697006225586},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.49701693654060364},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48490458726882935},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4804779589176178},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.47980931401252747},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.46624770760536194},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.43928828835487366},{"id":"https://openalex.org/C163863214","wikidata":"https://www.wikidata.org/wiki/Q7624553","display_name":"Strong duality","level":3,"score":0.4349077343940735},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.3852565288543701},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.37605705857276917},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3134341239929199},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.15980052947998047},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.13615569472312927},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.09812486171722412},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06140458583831787},{"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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1080/10556780500159128","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780500159128","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},{"id":"pmh:oai:americanae.aecid.es:3267348","is_oa":true,"landing_page_url":"http://americanae.aecid.es/americanae/es/registros/registro.do?tipoRegistro=MTD&idBib=3267348","pdf_url":null,"source":{"id":"https://openalex.org/S4306400786","display_name":"Americanae (AECID Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"OPTIMIZATION METHODS & SOFTWARE (PRINT)","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:americanae.aecid.es:3267349","is_oa":true,"landing_page_url":"http://americanae.aecid.es/americanae/es/registros/registro.do?tipoRegistro=MTD&idBib=3267349","pdf_url":null,"source":{"id":"https://openalex.org/S4306400786","display_name":"Americanae (AECID Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"OPTIMIZATION METHODS & SOFTWARE (PRINT)","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:localhost:10533/178248","is_oa":true,"landing_page_url":"http://hdl.handle.net/10533/178248","pdf_url":null,"source":{"id":"https://openalex.org/S4306402641","display_name":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Cient\u00edficas)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4383465926","host_organization_name":"LA Referencia","host_organization_lineage":["https://openalex.org/I4383465926"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"OPTIMIZATION METHODS & SOFTWARE (PRINT)","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:localhost:10533/178249","is_oa":true,"landing_page_url":"http://hdl.handle.net/10533/178249","pdf_url":null,"source":{"id":"https://openalex.org/S4306402641","display_name":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Cient\u00edficas)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4383465926","host_organization_name":"LA Referencia","host_organization_lineage":["https://openalex.org/I4383465926"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"OPTIMIZATION METHODS & SOFTWARE (PRINT)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:americanae.aecid.es:3267348","is_oa":true,"landing_page_url":"http://americanae.aecid.es/americanae/es/registros/registro.do?tipoRegistro=MTD&idBib=3267348","pdf_url":null,"source":{"id":"https://openalex.org/S4306400786","display_name":"Americanae (AECID Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"OPTIMIZATION METHODS & SOFTWARE (PRINT)","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W83112366","https://openalex.org/W137390859","https://openalex.org/W633194093","https://openalex.org/W1512175223","https://openalex.org/W1518992076","https://openalex.org/W1520074457","https://openalex.org/W1568307856","https://openalex.org/W1577338488","https://openalex.org/W1632601927","https://openalex.org/W1973553606","https://openalex.org/W1975993600","https://openalex.org/W1990275757","https://openalex.org/W2003667322","https://openalex.org/W2009923109","https://openalex.org/W2023349184","https://openalex.org/W2023927345","https://openalex.org/W2032807064","https://openalex.org/W2046361558","https://openalex.org/W2048093585","https://openalex.org/W2075887074","https://openalex.org/W2080162959","https://openalex.org/W2089105401","https://openalex.org/W2105235982","https://openalex.org/W2170645540","https://openalex.org/W2912522929","https://openalex.org/W4210733276","https://openalex.org/W4293820388"],"related_works":["https://openalex.org/W2594358447","https://openalex.org/W2949225936","https://openalex.org/W4297030264","https://openalex.org/W4280532596","https://openalex.org/W2952895455","https://openalex.org/W2949333496","https://openalex.org/W1964916956","https://openalex.org/W2496748414","https://openalex.org/W2901353547","https://openalex.org/W2536897863"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,59],"study":[4],"some":[5,61,83],"well-known":[6],"cases":[7,37],"of":[8,16,24,38,68,88],"nonlinear":[9,47],"programming":[10,34],"problems,":[11],"presenting":[12],"them":[13],"as":[14,76],"instances":[15],"inexact":[17,39],"or":[18,79],"semi-infinite":[19],"linear":[20],"programming.":[21,41],"The":[22,70],"class":[23],"problems":[25,48],"considered":[26],"contains,":[27],"in":[28],"particular,":[29],"semi-definite":[30,40],"programming,":[31],"second-order":[32],"cone":[33],"and":[35,92],"special":[36],"Strong":[42],"duality":[43],"results":[44],"for":[45,64],"the":[46,53,65,86,89],"studied":[49,66],"are":[50,97],"obtained":[51],"via":[52],"Lagrangian":[54],"duality.":[55],"Using":[56],"these":[57],"results,":[58],"propose":[60],"dual":[62],"algorithms":[63,72,91],"classes":[67],"problems.":[69],"proposed":[71,90],"can":[73],"be":[74],"interpreted":[75],"cutting":[77],"plane":[78],"discretization":[80],"algorithms.":[81],"Finally,":[82],"comments":[84],"on":[85,93],"convergence":[87],"preliminary":[94],"numerical":[95],"tests":[96],"given.":[98]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}