Quadratic regularizations in an interior-point method for primal block-angular problems
One of the most efficient interior-point methods for some classes of primal block-angular problems solves the normal equations by a combination of Cholesky factorizations and preconditioned conjugate gradient for, respectively, the block and linking constraints. Its efficiency depends on the spectra...
Uloženo v:
| Vydáno v: | Mathematical programming Ročník 130; číslo 2; s. 415 - 445 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article Publikace |
| Jazyk: | angličtina |
| Vydáno: |
Berlin/Heidelberg
Springer-Verlag
01.12.2011
Springer Springer Nature B.V |
| Témata: | |
| ISSN: | 0025-5610, 1436-4646 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | One of the most efficient interior-point methods for some classes of primal block-angular problems solves the normal equations by a combination of Cholesky factorizations and preconditioned conjugate gradient for, respectively, the block and linking constraints. Its efficiency depends on the spectral radius—in [0,1)— of a certain matrix in the definition of the preconditioner. Spectral radius close to 1 degrade the performance of the approach. The purpose of this work is twofold. First, to show that a separable quadratic regularization term in the objective reduces the spectral radius, significantly improving the overall performance in some classes of instances. Second, to consider a regularization term which decreases with the barrier function, thus with no need for an extra parameter. Computational experience with some primal block-angular problems confirms the efficiency of the regularized approach. In particular, for some difficult problems, the solution time is reduced by a factor of two to ten by the regularization term, outperforming state-of-the-art commercial solvers. |
|---|---|
| AbstractList | One of the most efficient interior-point methods for some classes of primal block-angular problems solves the normal equations by a combination of Cholesky factorizations and preconditioned conjugate gradient for, respectively, the block and linking constraints. Its efficiency depends on the spectral radius--in [0,1)-- of a certain matrix in the definition of the preconditioner. Spectral radius close to 1 degrade the performance of the approach. The purpose of this work is twofold. First, to show that a separable quadratic regularization term in the objective reduces the spectral radius, significantly improving the overall performance in some classes of instances. Second, to consider a regularization term which decreases with the barrier function, thus with no need for an extra parameter. Computational experience with some primal block-angular problems confirms the efficiency of the regularized approach. In particular, for some difficult problems, the solution time is reduced by a factor of two to ten by the regularization term, outperforming state-of-the-art commercial solvers.[PUBLICATION ABSTRACT] One of the most efficient interior-point methods for some classes of primal block-angular problems solves the normal equations by a combination of Cholesky factorizations and preconditioned conjugate gradient for, respectively, the block and linking constraints. Its efficiency depends on the spectral radius—in [0,1)— of a certain matrix in the definition of the preconditioner. Spectral radius close to 1 degrade the performance of the approach. The purpose of this work is twofold. First, to show that a separable quadratic regularization term in the objective reduces the spectral radius, significantly improving the overall performance in some classes of instances. Second, to consider a regularization term which decreases with the barrier function, thus with no need for an extra parameter. Computational experience with some primal block-angular problems confirms the efficiency of the regularized approach. In particular, for some difficult problems, the solution time is reduced by a factor of two to ten by the regularization term, outperforming state-of-the-art commercial solvers. Peer Reviewed One of the most efficient interior-point methods for some classes of primal block-angular problems solves the normal equations by a combination of Cholesky factorizations and preconditioned conjugate gradient for, respectively, the block and linking constraints. Its efficiency depends on the spectral radius—in [0,1)— of a certain matrix in the definition of the preconditioner. Spectral radius close to 1 degrade the performance of the approach. The purpose of this work is twofold. First, to show that a separable quadratic regularization term in the objective reduces the spectral radius, significantly improving the overall performance in some classes of instances. Second, to consider a regularization term which decreases with the barrier function, thus with no need for an extra parameter. Computational experience with some primal block-angular problems confirms the efficiency of the regularized approach. In particular, for some difficult problems, the solution time is reduced by a factor of two to ten by the regularization term, outperforming state-of-the-art commercial solvers. |
| Author | Castro, Jordi Cuesta, Jordi |
| Author_xml | – sequence: 1 givenname: Jordi surname: Castro fullname: Castro, Jordi email: jordi.castro@upc.edu organization: Department of Statistics and Operations Research, Universitat Politècnica de Catalunya – sequence: 2 givenname: Jordi surname: Cuesta fullname: Cuesta, Jordi organization: Statistics and Operations Research unit, Department of Chemical Engineering, Universitat Rovira i Virgili |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=24797407$$DView record in Pascal Francis |
| BookMark | eNp9UV1LHTEQDaLgVfsD-rYUhL5EJ9lssnksUm1BkELFxzA3m7WxuYlNdh_015v7IRahfcjJTDhncmbmiOzHFB0hHxmcMQB1XhgwULQChVYwyvfIgolWUiGF3CcLAN7RTjI4JEelPAAAa_t-Qe5-zDhknLxtsrufA2b_XLMUS-Njg7Hi5LJPmT6mGjYrN_1KQzOm3Dxmv8LQLEOyvynGjbg-pmVwq3JCDkYMxX3Y3cfk9vLrz4tv9Prm6vvFl2tqBYeJorCuxVENw4hSSRh6CYyLHhyTAkH1dml7NbawtB1iC5xp5VCOohMCatQeE7ata8tsTXbWZYuTSejfkvXhoLhhulOMV83nraaa_TO7MpmVL9aFgNGluZg6Si25VnxN_fSO-pDmHGtHRkPLFGitK-l0R8JiMYwZo_XFbOaTnwwXSqvqtvLUzmtOpWQ3GuunzbCnjD7Uf816l2a7S1PBrHdp-F9dvipfi_9Pw7eaUrnx3uU36_8WvQCutLIk |
| CODEN | MHPGA4 |
| CitedBy_id | crossref_primary_10_1007_s10957_021_01822_1 crossref_primary_10_1007_s10957_018_1445_8 crossref_primary_10_1287_opre_2014_1293 crossref_primary_10_1016_j_ejor_2020_10_027 crossref_primary_10_1287_ijoc_2022_0184 crossref_primary_10_1016_j_ejor_2011_03_050 crossref_primary_10_1287_ijoo_2019_0048 crossref_primary_10_1007_s10589_017_9907_8 crossref_primary_10_1049_iet_gtd_2019_1528 crossref_primary_10_1080_10556788_2015_1050014 crossref_primary_10_1016_j_amc_2015_08_033 crossref_primary_10_1007_s10957_016_0867_4 crossref_primary_10_1007_s12532_012_0035_2 crossref_primary_10_1007_s10589_019_00058_0 crossref_primary_10_1016_j_ejor_2013_04_007 crossref_primary_10_1007_s11750_011_0247_z crossref_primary_10_1007_s10589_010_9361_3 crossref_primary_10_1080_10556788_2020_1841190 crossref_primary_10_1002_nla_2361 crossref_primary_10_1007_s10957_022_02103_1 crossref_primary_10_1016_j_ejco_2025_100105 crossref_primary_10_1016_j_ejor_2015_03_021 crossref_primary_10_1007_s10107_016_1067_6 crossref_primary_10_1007_s11565_022_00422_9 crossref_primary_10_1137_16M1061849 crossref_primary_10_1016_j_ejor_2023_03_042 |
| Cites_doi | 10.1137/0805005 10.1007/s10107-003-0392-8 10.1007/s10589-006-9000-1 10.1137/1.9781611970791 10.1002/nla.610 10.1007/s101070100254 10.1287/opre.50.1.3.17780 10.1287/mnsc.46.1.126.15132 10.1287/opre.1050.0262 10.1137/0914063 10.1023/B:COAP.0000026882.34332.1b 10.1007/BF00940319 10.1287/opre.50.2.260.436 10.1137/0314056 10.1287/ijoc.11.4.370 10.1007/978-1-4419-8853-9 10.1080/10556789908805754 10.1137/1.9781611971316 10.1007/978-0-387-35699-0_10 10.1007/s10107-003-0379-5 10.1137/S1052623498341879 10.1023/B:ANOR.0000004761.99649.a5 10.1287/opre.38.2.240 10.1007/s10287-004-0029-2 10.1007/BF01580610 10.1016/j.laa.2004.08.019 |
| ContentType | Journal Article Publication |
| Contributor | Universitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa Universitat Politècnica de Catalunya. GNOM - Grup d'Optimització Numèrica i Modelització |
| Contributor_xml | – sequence: 1 fullname: Universitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa – sequence: 2 fullname: Universitat Politècnica de Catalunya. GNOM - Grup d'Optimització Numèrica i Modelització |
| Copyright | Springer and Mathematical Programming Society 2010 2015 INIST-CNRS Springer and Mathematical Optimization Society 2011 Attribution-NonCommercial-NoDerivs 3.0 Spain info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-nd/3.0/es |
| Copyright_xml | – notice: Springer and Mathematical Programming Society 2010 – notice: 2015 INIST-CNRS – notice: Springer and Mathematical Optimization Society 2011 – notice: Attribution-NonCommercial-NoDerivs 3.0 Spain info:eu-repo/semantics/openAccess <a href="http://creativecommons.org/licenses/by-nc-nd/3.0/es/">http://creativecommons.org/licenses/by-nc-nd/3.0/es/</a> |
| DBID | AAYXX CITATION IQODW 3V. 7SC 7WY 7WZ 7XB 87Z 88I 8AL 8AO 8FD 8FE 8FG 8FK 8FL ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FRNLG F~G GNUQQ HCIFZ JQ2 K60 K6~ K7- L.- L.0 L6V L7M L~C L~D M0C M0N M2P M7S P5Z P62 PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PTHSS Q9U XX2 |
| DOI | 10.1007/s10107-010-0341-2 |
| DatabaseName | CrossRef Pascal-Francis ProQuest Central (Corporate) Computer and Information Systems Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Science Database (Alumni Edition) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Database Suite (ProQuest) Business Premium Collection Technology Collection ProQuest One Community College ProQuest Central Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student SciTech Collection (ProQuest) ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database (ProQuest) ABI/INFORM Professional Advanced ABI/INFORM Professional Standard ProQuest Engineering Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ABI/INFORM Global Computing Database Science Database Engineering Database Advanced Technologies & Aerospace Collection ProQuest Advanced Technologies & Aerospace Collection Proquest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection ProQuest Central Basic Recercat |
| DatabaseTitle | CrossRef ProQuest Business Collection (Alumni Edition) Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts SciTech Premium Collection ProQuest Central China ABI/INFORM Complete ProQuest One Applied & Life Sciences ProQuest Central (New) Engineering Collection Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global Engineering Database ProQuest Science Journals (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest Business Collection ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest Pharma Collection ProQuest Central ABI/INFORM Professional Advanced ProQuest Engineering Collection ABI/INFORM Professional Standard ProQuest Central Korea Advanced Technologies Database with Aerospace ABI/INFORM Complete (Alumni Edition) ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Science Journals ProQuest Computing (Alumni Edition) ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni) |
| DatabaseTitleList | ProQuest Business Collection (Alumni Edition) Computer and Information Systems Abstracts |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Mathematics Applied Sciences |
| EISSN | 1436-4646 |
| EndPage | 445 |
| ExternalDocumentID | oai_recercat_cat_2072_195712 2508219461 24797407 10_1007_s10107_010_0341_2 |
| Genre | Feature |
| GroupedDBID | --K --Z -52 -5D -5G -BR -EM -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 0VY 199 1B1 1N0 1OL 1SB 203 28- 29M 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 6TJ 78A 7WY 88I 8AO 8FE 8FG 8FL 8TC 8UJ 8VB 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDBF ABDZT ABECU ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACGOD ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACNCT ACOKC ACOMO ACPIV ACUHS ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMOZ AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFFNX AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHQJS AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ AKVCP ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARCSS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN AZQEC B-. B0M BA0 BAPOH BBWZM BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 DWQXO EAD EAP EBA EBLON EBR EBS EBU ECS EDO EIOEI EJD EMI EMK EPL ESBYG EST ESX FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GROUPED_ABI_INFORM_COMPLETE GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I-F I09 IAO IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K1G K60 K6V K6~ K7- KDC KOV KOW L6V LAS LLZTM M0C M0N M2P M4Y M7S MA- N2Q N9A NB0 NDZJH NPVJJ NQ- NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P2P P62 P9R PF0 PQBIZ PQBZA PQQKQ PROAC PT4 PT5 PTHSS Q2X QOK QOS QWB R4E R89 R9I RHV RIG RNI RNS ROL RPX RPZ RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCLPG SDD SDH SDM SHX SISQX SJYHP SMT SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TH9 TN5 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WH7 WK8 XPP YLTOR Z45 Z5O Z7R Z7S Z7X Z7Y Z7Z Z81 Z83 Z86 Z88 Z8M Z8N Z8R Z8T Z8W Z92 ZL0 ZMTXR ZWQNP ~02 ~8M ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG ADXHL AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP AMVHM ATHPR AYFIA CITATION PHGZM PHGZT PQGLB IQODW 7SC 7XB 8AL 8FD 8FK JQ2 L.- L.0 L7M L~C L~D PKEHL PQEST PQUKI PRINS PUEGO Q9U XX2 |
| ID | FETCH-LOGICAL-c420t-a4ce3af7ddfa6760d86012480e164a078cbc87f30bc5aa302197ea6f454407ea3 |
| IEDL.DBID | K7- |
| ISICitedReferencesCount | 30 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000297130400006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0025-5610 |
| IngestDate | Fri Nov 07 13:52:27 EST 2025 Thu Oct 02 05:07:23 EDT 2025 Thu Sep 25 00:38:08 EDT 2025 Mon Jul 21 09:14:38 EDT 2025 Sat Nov 29 05:49:01 EST 2025 Tue Nov 18 22:24:15 EST 2025 Fri Feb 21 02:32:42 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Preconditioned conjugate gradient Large-scale computational optimization 90C51 Multicommodity network flows 90C06 Interior-point methods Primal block-angular problems Regularizations 90C08 Barrier function Spectral radius Perron value Matrix factorization Modeling Convex programming Multicommodity flow problem Cholesky method Cholesky factorization Conjugate gradient method Network flow Interior point method Constrained optimization Large scale Preconditioning Regularization |
| Language | English |
| License | http://www.springer.com/tdm CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c420t-a4ce3af7ddfa6760d86012480e164a078cbc87f30bc5aa302197ea6f454407ea3 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| OpenAccessLink | https://recercat.cat/handle/2072/195712 |
| PQID | 903170999 |
| PQPubID | 25307 |
| PageCount | 31 |
| ParticipantIDs | csuc_recercat_oai_recercat_cat_2072_195712 proquest_miscellaneous_1019629722 proquest_journals_903170999 pascalfrancis_primary_24797407 crossref_citationtrail_10_1007_s10107_010_0341_2 crossref_primary_10_1007_s10107_010_0341_2 springer_journals_10_1007_s10107_010_0341_2 |
| PublicationCentury | 2000 |
| PublicationDate | 2011-12-01 |
| PublicationDateYYYYMMDD | 2011-12-01 |
| PublicationDate_xml | – month: 12 year: 2011 text: 2011-12-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | Berlin/Heidelberg |
| PublicationPlace_xml | – name: Berlin/Heidelberg – name: Heidelberg |
| PublicationSubtitle | A Publication of the Mathematical Optimization Society |
| PublicationTitle | Mathematical programming |
| PublicationTitleAbbrev | Math. Program |
| PublicationYear | 2011 |
| Publisher | Springer-Verlag Springer Springer Nature B.V |
| Publisher_xml | – name: Springer-Verlag – name: Springer – name: Springer Nature B.V |
| References | Ali, A., Kennington, J.L.: Mnetgen program documentation. Technical Report 77003. Department of Industrial Engineering and Operations Research, Southern Methodist University, Dallas (1977) GülerO.YeY.Convergence behaviour of some interior-point algorithmsMath. Program.1993602152280803.9008710.1007/BF01580610 OuorouA.MaheyM.VialJ.-P.A survey of algorithms for convex multicommodity flow problemsManag. Sci.20004612614710.1287/mnsc.46.1.126.15132 FrangioniA.GalloG.A bundle type dual-ascent approach to linear multicommodity min cost flow problemsINFORMS J. Comput.19991137039317586241034.9053410.1287/ijoc.11.4.370 BienstockD.RaskinaO.Asymptotic analysis of the flow deviation method for the maximum concurrent flow problemMath. Program.20029147949218889881074.9005010.1007/s101070100254 CastroJ.An interior-point approach for primal block-angular problemsComput. Optim. Appl.20073619521923120071148.9035110.1007/s10589-006-9000-1 CastroJ.Solving difficult multicommodity problems through a specialized interior-point algorithmAnn. Oper. Res.2003124354820359691053.9001010.1023/B:ANOR.0000004761.99649.a5 CastroJ.A specialized interior-point algorithm for multicommodity network flowsSIAM J. Optim.20001085287717747760955.9008710.1137/S1052623498341879 CastroJ.SachsE.W.TichatschkeR.Solving quadratic multicommodity problems through an interior-point algorithmSystem Modelling and Optimization XX2003BostonKluwer199212 CastroJ.Quadratic interior-point methods in statistical disclosure controlComput. Manag. Sci.2005210712121642161147.9037710.1007/s10287-004-0029-2 BabonneauF.du MerleO.VialJ.-P.Solving large-scale linear multicommodity flow problems with an active set strategy and proximal-ACCPMOper. Res.20065418419722012511167.9066110.1287/opre.1050.0262 AltmanA.GondzioJ.Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimizationOptim. Methods Softw.199911275302177746010.1080/10556789908805754 BellaviaS.GondzioJ.MoriniB.Regularization and preconditioning of KKT systems arising in nonnegative least-squares problemsNumer. Linear Algebra Appl.200916396124775650591482810.1002/nla.610 BergamaschiL.GondzioJ.ZilliG.Preconditioning indefinite systems in interior point methods for optimizationComput. Optim. Appl.20042814917120725301056.9013710.1023/B:COAP.0000026882.34332.1b NesterovY.Introductory Lectures on Convex Optimization: A Basic Course2004BostonKluwer1086.90045 GondzioJ.SarkissianR.Parallel interior-point solver for structured linear programsMath. Program.20039656158419934631023.9003910.1007/s10107-003-0379-5 SetionoR.Interior proximal point algorithm for linear programsJ. Optim. Theory Appl.19927442544411818440795.9004110.1007/BF00940319 ChardaireP.LisserA.Simplex and interior point specialized algorithms for solving nonoriented multicommodity flow problemsOper. Res.20025026027618994581163.9038310.1287/opre.50.2.260.436 NgE.PeytonB.W.Block sparse Cholesky algorithms on advanced uniprocessor computersSIAM J. Sci. Comput.1993141034105612321740785.6501510.1137/0914063 CarolanW.J.HillJ.E.KenningtonJ.L.NiemiS.WichmannS.J.An empirical evaluation of the KORBX algorithms for military airlift applicationsOper. Res.19903824024810.1287/opre.38.2.240 GolubG.H.Van LoanC.F.Matrix Computations19963BaltimoreJohns Hopkins University Press0865.65009 BienstockD.Potential Function Methods for Approximately Solving Linear Programming Problems. Theory and Practice2002BostonKluwer1088.90001 BixbyR.E.Solving real-world linear programs: a decade and more of progressOper. Res.20025031518852041163.9064310.1287/opre.50.1.3.17780 RockafellarR.T.Monotone operators and the proximal point algorithmSIAM J. Control Optim.1976148778984104830358.9005310.1137/0314056 Saunders, M.A., Tomlin, J.A.: Solving regularized linear programs using barrier methods and KKT systems. Technical Report SOL 96-4. Department of Operations Research, Stanford University (1996) Fiacco, A.V., McCormick, G.P.: Nonlinear programming: Sequential Unconstrained Minimization Techniques. Wiley, New York (1968). Reprinted in Classics In Applied Mathematics series, SIAM, Philadelphia (1990) OliveiraA.R.L.SorensenD.C.A new class of preconditioners for large-scale linear systems from interior point methods for linear programmingLinear Algebra Appl.200539412421005731071.6508810.1016/j.laa.2004.08.019 WrightS.J.Primal-Dual Interior-Point Methods1996PhiladelphiaSIAM CzyzykJ.MehrotraS.WagnerM.WrightS.J.PCx: an interior-point code for linear programmingOptim. Methods Softw.199911/12974301778424 NesterovY.NemirovskiiA.Interior-Point Polynomial Algorithms in Convex Programming1994PhiladelphiaSIAM0824.9011210.1137/1.9781611970791 VanderbeiR.J.Symmetric quasidefinite matricesSIAM J. Optim.1995510011313157060822.6501710.1137/0805005 NesterovY.VialJ.-P.Augmented self-concordant barriers and nonlinear optimization problems with finite complexityMath. Program.20049914917420317811059.9012910.1007/s10107-003-0392-8 R.T. Rockafellar (341_CR28) 1976; 14 S. Bellavia (341_CR4) 2009; 16 Y. Nesterov (341_CR22) 2004 A. Ouorou (341_CR27) 2000; 46 E. Ng (341_CR25) 1993; 14 J. Czyzyk (341_CR16) 1999; 11/12 O. Güler (341_CR21) 1993; 60 F. Babonneau (341_CR3) 2006; 54 L. Bergamaschi (341_CR5) 2004; 28 341_CR17 J. Castro (341_CR12) 2003 P. Chardaire (341_CR15) 2002; 50 W.J. Carolan (341_CR9) 1990; 38 J. Castro (341_CR11) 2003; 124 G.H. Golub (341_CR19) 1996 J. Castro (341_CR10) 2000; 10 R. Setiono (341_CR30) 1992; 74 S.J. Wright (341_CR32) 1996 A. Altman (341_CR2) 1999; 11 R.J. Vanderbei (341_CR31) 1995; 5 J. Castro (341_CR14) 2007; 36 J. Castro (341_CR13) 2005; 2 J. Gondzio (341_CR20) 2003; 96 Y. Nesterov (341_CR24) 2004; 99 A.R.L. Oliveira (341_CR26) 2005; 394 341_CR1 D. Bienstock (341_CR7) 2002; 91 Y. Nesterov (341_CR23) 1994 341_CR29 D. Bienstock (341_CR6) 2002 A. Frangioni (341_CR18) 1999; 11 R.E. Bixby (341_CR8) 2002; 50 |
| References_xml | – reference: OuorouA.MaheyM.VialJ.-P.A survey of algorithms for convex multicommodity flow problemsManag. Sci.20004612614710.1287/mnsc.46.1.126.15132 – reference: GülerO.YeY.Convergence behaviour of some interior-point algorithmsMath. Program.1993602152280803.9008710.1007/BF01580610 – reference: BellaviaS.GondzioJ.MoriniB.Regularization and preconditioning of KKT systems arising in nonnegative least-squares problemsNumer. Linear Algebra Appl.200916396124775650591482810.1002/nla.610 – reference: BienstockD.Potential Function Methods for Approximately Solving Linear Programming Problems. Theory and Practice2002BostonKluwer1088.90001 – reference: CzyzykJ.MehrotraS.WagnerM.WrightS.J.PCx: an interior-point code for linear programmingOptim. Methods Softw.199911/12974301778424 – reference: GondzioJ.SarkissianR.Parallel interior-point solver for structured linear programsMath. Program.20039656158419934631023.9003910.1007/s10107-003-0379-5 – reference: Fiacco, A.V., McCormick, G.P.: Nonlinear programming: Sequential Unconstrained Minimization Techniques. Wiley, New York (1968). Reprinted in Classics In Applied Mathematics series, SIAM, Philadelphia (1990) – reference: NesterovY.VialJ.-P.Augmented self-concordant barriers and nonlinear optimization problems with finite complexityMath. Program.20049914917420317811059.9012910.1007/s10107-003-0392-8 – reference: FrangioniA.GalloG.A bundle type dual-ascent approach to linear multicommodity min cost flow problemsINFORMS J. Comput.19991137039317586241034.9053410.1287/ijoc.11.4.370 – reference: SetionoR.Interior proximal point algorithm for linear programsJ. Optim. Theory Appl.19927442544411818440795.9004110.1007/BF00940319 – reference: Saunders, M.A., Tomlin, J.A.: Solving regularized linear programs using barrier methods and KKT systems. Technical Report SOL 96-4. Department of Operations Research, Stanford University (1996) – reference: Ali, A., Kennington, J.L.: Mnetgen program documentation. Technical Report 77003. Department of Industrial Engineering and Operations Research, Southern Methodist University, Dallas (1977) – reference: RockafellarR.T.Monotone operators and the proximal point algorithmSIAM J. Control Optim.1976148778984104830358.9005310.1137/0314056 – reference: AltmanA.GondzioJ.Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimizationOptim. Methods Softw.199911275302177746010.1080/10556789908805754 – reference: OliveiraA.R.L.SorensenD.C.A new class of preconditioners for large-scale linear systems from interior point methods for linear programmingLinear Algebra Appl.200539412421005731071.6508810.1016/j.laa.2004.08.019 – reference: ChardaireP.LisserA.Simplex and interior point specialized algorithms for solving nonoriented multicommodity flow problemsOper. Res.20025026027618994581163.9038310.1287/opre.50.2.260.436 – reference: BienstockD.RaskinaO.Asymptotic analysis of the flow deviation method for the maximum concurrent flow problemMath. Program.20029147949218889881074.9005010.1007/s101070100254 – reference: NesterovY.Introductory Lectures on Convex Optimization: A Basic Course2004BostonKluwer1086.90045 – reference: GolubG.H.Van LoanC.F.Matrix Computations19963BaltimoreJohns Hopkins University Press0865.65009 – reference: WrightS.J.Primal-Dual Interior-Point Methods1996PhiladelphiaSIAM – reference: BixbyR.E.Solving real-world linear programs: a decade and more of progressOper. Res.20025031518852041163.9064310.1287/opre.50.1.3.17780 – reference: CastroJ.Solving difficult multicommodity problems through a specialized interior-point algorithmAnn. Oper. Res.2003124354820359691053.9001010.1023/B:ANOR.0000004761.99649.a5 – reference: BergamaschiL.GondzioJ.ZilliG.Preconditioning indefinite systems in interior point methods for optimizationComput. Optim. Appl.20042814917120725301056.9013710.1023/B:COAP.0000026882.34332.1b – reference: BabonneauF.du MerleO.VialJ.-P.Solving large-scale linear multicommodity flow problems with an active set strategy and proximal-ACCPMOper. Res.20065418419722012511167.9066110.1287/opre.1050.0262 – reference: CarolanW.J.HillJ.E.KenningtonJ.L.NiemiS.WichmannS.J.An empirical evaluation of the KORBX algorithms for military airlift applicationsOper. Res.19903824024810.1287/opre.38.2.240 – reference: CastroJ.A specialized interior-point algorithm for multicommodity network flowsSIAM J. Optim.20001085287717747760955.9008710.1137/S1052623498341879 – reference: CastroJ.Quadratic interior-point methods in statistical disclosure controlComput. Manag. Sci.2005210712121642161147.9037710.1007/s10287-004-0029-2 – reference: CastroJ.SachsE.W.TichatschkeR.Solving quadratic multicommodity problems through an interior-point algorithmSystem Modelling and Optimization XX2003BostonKluwer199212 – reference: CastroJ.An interior-point approach for primal block-angular problemsComput. Optim. Appl.20073619521923120071148.9035110.1007/s10589-006-9000-1 – reference: VanderbeiR.J.Symmetric quasidefinite matricesSIAM J. Optim.1995510011313157060822.6501710.1137/0805005 – reference: NesterovY.NemirovskiiA.Interior-Point Polynomial Algorithms in Convex Programming1994PhiladelphiaSIAM0824.9011210.1137/1.9781611970791 – reference: NgE.PeytonB.W.Block sparse Cholesky algorithms on advanced uniprocessor computersSIAM J. Sci. Comput.1993141034105612321740785.6501510.1137/0914063 – volume: 5 start-page: 100 year: 1995 ident: 341_CR31 publication-title: SIAM J. Optim. doi: 10.1137/0805005 – volume: 99 start-page: 149 year: 2004 ident: 341_CR24 publication-title: Math. Program. doi: 10.1007/s10107-003-0392-8 – volume: 36 start-page: 195 year: 2007 ident: 341_CR14 publication-title: Comput. Optim. Appl. doi: 10.1007/s10589-006-9000-1 – volume-title: Interior-Point Polynomial Algorithms in Convex Programming year: 1994 ident: 341_CR23 doi: 10.1137/1.9781611970791 – volume: 16 start-page: 39 year: 2009 ident: 341_CR4 publication-title: Numer. Linear Algebra Appl. doi: 10.1002/nla.610 – volume: 91 start-page: 479 year: 2002 ident: 341_CR7 publication-title: Math. Program. doi: 10.1007/s101070100254 – volume: 50 start-page: 3 year: 2002 ident: 341_CR8 publication-title: Oper. Res. doi: 10.1287/opre.50.1.3.17780 – volume: 46 start-page: 126 year: 2000 ident: 341_CR27 publication-title: Manag. Sci. doi: 10.1287/mnsc.46.1.126.15132 – volume: 54 start-page: 184 year: 2006 ident: 341_CR3 publication-title: Oper. Res. doi: 10.1287/opre.1050.0262 – volume: 11/12 start-page: 97 year: 1999 ident: 341_CR16 publication-title: Optim. Methods Softw. – volume: 14 start-page: 1034 year: 1993 ident: 341_CR25 publication-title: SIAM J. Sci. Comput. doi: 10.1137/0914063 – volume-title: Matrix Computations year: 1996 ident: 341_CR19 – volume: 28 start-page: 149 year: 2004 ident: 341_CR5 publication-title: Comput. Optim. Appl. doi: 10.1023/B:COAP.0000026882.34332.1b – volume: 74 start-page: 425 year: 1992 ident: 341_CR30 publication-title: J. Optim. Theory Appl. doi: 10.1007/BF00940319 – ident: 341_CR29 – volume: 50 start-page: 260 year: 2002 ident: 341_CR15 publication-title: Oper. Res. doi: 10.1287/opre.50.2.260.436 – volume: 14 start-page: 877 year: 1976 ident: 341_CR28 publication-title: SIAM J. Control Optim. doi: 10.1137/0314056 – ident: 341_CR1 – volume: 11 start-page: 370 year: 1999 ident: 341_CR18 publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.11.4.370 – volume-title: Introductory Lectures on Convex Optimization: A Basic Course year: 2004 ident: 341_CR22 doi: 10.1007/978-1-4419-8853-9 – volume: 11 start-page: 275 year: 1999 ident: 341_CR2 publication-title: Optim. Methods Softw. doi: 10.1080/10556789908805754 – ident: 341_CR17 doi: 10.1137/1.9781611971316 – start-page: 199 volume-title: System Modelling and Optimization XX year: 2003 ident: 341_CR12 doi: 10.1007/978-0-387-35699-0_10 – volume-title: Potential Function Methods for Approximately Solving Linear Programming Problems. Theory and Practice year: 2002 ident: 341_CR6 – volume: 96 start-page: 561 year: 2003 ident: 341_CR20 publication-title: Math. Program. doi: 10.1007/s10107-003-0379-5 – volume: 10 start-page: 852 year: 2000 ident: 341_CR10 publication-title: SIAM J. Optim. doi: 10.1137/S1052623498341879 – volume: 124 start-page: 35 year: 2003 ident: 341_CR11 publication-title: Ann. Oper. Res. doi: 10.1023/B:ANOR.0000004761.99649.a5 – volume: 38 start-page: 240 year: 1990 ident: 341_CR9 publication-title: Oper. Res. doi: 10.1287/opre.38.2.240 – volume-title: Primal-Dual Interior-Point Methods year: 1996 ident: 341_CR32 – volume: 2 start-page: 107 year: 2005 ident: 341_CR13 publication-title: Comput. Manag. Sci. doi: 10.1007/s10287-004-0029-2 – volume: 60 start-page: 215 year: 1993 ident: 341_CR21 publication-title: Math. Program. doi: 10.1007/BF01580610 – volume: 394 start-page: 1 year: 2005 ident: 341_CR26 publication-title: Linear Algebra Appl. doi: 10.1016/j.laa.2004.08.019 |
| SSID | ssj0001388 |
| Score | 2.165434 |
| Snippet | One of the most efficient interior-point methods for some classes of primal block-angular problems solves the normal equations by a combination of Cholesky... |
| SourceID | csuc proquest pascalfrancis crossref springer |
| SourceType | Open Access Repository Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 415 |
| SubjectTerms | 90 Operations research, mathematical programming 90C Mathematical programming Algorithms Applied sciences Blocking Calculus of Variations and Optimal Control; Optimization Classificació AMS Combinatorics Computing time Conjugate gradients Exact sciences and technology Flows in networks. Combinatorial problems Full Length Paper Investigació operativa Linear programming Matemàtiques i estadística Mathematical analysis Mathematical and Computational Physics Mathematical Methods in Physics Mathematical models Mathematical programming Mathematics Mathematics and Statistics Mathematics of Computing Methods Network management systems Numerical Analysis Operational research and scientific management Operational research. Management science Operations research Optimització Programació (Matemàtica) Programming (Mathematics) Regularization Spectra Studies Theoretical Àrees temàtiques de la UPC |
| SummonAdditionalLinks | – databaseName: SpringerLINK Contemporary 1997-Present dbid: RSV link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnR3LTtww0EILB3ooz6oLFLlSTyBLju3E9hFVRT3QFdDyuFm240grUHaV7Pb7O84mYRcBEj0kihVnYtnz9IxnEPrmcg5Gg0tIFoDIhc8E8EGWkhzUXe65LWRTY-n2Qo5G6v5eX7bnuOsu2r1zSTaceumwW9KESVJCgfUS4LvrIO1UpMbr37c9-024Ul2d1qgcdK7Ml0CsCKOBr-c-xkbaGqanWNS1WFE8n_lKGxF0vvVfg99GH1uNE58tUGQHrYVyF31YykMIrV998tZ6D91dzW0eEcPjqqlUX3VnNfG4xLbEMcVENZ5UZDqBR7woQo1B-8XTmLviETuQkA8k7oTCx7itWVPvo5vzH3--_yRt_QXiBaMzYoUPcbXyvLCZzGiuwHpjQtEANpYF3cI7r2TBqfOptRy0BS2DzQqRCjATg-Wf0KCclOEzwormQSfKOgsGHOdOs9SluRYZBfCOuyGi3UIY3yYnjzUyHs1TWuU4gwZuJs6gYUN00n8yXWTmeLszrK4BKRIqb2cmZtXuG_FiVDKT6FQm0Pl4BQd68ExIML-oHKLDDilMS_K10cAeZdS3h-hr_xZoNTpgbBkm8zqG0-mMacngF6cdnjxBeHX0B-_qfYg2m43vJubmCA1m1Tx8QRv-72xcV8cNsfwDzF0Mvw priority: 102 providerName: Springer Nature |
| Title | Quadratic regularizations in an interior-point method for primal block-angular problems |
| URI | https://link.springer.com/article/10.1007/s10107-010-0341-2 https://www.proquest.com/docview/903170999 https://www.proquest.com/docview/1019629722 https://recercat.cat/handle/2072/195712 |
| Volume | 130 |
| WOSCitedRecordID | wos000297130400006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVPQU databaseName: ABI/INFORM Collection customDbUrl: eissn: 1436-4646 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001388 issn: 0025-5610 databaseCode: 7WY dateStart: 20011001 isFulltext: true titleUrlDefault: https://www.proquest.com/abicomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ABI/INFORM Global customDbUrl: eissn: 1436-4646 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001388 issn: 0025-5610 databaseCode: M0C dateStart: 20011001 isFulltext: true titleUrlDefault: https://search.proquest.com/abiglobal providerName: ProQuest – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1436-4646 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001388 issn: 0025-5610 databaseCode: P5Z dateStart: 20011001 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1436-4646 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001388 issn: 0025-5610 databaseCode: K7- dateStart: 20011001 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1436-4646 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001388 issn: 0025-5610 databaseCode: M7S dateStart: 20011001 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1436-4646 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001388 issn: 0025-5610 databaseCode: BENPR dateStart: 20011001 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Science Database customDbUrl: eissn: 1436-4646 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001388 issn: 0025-5610 databaseCode: M2P dateStart: 20011001 isFulltext: true titleUrlDefault: https://search.proquest.com/sciencejournals providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1436-4646 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001388 issn: 0025-5610 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwELbolgMceCO2hZWROIEsHDuJkxOCqhUSdLW00BYull-RVlTJNtnl9zOTV1kkeuGQUaL4kWTG4xl7Mh8hr6yX4DTYiKUBBnns0hj0oEiYB3NXOmkK1WIsnX1W83l2cZEv-ticpg-rHHRiq6h95XCN_G0O0qfQnHm3umIIGoWbqz2Cxg7ZjYSIUMw_KTYq4khm2YDYimbCsKnZ_TkXtTGXnHHQ40xsTUsT12wcRkmaBj5U0SFcbJmgf-2atpPR0f3_fI0H5F5vhdL3ndg8JLdC-Yjc_SM3IVwdjwldm8fk_MvGeBQWR-sWvb4e_t-ky5KakmLaiXpZ1WxVwSntgKkpWMR0hfksLqmFWfMnw9VRqEx7HJvmCfl2dPj14CPrMRmYiwVfMxO7gBz0vjCpSrnPwKMTccYD-F0G7A1nXaYKya1LjJFgQeQqmLSIkxhcx2DkUzIpqzI8IzTjPuRRZqwBp05Km4vEJj6PUw7NW2mnhA8s0a5PWI64GZf6OtUyclED0chFLabk9Vhl1WXruLkw8FnDzBJqZ9YaM22PF3gIroSO8kRFUHi2JQ1j8yJW4JJxNSX7A8N1rwYaPXJ7Sl6Od2H84qaMKUO1aTDELk9FrgR08WaQqusW_vn0ezf2t0_utIvfbdzNczJZ15vwgtx2v9bLpp6RHXX-fUZ2PxzOFyezdtAAPeYHSMUCqToFukh-AD05PfsN0jgeVQ |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VBQk48EYshWIkuIAiHDuJkwNCqFC16u4KpAK9Gdtx0IoqWZJdED-K_8hMsklZJHrrgUOiWEnsPD7Pwx7PB_DE5hKdBhsGicdOHrkkQjko4iBHc1c6aQrVcix9nKjZLD0-zt5twa9-LQyFVfYysRXUeeVojPxFhuhTZM68WnwLiDSKJld7Bo0OFYf-5w_02JqXB2_w9z4VYu_t0e5-sCYVCFwk-DIwkfP0CHlemEQlPE_RJRFRyj06DgYVprMuVYXk1sXGSFSBmfImKaI4Qt_HG4n1XoCLWJAkB6Z8dxD8oUzTniGWzJJ-ErVbqRe2MZ484Kg3ArGhBkeuWTmKyjQN_piiY9TYMHn_mqVtld_e9f_ss92Aa2srm73uusVN2PLlLbj6R-5FLE2HhLXNbfj0fmVy6gyO1f4Lheb261PZvGSmZJRWo55XdbCo8JB1xNsMLX62oHwdJ8yiVfA1oNFfvJmteXqaO_DhXN7zLozKqvT3gKU891mYGmvQaZXSZiK2cZ5FCcfqrbRj4D0EtFsnZCdekBN9mkqaUKNxpwk1Wozh2XDLostGcvbFiCuNmtPXziw1ZRIfCrQJroQOs1iFePHOBvqG6kWk0OXkagzbPcD0Wsw1ekDXGB4PZ1E-0aSTKX21aiiEMEtEpgQ28bxH8WkN_3z6-2e29wgu7x9NJ3pyMDvchivtQH8bY_QARst65R_CJfd9OW_qnbaLMvh83uD-DT_Jc9Q |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3di9QwEA-yiujD-Xm4d3pG8EkplyZp0zyKuiiey4l63lvIV2Hx6C5t17_fmX7draggPrQ0NE3bZDKZSSa_HyHPXRDgNLg0ySN0culzCXqQZ0kAc1d4YUvVcSydnajlsjg_16cDz2kzRruPS5L9ngZEaara400oj69sfEu7kEmWMFDDCejg6xI5g9Bd_3w2qeJUFMXI2YqGwris-bsidgammW-2HuMkbQNVVfYcFztG6C_rpt1wtLjz3z9yl-wNlih91YvOPXItVvfJ7Sv4hJD6OIG6Ng_It09bG1BgPK07Bvt63MNJVxW1FUXoiXq1rpPNGi5pT05NwSqmG8S0uKAORs7vCc6QwsN04LJpHpKvi7dfXr9LBl6GxEvO2sRKH7EVQyhtrnIWCvDquCxYBN_Lgs3hnS9UKZjzmbUCrAitos1LmUlwH6MV-2RWrav4iNCChajTwjoLjp0QTvPMZUHLnEHxTrg5YWOjGD-AliN3xoW5hFvGGjRwMliDhs_Ji-mRTY_Y8ffM0NIGRpdYe9saRNueEnhwprhJdaZSyHy0Iw9T8VwqcMuYmpPDUUDMoAoao0FtKrTD5-TZdBf6MC7M2Cqutw2G2emca8XhFS9Hmbks4Y9ff_BPuZ-Sm6dvFubk_fLDIbnVzY13YTmPyaytt_EJueF_tKumPur60E_BDBiH |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Quadratic+regularizations+in+an+interior-point+method+for+primal+block-angular+problems&rft.jtitle=Mathematical+programming&rft.au=Castro%2C+Jordi&rft.au=Cuesta%2C+Jordi&rft.date=2011-12-01&rft.pub=Springer+Nature+B.V&rft.issn=0025-5610&rft.eissn=1436-4646&rft.volume=130&rft.issue=2&rft.spage=415&rft_id=info:doi/10.1007%2Fs10107-010-0341-2&rft.externalDocID=2508219461 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0025-5610&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0025-5610&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0025-5610&client=summon |