{"id":"https://openalex.org/W2014101933","doi":"https://doi.org/10.1007/s101070050112","title":"A primal-dual trust-region algorithm for non-convex nonlinear programming","display_name":"A primal-dual trust-region algorithm for non-convex nonlinear programming","publication_year":2000,"publication_date":"2000-04-01","ids":{"openalex":"https://openalex.org/W2014101933","doi":"https://doi.org/10.1007/s101070050112","mag":"2014101933"},"language":"en","primary_location":{"id":"doi:10.1007/s101070050112","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s101070050112","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","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/A5103149740","display_name":"Andrew R. Conn","orcid":"https://orcid.org/0000-0001-7470-1035"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]},{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew R. Conn","raw_affiliation_strings":["IBM T.J. Watson Research Center, P.O.Box 218, Yorktown Heights, NY, USA, e-mail: arconn@watson.ibm.com, , , , , , US","IBM T.J. Watson Research Center, P.O.Box 218, Yorktown Heights, NY, USA, e-mail: arconn@watson.ibm.com, US"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM T.J. Watson Research Center, P.O.Box 218, Yorktown Heights, NY, USA, e-mail: arconn@watson.ibm.com, , , , , , US","institution_ids":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]},{"raw_affiliation_string":"IBM T.J. Watson Research Center, P.O.Box 218, Yorktown Heights, NY, USA, e-mail: arconn@watson.ibm.com, US","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007869277","display_name":"Nicholas I. M. Gould","orcid":"https://orcid.org/0000-0002-1031-1588"},"institutions":[{"id":"https://openalex.org/I1286704778","display_name":"Rutherford Appleton Laboratory","ror":"https://ror.org/03gq8fr08","country_code":"GB","type":"facility","lineage":["https://openalex.org/I1286704778","https://openalex.org/I162524378","https://openalex.org/I4210087105"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Nicholas I. M. Gould","raw_affiliation_strings":["Rutherford Appleton Laboratory, Computational Science and Engineering Departement, Chilton, Oxfordshire, England, e-mail: n.gould@rl.ac.uk, , , , , , GB","Rutherford Appleton Laboratory, Computational Science and Engineering Departement, Chilton, Oxfordshire, England, e-mail: n.gould@rl.ac.uk, GB"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutherford Appleton Laboratory, Computational Science and Engineering Departement, Chilton, Oxfordshire, England, e-mail: n.gould@rl.ac.uk, , , , , , GB","institution_ids":["https://openalex.org/I1286704778"]},{"raw_affiliation_string":"Rutherford Appleton Laboratory, Computational Science and Engineering Departement, Chilton, Oxfordshire, England, e-mail: n.gould@rl.ac.uk, GB","institution_ids":["https://openalex.org/I1286704778"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027758717","display_name":"Dominique Orban","orcid":"https://orcid.org/0000-0002-8017-7687"},"institutions":[{"id":"https://openalex.org/I4210106946","display_name":"Centre Europ\u00e9en de Recherche et de Formation Avanc\u00e9e en Calcul Scientifique","ror":"https://ror.org/02dzbc556","country_code":"FR","type":"facility","lineage":["https://openalex.org/I4210106946"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Dominique Orban","raw_affiliation_strings":["CERFACS, 42 Avenue Gaspard Coriolis, 31057 Toulouse Cedex 1, France, e-mail: Dominique.Orban@cerfacs.fr, , , , , , FR","CERFACS, 42 Avenue Gaspard Coriolis, 31057 Toulouse Cedex 1, France, e-mail: Dominique.Orban@cerfacs.fr, , FR"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CERFACS, 42 Avenue Gaspard Coriolis, 31057 Toulouse Cedex 1, France, e-mail: Dominique.Orban@cerfacs.fr, , , , , , FR","institution_ids":["https://openalex.org/I4210106946"]},{"raw_affiliation_string":"CERFACS, 42 Avenue Gaspard Coriolis, 31057 Toulouse Cedex 1, France, e-mail: Dominique.Orban@cerfacs.fr, , FR","institution_ids":["https://openalex.org/I4210106946"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002913605","display_name":"Philippe L. Toint","orcid":"https://orcid.org/0000-0002-6166-1860"},"institutions":[{"id":"https://openalex.org/I149768937","display_name":"University of Namur","ror":"https://ror.org/03d1maw17","country_code":"BE","type":"education","lineage":["https://openalex.org/I149768937"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Philippe L. Toint","raw_affiliation_strings":["Facult\u00e9s Universitaires Notre-Dame de la Paix, 61, rue de Bruxelles, B-5000 Namur, Belgium, e-mail: Philippe.Toint@fundp.ac.be, , , , , , BE","Facult\u00e9s Universitaires Notre-Dame de la Paix, 61, rue de Bruxelles, B-5000 Namur, Belgium, e-mail: Philippe.Toint@fundp.ac.be, , BE"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Facult\u00e9s Universitaires Notre-Dame de la Paix, 61, rue de Bruxelles, B-5000 Namur, Belgium, e-mail: Philippe.Toint@fundp.ac.be, , , , , , BE","institution_ids":["https://openalex.org/I149768937"]},{"raw_affiliation_string":"Facult\u00e9s Universitaires Notre-Dame de la Paix, 61, rue de Bruxelles, B-5000 Namur, Belgium, e-mail: Philippe.Toint@fundp.ac.be, , BE","institution_ids":["https://openalex.org/I149768937"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":11.61,"has_fulltext":false,"cited_by_count":81,"citation_normalized_percentile":{"value":0.9897017,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"87","issue":"2","first_page":"215","last_page":"249"},"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.9934999942779541,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.9840999841690063,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/mathematics","display_name":"Mathematics","score":0.7691208720207214},{"id":"https://openalex.org/keywords/trust-region","display_name":"Trust region","score":0.7342062592506409},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.568902850151062},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.5686584115028381},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.5640093684196472},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.5591311454772949},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.5571439862251282},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5365016460418701},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.515840470790863},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5132436752319336},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5061103701591492},{"id":"https://openalex.org/keywords/descent-direction","display_name":"Descent direction","score":0.48763003945350647},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4819929003715515},{"id":"https://openalex.org/keywords/descent","display_name":"Descent (aeronautics)","score":0.45711448788642883},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.42995989322662354},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.38185304403305054},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37302207946777344},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.24072858691215515},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19073066115379333}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7691208720207214},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.7342062592506409},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.568902850151062},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.5686584115028381},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.5640093684196472},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.5591311454772949},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5571439862251282},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5365016460418701},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.515840470790863},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5132436752319336},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5061103701591492},{"id":"https://openalex.org/C116149140","wikidata":"https://www.wikidata.org/wiki/Q2070951","display_name":"Descent direction","level":4,"score":0.48763003945350647},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4819929003715515},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.45711448788642883},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.42995989322662354},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.38185304403305054},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37302207946777344},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.24072858691215515},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19073066115379333},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"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/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","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/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"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/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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","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":4,"locations":[{"id":"doi:10.1007/s101070050112","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s101070050112","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:oai:pure.unamur.be:openaire_cris_publications/b8b31629-9690-4868-bb2f-acf00f552e69","is_oa":false,"landing_page_url":"https://researchportal.unamur.be/en/publications/b8b31629-9690-4868-bb2f-acf00f552e69","pdf_url":null,"source":{"id":"https://openalex.org/S4406922457","display_name":"Repository of the University of Namur","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Conn, A, Gould, N, Orban, D & Toint, P 2000, 'A primal-dual trust-region algorithm for non-convex nonlinear programming', Mathematical Programming, vol. 87, no. 2, pp. 215-249.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:dial.uclouvain.be:boreal:99319","is_oa":false,"landing_page_url":"http://hdl.handle.net/2078.2/99319","pdf_url":null,"source":{"id":"https://openalex.org/S4306401902","display_name":"Digital Access to Libraries (Universit\u00e9 catholique de Louvain (UCL), l'Universit\u00e9 de Namur (UNamur) and the Universit\u00e9 Saint-Louis (USL-B))","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I95674353","host_organization_name":"UCLouvain","host_organization_lineage":["https://openalex.org/I95674353"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article de p\u00c3\u00a9riodique (Journal article)"},{"id":"pmh:oai:publications.polymtl.ca:37703","is_oa":false,"landing_page_url":"https://publications.polymtl.ca/37703/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401013","display_name":"PolyPublie (\u00c9cole Polytechnique de Montr\u00e9al)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45683168","host_organization_name":"Polytechnique Montr\u00e9al","host_organization_lineage":["https://openalex.org/I45683168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article de revue"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.6600000262260437}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W621833885","https://openalex.org/W1508335918","https://openalex.org/W1588059640","https://openalex.org/W1801355583","https://openalex.org/W1877361590","https://openalex.org/W1968553199","https://openalex.org/W1971536112","https://openalex.org/W1974153211","https://openalex.org/W1978554456","https://openalex.org/W2029121424","https://openalex.org/W2060753484","https://openalex.org/W2063690908","https://openalex.org/W2083431695","https://openalex.org/W2090523290","https://openalex.org/W2094299970","https://openalex.org/W2106353864","https://openalex.org/W2123019231","https://openalex.org/W2157590940"],"related_works":["https://openalex.org/W2388495914","https://openalex.org/W2044632916","https://openalex.org/W2025573552","https://openalex.org/W2062042185","https://openalex.org/W2117094612","https://openalex.org/W4389749172","https://openalex.org/W2058475249","https://openalex.org/W2410228078","https://openalex.org/W2106813160","https://openalex.org/W2004199889"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2}],"updated_date":"2026-06-16T07:32:37.131356","created_date":"2025-10-10T00:00:00"}