Algorithm 1035: A Gradient-based Implementation of the Polyhedral Active Set Algorithm
The Polyhedral Active Set Algorithm (PASA) is designed to optimize a general nonlinear function over a polyhedron. Phase one of the algorithm is a nonmonotone gradient projection algorithm, while phase two is an active set algorithm that explores faces of the constraint polyhedron. A gradient-based...
Saved in:
| Published in | ACM transactions on mathematical software Vol. 49; no. 2; pp. 1 - 13 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
New York, NY
ACM
17.06.2023
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 0098-3500 1557-7295 1557-7295 |
| DOI | 10.1145/3583559 |
Cover
| Abstract | The Polyhedral Active Set Algorithm (PASA) is designed to optimize a general nonlinear function over a polyhedron. Phase one of the algorithm is a nonmonotone gradient projection algorithm, while phase two is an active set algorithm that explores faces of the constraint polyhedron. A gradient-based implementation is presented, where a projected version of the conjugate gradient algorithm is employed in phase two. Asymptotically, only phase two is performed. Comparisons are given with IPOPT using polyhedral-constrained problems from CUTEst and the Maros/Meszaros quadratic programming test set. |
|---|---|
| AbstractList | The Polyhedral Active Set Algorithm (PASA) is designed to optimize a general nonlinear function over a polyhedron. Phase one of the algorithm is a nonmonotone gradient projection algorithm, while phase two is an active set algorithm that explores faces of the constraint polyhedron. A gradient-based implementation is presented, where a projected version of the conjugate gradient algorithm is employed in phase two. Asymptotically, only phase two is performed. Comparisons are given with IPOPT using polyhedral-constrained problems from CUTEst and the Maros/Meszaros quadratic programming test set. |
| ArticleNumber | 20 |
| Author | Zhang, Hongchao Hager, William W. |
| Author_xml | – sequence: 1 givenname: William W. orcidid: 0000-0003-3132-7017 surname: Hager fullname: Hager, William W. email: hager@ufl.edu organization: University of Florida, USA – sequence: 2 givenname: Hongchao orcidid: 0000-0003-2518-6975 surname: Zhang fullname: Zhang, Hongchao email: hozhang@math.lsu.edu organization: Louisiana State University, USA |
| BookMark | eNp10EFLwzAUB_AgE9ymePeUm16qL01jWm9lzDkYKKh4LGnz4iJpO9Ko7Nv4WfxkTjp3ED09Hu_HH95_RAZN2yAhxwzOGUvEBRcpFyLbI0MmhIxknIkBGQJkacQFwAEZdd0LAMRMsiF5yt1z621Y1p8fDLi4ojmdeaUtNiEqVYeazuuVw3qzq2DbhraGhiXSu9atl6i9cjSvgn1Deo-B7tIOyb5RrsOj7RyTx-vpw-QmWtzO5pN8EalYyhBJ4HEsMlSJgcRIw2VSZaW8THmZMqU0ojSAjMelkRnIuGQ64SYRnKMGLjUfk7M-97VZqfW7cq5YeVsrvy4YFN-FFNtCNjTqaeXbrvNoisr2PwWvrPvDn_7y_yef9FJV9Q79HL8A2SB33Q |
| CitedBy_id | crossref_primary_10_1007_s10107_023_01979_9 crossref_primary_10_1007_s10589_023_00530_y crossref_primary_10_1007_s10107_024_02172_2 |
| Cites_doi | 10.1007/0-387-33006-2_7 10.1137/0723046 10.1007/BFb0120949 10.1145/2828635 10.1137/030601880 10.1137/S105262340038081X 10.1137/0725068 10.1007/s101070100244 10.1007/0-387-30065-1_4 10.1023/A:1008677427361 10.1137/S1052623497325107 10.1137/S0036144504446096 10.5555/3182664.3182787 10.1137/S089547980343641X 10.1137/1031049 10.1007/BF01584986 10.1137/050635225 10.1145/1132973.1132979 10.1137/120898097 10.2140/pjm.1966.16.1 10.5555/3182680.3183021 10.1080/10556788.2020.1746962 10.1007/s10589-016-9880-7 10.5555/3114201.3114714 10.5555/2655222 10.1007/978-1-4613-3279-4_16 10.1093/imanum/8.1.141 10.1137/0725029 10.1137/S0895479899357346 10.1007/978-3-319-58356-3 10.1145/502800.502803 10.21236/ADA169115 10.1007/s10107-004-0559-y 10.1093/imanum/drl006 10.5555/3114201.3114710 10.1137/S0895479897321076 10.1137/0804032 10.1007/s10589-014-9687-3 10.1007/BF00248762 10.1007/BF01588950 10.1023/A:1013773102688 10.1145/1462173.1462176 10.1137/060654797 10.1007/978-3-662-12211-2 10.1137/15M102825X 10.1007/s11425-016-0300-6 10.1007/BF01580867 |
| ContentType | Journal Article |
| Copyright | Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from |
| Copyright_xml | – notice: Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from |
| DBID | AAYXX CITATION ADTOC UNPAY |
| DOI | 10.1145/3583559 |
| DatabaseName | CrossRef Unpaywall for CDI: Periodical Content Unpaywall |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| Database_xml | – sequence: 1 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Sciences (General) Computer Science |
| EISSN | 1557-7295 |
| EndPage | 13 |
| ExternalDocumentID | 10.1145/3583559 10_1145_3583559 3583559 |
| GrantInformation_xml | – fundername: National Science Foundation grantid: 1819002, 1819161, 2031213, and 2110722 – fundername: Office of Naval Research grantid: N00014-15-1-2048, N00014-18-1-2100, and N00014-22-1-2397 |
| GroupedDBID | --Z -DZ -~X .DC 23M 2FS 4.4 5GY 5VS 6J9 6OB 85S 8US AAIKC AAKMM AALFJ AAMNW AAYFX ABFSI ABPPZ ACGFO ACGOD ACIWK ACM ACNCT ADBCU ADL ADPZR AEBYY AENEX AENSD AETEA AFWIH AFWXC AGHSJ AIKLT AKRVB ALMA_UNASSIGNED_HOLDINGS AMVHM ASPBG AVWKF BDXCO CCLIF CS3 D0L FEDTE GUFHI HGAVV H~9 I07 IAO ICD IOF LHSKQ MS~ P1C P2P PQQKQ RNS ROL RXW TAE TWZ U5U UHB UPT X6Y ZCA AAYXX AEFXT AEJOY CITATION 9M8 ADTOC AFFNX AI. E.L EBS EJD HF~ IEA IGS ITC MVM NHB OHT UNPAY VH1 XJT XOL ZY4 |
| ID | FETCH-LOGICAL-a277t-7032259ea4f04f7f374c9b7683b81aadee7f0e132bf79072b1d43f4533ed037d3 |
| IEDL.DBID | UNPAY |
| ISSN | 0098-3500 1557-7295 |
| IngestDate | Wed Oct 01 17:07:06 EDT 2025 Thu Apr 24 23:07:15 EDT 2025 Wed Oct 01 05:57:50 EDT 2025 Mon Apr 21 16:40:31 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | PPROJ NAPHEAP CG_DESCENT polyhedral-constrained optimization gradient projection method Nonlinear optimization active set method PASA conjugate gradient method projection on polyhedron |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a277t-7032259ea4f04f7f374c9b7683b81aadee7f0e132bf79072b1d43f4533ed037d3 |
| ORCID | 0000-0003-3132-7017 0000-0003-2518-6975 |
| OpenAccessLink | https://proxy.k.utb.cz/login?url=https://dl.acm.org/action/downloadSupplement?doi=10.1145%2F3583559&file=3583559.pdf |
| PageCount | 13 |
| ParticipantIDs | unpaywall_primary_10_1145_3583559 crossref_citationtrail_10_1145_3583559 crossref_primary_10_1145_3583559 acm_primary_3583559 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2023-06-17 |
| PublicationDateYYYYMMDD | 2023-06-17 |
| PublicationDate_xml | – month: 06 year: 2023 text: 2023-06-17 day: 17 |
| PublicationDecade | 2020 |
| PublicationPlace | New York, NY |
| PublicationPlace_xml | – name: New York, NY |
| PublicationTitle | ACM transactions on mathematical software |
| PublicationTitleAbbrev | ACM TOMS |
| PublicationYear | 2023 |
| Publisher | ACM |
| Publisher_xml | – name: ACM |
| References | (Bib0053) 1999; 13 (Bib0002) 2017 (Bib0038) 2002; 21 (Bib0003) 1966; 16 (Bib0044) 2006 (Bib0011) 1999; 9 (Bib0026) 2002; 13 (Bib0027) 2005; 47 (Bib0043) 2006; 17 (Bib0010) 1990; 47 (Bib0040) 1993; 1 (Bib0005) 2014 (Bib0017) 2006; 26 (Bib0001) 2007; 18 (Bib0019) 2001; 22 (Bib0037) 1998 (Bib0047) 2016; 59 (Bib0014) 1988; 25 (Bib0022) 2008; 112 (Bib0018) 1999; 20 (Bib0029) 1986 (Bib0054) 2006; 106 (Bib0025) 2002; 91 (Bib0051) 1987 (Bib0021) 2008; 112 (Bib0030) 2016 (Bib0004) 1988; 8 (Bib0052) 1972; 3 (Bib0023) 2009; 35 (Bib0049) 1978; 14 (Bib0045) 2006; 2 (Bib0008) 1988; 25 (Bib0034) 1989; 31 (Bib0039) 2003 (Bib0046) 2013; 23 (Bib0033) 1987; 55 (Bib0006) 2020; 35 (Bib0036) 1993; 79 (Bib0016) 1992 (Bib0020) 2005; 26 (Bib0031) 2015; 60 (Bib0056) 2017; 66 (Bib0050) 1982; 16 (Bib0013) 2009; 35 (Bib0035) 1992 (Bib0032) 1986; 23 (Bib0041) 2005; 16 (Bib0055) 2003 (Bib0048) 2016; 29 (Bib0015) 1990 (Bib0009) 1994; 25 (Bib0028) 1986 (Bib0024) 2016; 42 (Bib0007) 2001; 27 (Bib0042) 2006; 32 (Bib0012) 2006 Hager William W. (e_1_3_1_40_2) 2003 Murtagh Bruce A. (e_1_3_1_52_2) 1987 Hager William W. (e_1_3_1_46_2) 2006; 2 e_1_3_1_43_2 e_1_3_1_22_2 e_1_3_1_45_2 e_1_3_1_24_2 e_1_3_1_8_2 e_1_3_1_41_2 e_1_3_1_20_2 e_1_3_1_4_2 e_1_3_1_6_2 e_1_3_1_26_2 e_1_3_1_47_2 e_1_3_1_2_2 e_1_3_1_28_2 e_1_3_1_49_2 Byrd Richard H. (e_1_3_1_13_2) 2006 Conn Andrew R. (e_1_3_1_16_2) 1990 Hager William W. (e_1_3_1_38_2) 1998 Hager William W. (e_1_3_1_36_2) 1992 e_1_3_1_32_2 e_1_3_1_55_2 e_1_3_1_34_2 e_1_3_1_57_2 Gill Philip E. (e_1_3_1_29_2) 1986 e_1_3_1_51_2 e_1_3_1_11_2 e_1_3_1_30_2 e_1_3_1_53_2 e_1_3_1_17_2 e_1_3_1_15_2 Gill Philip E. (e_1_3_1_31_2) 2016 e_1_3_1_19_2 Waltz Richard A. (e_1_3_1_56_2) 2003 Chen Yanqing (e_1_3_1_14_2) 2009; 35 e_1_3_1_21_2 e_1_3_1_44_2 e_1_3_1_23_2 e_1_3_1_7_2 e_1_3_1_9_2 e_1_3_1_42_2 e_1_3_1_3_2 e_1_3_1_5_2 e_1_3_1_25_2 e_1_3_1_48_2 e_1_3_1_27_2 e_1_3_1_33_2 e_1_3_1_54_2 e_1_3_1_35_2 e_1_3_1_12_2 e_1_3_1_50_2 e_1_3_1_10_2 e_1_3_1_37_2 e_1_3_1_18_2 e_1_3_1_39_2 |
| References_xml | – volume: 9 start-page: 877 year: 1999 end-page: 900 ident: Bib0011 article-title: An interior point method for large scale nonlinear programming publication-title: SIAM J. Optim. – volume: 27 start-page: 340 year: 2001 end-page: 349 ident: Bib0007 article-title: Algorithm 813: SPG—Software for convex-constrained optimization publication-title: ACM Trans. Math. Softw. – volume: 26 start-page: 621 issue: 3 year: 2005 end-page: 639 ident: Bib0020 article-title: Row modifications of a sparse Cholesky factorization publication-title: SIAM J. Matrix Anal. Appl. – year: 2017 ident: Bib0002 publication-title: Continuous Nonlinear Optimization for Engineering Applications in GAMS Technology – start-page: 243 year: 1998 end-page: 254 ident: Bib0037 article-title: The LP dual active set algorithm publication-title: High Performance Algorithms and Software in Nonlinear Optimization – year: 1987 ident: Bib0051 publication-title: MINOS 5.0: User’s Guide – volume: 16 start-page: 84 year: 1982 end-page: 117 ident: Bib0050 article-title: A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints publication-title: Math. Progam. Stud. – volume: 20 start-page: 606 issue: 3 year: 1999 end-page: 627 ident: Bib0018 article-title: Modifying a sparse Cholesky factorization publication-title: SIAM J. Matrix Anal. Appl. – volume: 35 start-page: 22:1–14 issue: 3 year: 2009 ident: Bib0013 article-title: Algorithm 887: CHOLMOD, supernodal sparse Cholesky factorization and update/downdate publication-title: ACM Trans. Math. Softw. – year: 2003 ident: Bib0055 publication-title: KNITRO user’s manual – year: 1986 ident: Bib0028 publication-title: User’s Guide for LSSOL (Version 1.0) – start-page: 137 year: 1992 end-page: 142 ident: Bib0035 article-title: The dual active set algorithm publication-title: Advances in Optimization and Parallel Computing – volume: 42 start-page: 22:1–22:25 year: 2016 ident: Bib0024 article-title: An efficient hybrid algorithm for the separable convex quadratic knapsack problem publication-title: ACM Trans. Math. Softw. – volume: 35 start-page: 27:1–23 issue: 4 year: 2009 ident: Bib0023 article-title: Dynamic supernodes in sparse Cholesky update/downdate and triangular solves publication-title: ACM Trans. Math. Softw. – volume: 79 start-page: 427 year: 1993 end-page: 462 ident: Bib0036 article-title: Analysis and implementation of a dual algorithm for constrained optimization publication-title: J. Optim. Theor. Appl. – volume: 1 start-page: 349 year: 1993 end-page: 373 ident: Bib0040 article-title: Application of the dual active set algorithm to quadratic network optimization publication-title: Comput. Optim. Appl. – volume: 23 start-page: 707 year: 1986 end-page: 716 ident: Bib0032 article-title: A nonmonotone line search technique for Newton’s method publication-title: SIAM J. Numer. Anal. – year: 1992 ident: Bib0016 publication-title: LANCELOT: A Fortran Package for Large-scale Nonlinear Optimization (Release A) – volume: 22 start-page: 997 year: 2001 end-page: 1013 ident: Bib0019 article-title: Multiple-rank modifications of a sparse Cholesky factorization publication-title: SIAM J. Matrix Anal. Appl. – volume: 29 start-page: 1773 year: 2016 end-page: 1798 ident: Bib0048 article-title: Projection onto a polyhedron that exploits sparsity publication-title: SIAM J. Optim. – start-page: 42 year: 1990 end-page: 54 ident: Bib0015 article-title: An introduction to the structure of large scale nonlinear optimization problems and the LANCELOT project publication-title: Computing Methods in Applied Sciences and Engineering – volume: 21 start-page: 263 year: 2002 end-page: 275 ident: Bib0038 article-title: The dual active set algorithm and its application to linear programming publication-title: Comput. Optim. Appl. – volume: 47 start-page: 305 year: 1990 end-page: 336 ident: Bib0010 article-title: Convergence properties of trust region methods for linear and convex constraints publication-title: Math. Progam. – volume: 25 start-page: 1197 year: 1988 end-page: 1211 ident: Bib0008 article-title: On the identification of active constraints publication-title: SIAM J. Numer. Anal. – start-page: 67 year: 2006 end-page: 82 ident: Bib0044 article-title: Recent advances in bound constrained optimization publication-title: System Modeling and Optimization, Proceedings of the 22nd IFIP TC7 Conference, Turin, Italy, July 18–22, 2005, Turin, Italy – year: 2014 ident: Bib0005 publication-title: Practical Augmented Lagrangian Methods for Constrained Optimization – volume: 16 start-page: 1 year: 1966 end-page: 3 ident: Bib0003 article-title: Minimization of functions having Lipschitz continuous first partial derivatives publication-title: Pacif. J. Math. – volume: 112 start-page: 275 issue: 2 year: 2008 end-page: 301 ident: Bib0022 article-title: A sparse proximal implementation of the LP dual active set algorithm publication-title: Math. Program. – start-page: 95 year: 2003 end-page: 107 ident: Bib0039 article-title: The dual active set algorithm and the iterative solution of linear programs publication-title: Novel Approaches to Hard Discrete Optimization – volume: 55 start-page: 37 year: 1987 end-page: 71 ident: Bib0033 article-title: Dual techniques for constrained optimization publication-title: J. Optim. Theory Appl. – volume: 2 start-page: 35 year: 2006 end-page: 58 ident: Bib0045 article-title: A survey of nonlinear conjugate gradient methods publication-title: Pacif. J. Optim. – volume: 66 start-page: 401 year: 2017 end-page: 424 ident: Bib0056 article-title: Structured regularization for barrier NLP solvers publication-title: Comput. Optim. Appl. – year: 2016 ident: Bib0030 publication-title: An SQP Method for Medium-scale Nonlinear Programming – volume: 17 start-page: 526 year: 2006 end-page: 557 ident: Bib0043 article-title: A new active set algorithm for box constrained optimization publication-title: SIAM J. Optim. – volume: 13 start-page: 44 year: 2002 end-page: 59 ident: Bib0026 article-title: On the global convergence of a filter-SQP algorithm publication-title: SIAM J. Optim. – volume: 60 start-page: 545 year: 2015 end-page: 557 ident: Bib0031 article-title: CUTEst: A constrained and unconstrained testing environment with safe threads for mathematical optimization publication-title: Comput. Optim. Appl. – start-page: 35 year: 2006 end-page: 59 ident: Bib0012 article-title: KNITRO: An integrated package for nonlinear optimization publication-title: Large-scale Nonlinear Optimization – volume: 23 start-page: 2150 year: 2013 end-page: 2168 ident: Bib0046 article-title: The limited memory conjugate gradient method publication-title: SIAM J. Optim. – volume: 35 start-page: 885 year: 2020 end-page: 920 ident: Bib0006 article-title: Complexity and performance of an augmented Lagrangian algorithm publication-title: Optim. Meth. Softw. – volume: 91 start-page: 239 year: 2002 end-page: 270 ident: Bib0025 article-title: Nonlinear programming without a penalty function publication-title: Math. Program. – volume: 59 start-page: 1525 year: 2016 end-page: 1542 ident: Bib0047 article-title: An active set algorithm for nonlinear optimization with polyhedral constraints publication-title: Sci. China Math. – volume: 3 start-page: 145 year: 1972 end-page: 156 ident: Bib0052 article-title: A quadratically-convergent algorithm for general nonlinear programming problems publication-title: Math. Progam. – volume: 106 start-page: 25 year: 2006 end-page: 57 ident: Bib0054 article-title: On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming publication-title: Math. Program. – volume: 18 start-page: 1286 issue: 4 year: 2007 end-page: 1309 ident: Bib0001 article-title: On augmented Lagrangian methods with general lower-level constraints publication-title: SIAM J. Optim. – year: 1986 ident: Bib0029 publication-title: User’s Guide for NPSOL (Version 4.0): A Fortran Package for Nonlinear Programming – volume: 8 start-page: 141 year: 1988 end-page: 148 ident: Bib0004 article-title: Two point step size gradient methods publication-title: IMA J. Numer. Anal. – volume: 47 start-page: 99 year: 2005 end-page: 131 ident: Bib0027 article-title: SNOPT: An SQP algorithm for large-scale constrained optimization publication-title: SIAM Rev. – volume: 13 start-page: 231 year: 1999 end-page: 252 ident: Bib0053 article-title: An interior-point algorithm for nonconvex nonlinear programming publication-title: Comput. Optim. Appl. – volume: 25 start-page: 433 year: 1988 end-page: 460 ident: Bib0014 article-title: Global convergence of a class of trust region algorithms for optimization with simple bounds publication-title: SIAM J. Numer. Anal. – volume: 32 start-page: 113 year: 2006 end-page: 137 ident: Bib0042 article-title: Algorithm 851: CG_DESCENT, A conjugate gradient method with guaranteed descent publication-title: ACM Trans. Math. Softw. – volume: 31 start-page: 221 issue: 2 year: 1989 end-page: 239 ident: Bib0034 article-title: Updating the inverse of a matrix publication-title: SIAM Rev. – volume: 16 start-page: 170 year: 2005 end-page: 192 ident: Bib0041 article-title: A new conjugate gradient method with guaranteed descent and an efficient line search publication-title: SIAM J. Optim. – volume: 25 start-page: 573 year: 1994 end-page: 595 ident: Bib0009 article-title: Exposing constraints publication-title: SIAM J. Optim. – volume: 14 start-page: 41 year: 1978 end-page: 72 ident: Bib0049 article-title: Large-scale linearly constrained optimization publication-title: Math. Progam. – volume: 26 start-page: 604 year: 2006 end-page: 627 ident: Bib0017 article-title: The cyclic Barzilai-Borwein method for unconstrained optimization publication-title: IMA J. Numer. Anal. – volume: 112 start-page: 403 issue: 2 year: 2008 end-page: 425 ident: Bib0021 article-title: Dual multilevel optimization publication-title: Math. Program. – ident: e_1_3_1_45_2 doi: 10.1007/0-387-33006-2_7 – ident: e_1_3_1_33_2 doi: 10.1137/0723046 – ident: e_1_3_1_51_2 doi: 10.1007/BFb0120949 – ident: e_1_3_1_25_2 doi: 10.1145/2828635 – ident: e_1_3_1_42_2 doi: 10.1137/030601880 – ident: e_1_3_1_27_2 doi: 10.1137/S105262340038081X – start-page: 95 volume-title: Novel Approaches to Hard Discrete Optimization year: 2003 ident: e_1_3_1_40_2 – ident: e_1_3_1_9_2 doi: 10.1137/0725068 – ident: e_1_3_1_26_2 doi: 10.1007/s101070100244 – volume-title: MINOS 5.0: User’s Guide year: 1987 ident: e_1_3_1_52_2 – start-page: 35 volume-title: Large-scale Nonlinear Optimization year: 2006 ident: e_1_3_1_13_2 doi: 10.1007/0-387-30065-1_4 – ident: e_1_3_1_54_2 doi: 10.1023/A:1008677427361 – volume: 2 start-page: 35 year: 2006 ident: e_1_3_1_46_2 article-title: A survey of nonlinear conjugate gradient methods publication-title: Pacif. J. Optim. – ident: e_1_3_1_12_2 doi: 10.1137/S1052623497325107 – ident: e_1_3_1_28_2 doi: 10.1137/S0036144504446096 – ident: e_1_3_1_34_2 doi: 10.5555/3182664.3182787 – volume-title: User’s Guide for LSSOL (Version 1.0) year: 1986 ident: e_1_3_1_29_2 – ident: e_1_3_1_21_2 doi: 10.1137/S089547980343641X – ident: e_1_3_1_35_2 doi: 10.1137/1031049 – ident: e_1_3_1_53_2 doi: 10.1007/BF01584986 – ident: e_1_3_1_44_2 doi: 10.1137/050635225 – ident: e_1_3_1_43_2 doi: 10.1145/1132973.1132979 – ident: e_1_3_1_47_2 doi: 10.1137/120898097 – ident: e_1_3_1_4_2 doi: 10.2140/pjm.1966.16.1 – volume-title: An SQP Method for Medium-scale Nonlinear Programming year: 2016 ident: e_1_3_1_31_2 – ident: e_1_3_1_37_2 doi: 10.5555/3182680.3183021 – ident: e_1_3_1_7_2 doi: 10.1080/10556788.2020.1746962 – ident: e_1_3_1_57_2 doi: 10.1007/s10589-016-9880-7 – ident: e_1_3_1_22_2 doi: 10.5555/3114201.3114714 – ident: e_1_3_1_6_2 doi: 10.5555/2655222 – volume-title: KNITRO user’s manual year: 2003 ident: e_1_3_1_56_2 – start-page: 243 volume-title: High Performance Algorithms and Software in Nonlinear Optimization year: 1998 ident: e_1_3_1_38_2 doi: 10.1007/978-1-4613-3279-4_16 – ident: e_1_3_1_5_2 doi: 10.1093/imanum/8.1.141 – ident: e_1_3_1_15_2 doi: 10.1137/0725029 – ident: e_1_3_1_20_2 doi: 10.1137/S0895479899357346 – start-page: 137 volume-title: Advances in Optimization and Parallel Computing year: 1992 ident: e_1_3_1_36_2 – ident: e_1_3_1_3_2 doi: 10.1007/978-3-319-58356-3 – ident: e_1_3_1_8_2 doi: 10.1145/502800.502803 – ident: e_1_3_1_30_2 doi: 10.21236/ADA169115 – ident: e_1_3_1_55_2 doi: 10.1007/s10107-004-0559-y – ident: e_1_3_1_18_2 doi: 10.1093/imanum/drl006 – ident: e_1_3_1_23_2 doi: 10.5555/3114201.3114710 – ident: e_1_3_1_19_2 doi: 10.1137/S0895479897321076 – ident: e_1_3_1_10_2 doi: 10.1137/0804032 – ident: e_1_3_1_32_2 doi: 10.1007/s10589-014-9687-3 – ident: e_1_3_1_41_2 doi: 10.1007/BF00248762 – ident: e_1_3_1_50_2 doi: 10.1007/BF01588950 – ident: e_1_3_1_39_2 doi: 10.1023/A:1013773102688 – ident: e_1_3_1_24_2 doi: 10.1145/1462173.1462176 – ident: e_1_3_1_2_2 doi: 10.1137/060654797 – ident: e_1_3_1_17_2 doi: 10.1007/978-3-662-12211-2 – start-page: 42 volume-title: Computing Methods in Applied Sciences and Engineering year: 1990 ident: e_1_3_1_16_2 – ident: e_1_3_1_49_2 doi: 10.1137/15M102825X – ident: e_1_3_1_48_2 doi: 10.1007/s11425-016-0300-6 – ident: e_1_3_1_11_2 doi: 10.1007/BF01580867 – volume: 35 start-page: 22:1–14 issue: 3 year: 2009 ident: e_1_3_1_14_2 article-title: Algorithm 887: CHOLMOD, supernodal sparse Cholesky factorization and update/downdate publication-title: ACM Trans. Math. Softw. |
| SSID | ssj0002171 |
| Score | 2.397638 |
| Snippet | The Polyhedral Active Set Algorithm (PASA) is designed to optimize a general nonlinear function over a polyhedron. Phase one of the algorithm is a nonmonotone... |
| SourceID | unpaywall crossref acm |
| SourceType | Open Access Repository Enrichment Source Index Database Publisher |
| StartPage | 1 |
| SubjectTerms | Mathematical optimization Nonconvex optimization Theory of computation |
| SubjectTermsDisplay | Theory of computation -- Mathematical optimization Theory of computation -- Nonconvex optimization |
| Title | Algorithm 1035: A Gradient-based Implementation of the Polyhedral Active Set Algorithm |
| URI | https://dl.acm.org/doi/10.1145/3583559 https://dl.acm.org/action/downloadSupplement?doi=10.1145%2F3583559&file=3583559.pdf |
| UnpaywallVersion | publishedVersion |
| Volume | 49 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVEBS databaseName: Mathematics Source customDbUrl: eissn: 1557-7295 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002171 issn: 1557-7295 databaseCode: AMVHM dateStart: 20110301 isFulltext: true titleUrlDefault: https://www.ebsco.com/products/research-databases/mathematics-source providerName: EBSCOhost |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Rb9MwED6N9gFeGCugbcBkpGmCh3RJbdcNEkIR2lYhbZo0CuOpsmN7m0iTqkuFxq_ht_DLODtOYSAkHnhLpMslcS5331l33wHsmlEiFSL5CKF8HjGT20hpJSONKVBsEjPKra-2OBmOJ-zdOT8PnXWuF0YXqGfWEAT7wv597UjjK6n9lEu_ZfYG__bXDc2tI0agHFEET_f8hOtw0p9rewe6Q44AvQPdyclp9qllz6TcN6ZgIBVukCtvWmmdsv1wtYtU-exWpLq7LOfy5ossil_Cz-E61O2DN1Unn_vLWvXzr79xOv7nN3sA9wNcJVljXxuwZsoerLejIEjwDD3YCEfX5EUgsn75ED5mxUW1uKovZ9-_JTHlr0hGjha-xqyOXPjUxJMTz0L_U0kqSxCQktOquLk0euHu7P0xOTM1WWl7BJPDg_dvx1EY5BDJgRB1hF4F3UZqJLMxs8JSwfJUYaJDFZqK1MYIi4ZBB8oKTNYHKtGMWoZI1OiYCk0fQ6esSrMJhKP5aDVIR1JTRplJU26HiaGxpMqlU1vQw1WezhuqjmlYtC3Yaz_lNA_c524ERzFt-rL5T0GyEmx1_CHyfGULf5PZ_geZJ3DPja53ZWeJeAqderE0zxDg1GoHutnxh_HxTjDcH3Ul9jo |
| linkProvider | Unpaywall |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LT9wwEB7R5UAvpSytgD5kpArRQ5Zkba83SFW1qnioB4RUVtDTyo5tQM0mqyWrCn4Nv6W_jLHjbHmoUg_cEmkySZzJzDfWzDcAn0w_kQqRfIRQPouYyWyktJKRxhQoNonpZ9ZXWxz1Dofs-xk_C511rhdG56hnXBME-8L-He1I40up_ZRLv2X2Ff_2LzXNrSNGoBxRBE-3_ITrcNKZaPsCFnscAXoLFodHx4OfDXsm5b4xBQOpcINced1K65TthKtdpMrGDyLV0qyYyOvfMs_vhZ_9ZaiaB6-rTn51ZpXqZDePOB2f-c1ew6sAV8mgtq8VWDBFG5abURAkeIY2rISjK7IdiKw_r8LpID8vp5fVxfjPbRJTvksG5GDqa8yqyIVPTTw58Tj0PxWktAQBKTku8-sLo6fuzt4fkx-mInNtb2C4v3fy7TAKgxwi2RWiitCroNtIjWQ2ZlZYKliWKkx0qEJTkdoYYdEwaFdZgcl6VyWaUcsQiRodU6HpW2gVZWHWgHA0H626aV9qyigzacptLzE0llS5dGod2rjKo0lN1TEKi7YOW82nHGWB-9yN4MhHdV82_ytI5oKNjicim3Nb-JfMxn_IvIOXbnS9KztLxHtoVdOZ-YAAp1Ifg8HeAcr39J4 |
| 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=Algorithm%C2%A01035%3A+A+Gradient-based+Implementation+of+the+Polyhedral+Active+Set+Algorithm&rft.jtitle=ACM+transactions+on+mathematical+software&rft.au=Hager%2C+William+W.&rft.au=Zhang%2C+Hongchao&rft.date=2023-06-17&rft.pub=ACM&rft.issn=0098-3500&rft.eissn=1557-7295&rft.volume=49&rft.issue=2&rft.spage=1&rft.epage=13&rft_id=info:doi/10.1145%2F3583559&rft.externalDocID=3583559 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0098-3500&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0098-3500&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0098-3500&client=summon |