Nonlinear Optimization: A Parallel Linear Algebra Standpoint

[1]  Gundolf Haase.  Parallel Incomplete Cholesky Preconditioners Based on the Non-Overlapping Data Distribution , 1998, Parallel Comput..

[2]  N. Gould,et al.  Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques , 1998, SIAM J. Sci. Comput..

[3]  Dianne P. O'Leary,et al.  Adaptive use of iterative methods in predictor–corrector interior point methods for linear programming , 2000, Numerical Algorithms.

[4]  Marina Marino,et al.  Parallel computational issues of an interior point method for solving large bound-constrained quadratic programming problems , 2003, Parallel Comput..

[5]  Robert Michael Lewis,et al.  Pattern Search Methods for Linearly Constrained Minimization , 1999, SIAM J. Optim..

[6]  Yinyu Ye,et al.  An O(n3L) potential reduction algorithm for linear programming , 1991, Math. Program..

[7]  Patrick Amestoy,et al.  A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling , 2001, SIAM J. Matrix Anal. Appl..

[8]  Jorge Nocedal,et al.  On the limited memory BFGS method for large scale optimization , 1989, Math. Program..

[9]  Yousef Saad,et al.  Iterative methods for sparse linear systems , 2003 .

[10]  Michael A. Saunders,et al.  SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization , 2002, SIAM J. Optim..

[11]  Margaret H. Wright,et al.  Ill-Conditioning and Computational Error in Interior Methods for Nonlinear Programming , 1998, SIAM J. Optim..

[12]  Timothy A. Davis,et al.  Modifying a Sparse Cholesky Factorization , 1999, SIAM J. Matrix Anal. Appl..

[13]  Timothy A. Davis,et al.  Multiple-Rank Modifications of a Sparse Cholesky Factorization , 2000, SIAM J. Matrix Anal. Appl..

[14]  Yuefan Deng,et al.  New trends in high performance computing , 2001, Parallel Computing.

[15]  Shinji Mizuno,et al.  An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problems , 1991, Math. Program..

[16]  Gerardo Toraldo,et al.  On the Solution of Large Quadratic Programming Problems with Bound Constraints , 1991, SIAM J. Optim..

[17]  Chih-Jen Lin,et al.  Incomplete Cholesky Factorizations with Limited Memory , 1999, SIAM J. Sci. Comput..

[18]  Jorge Nocedal,et al.  Enriched Methods for Large-Scale Unconstrained Optimization , 2002, Comput. Optim. Appl..

[19]  Dianne P. O'Leary,et al.  Symbiosis between linear algebra and optimization , 2000 .

[20]  K. Schittkowski.  NLPQL: A fortran subroutine solving constrained nonlinear programming problems , 1986 .

[21]  Robert J. Vanderbei,et al.  Interior-point methods for nonconvex nonlinear programming: Jamming and numerical testing , 2004, Math. Program..

[22]  Robert L. Clay,et al.  A Portable MPI Implementation of the SPAI Preconditioner in ISIS++ , 1997, PPSC.

[23]  Jorge Nocedal,et al.  A Limited Memory Algorithm for Bound Constrained Optimization , 1995, SIAM J. Sci. Comput..

[24]  Alex Pothen,et al.  A Scalable Parallel Algorithm for Incomplete Factor Preconditioning , 2000, SIAM J. Sci. Comput..

[25]  Adam Liwo,et al.  Efficient parallel algorithms in global optimization of potential energy functions for peptides, proteins, and crystals , 2000 .

[26]  Lois C. McInnes,et al.  A case study in the performance and scalability of optimization algorithms , 2001, TOMS.

[27]  L. Zanni,et al.  Parallel Solution of Large Scale Quadratic Programs , 1998 .

[28]  C. Durazzi,et al.  Parallel Interior-Point Method for Linear and Quadratic Programs with Special Structure , 2001 .

[29]  Stephen G. Nash,et al.  A General-Purpose Parallel Algorithm for Unconstrained Optimization , 1991, SIAM J. Optim..

[30]  Panos M. Pardalos,et al.  Interior Point Methods for Global Optimization , 1996 .

[31]  Henk A. van der Vorst,et al.  Parallel incomplete factorizations with pseudo-overlapped subdomains , 2001, Parallel Comput..

[32]  Jorge Nocedal,et al.  Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization , 1997, TOMS.

[33]  Jorge Nocedal,et al.  A trust region method based on interior point techniques for nonlinear programming , 2000, Math. Program..

[34]  P. Boggs,et al.  Sequential quadratic programming for large-scale nonlinear optimization , 2000 .

[35]  S. Doi.  On parallelism and convergence of incomplete LU factorizations , 1991 .

[36]  Isabel Giménez,et al.  Parallel m-step preconditioners for the conjugate gradient method , 1999, Parallel Comput..

[37]  Patrick R. Amestoy,et al.  Multifrontal parallel distributed symmetric and unsymmetric solvers , 2000 .

[38]  Weiguo Fan,et al.  Parallel Algorithms for Large‐scale Nonlinear Optimization , 1998 .

[39]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[40]  J. J. Moré,et al.  Algorithms for bound constrained quadratic programming problems , 1989 .

[41]  Robert J. Vanderbei,et al.  An Interior-Point Algorithm for Nonconvex Nonlinear Programming , 1999, Comput. Optim. Appl..

[42]  Tony F. Chan,et al.  A Note on the Efficiency of Domain Decomposed Incomplete Factorizations , 1990, SIAM J. Sci. Comput..

[43]  Jorge Nocedal,et al.  An Interior Point Algorithm for Large-Scale Nonlinear Programming , 1999, SIAM J. Optim..

[44]  Jacek Gondzio,et al.  Implementation of Interior Point Methods for Large Scale Linear Programming , 1996 .

[45]  R. Dembo,et al.  INEXACT NEWTON METHODS , 1982 .

[46]  Achim Basermann,et al.  Preconditioned CG Methods for Sparse Matrices on Massively Parallel Machines , 1997, Parallel Comput..

[47]  Y. F. Hu,et al.  Ordering Unsymmetric Matrices into Bordered Block Diagonal Form for Parallel Processing , 1999, Euro-Par.

[48]  Michael J. Todd,et al.  A Centered Projective Algorithm for Linear Programming , 1990, Math. Oper. Res..

[49]  Bobby Schnabel,et al.  A View of the Limitations, Opportunities, and Challenges in Parallel Nonlinear Optimization , 1995, Parallel Comput..

[50]  S. Nash.  A survey of truncated-Newton methods , 2000 .

[51]  P. Toint,et al.  Partitioned variable metric updates for large structured optimization problems , 1982 .

[52]  Richard H. Byrd,et al.  Parallel quasi-Newton methods for unconstrained optimization , 1988, Math. Program..

[53]  Tamara G. Kolda,et al.  BFGS with Update Skipping and Varying Memory , 1998, SIAM J. Optim..

[54]  Panos M. Pardalos,et al.  Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP , 1995, IRREGULAR.

[55]  Robert J. Vanderbei,et al.  Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods , 2000, Math. Program..

[56]  Robert Michael Lewis,et al.  Pattern Search Algorithms for Bound Constrained Minimization , 1999, SIAM J. Optim..

[57]  Jacek Gondzio,et al.  Parallel interior-point solver for structured linear programs , 2003, Math. Program..

[58]  Erricos John Kontoghiorghes,et al.  Parallel Strategies for Rank-k Updating of the QR Decomposition , 2000, SIAM J. Matrix Anal. Appl..

[59]  Chih-Jen Lin,et al.  Newton's Method for Large Bound-Constrained Optimization Problems , 1999, SIAM J. Optim..

[60]  Panos M. Pardalos,et al.  A Parallel Implementation of a Potential Reduction Algorithm for Box-Constrained Quadratic Programming , 2000, Euro-Par.

[61]  Andreas Griewank,et al.  Algorithm 755: ADOL-C: a package for the automatic differentiation of algorithms written in C/C++ , 1996, TOMS.

[62]  C. Phillips,et al.  Independent Columns: A New Parallel ILU Preconditioner for the PCG Method , 1997, Parallel Comput..

[63]  Jidong Gao,et al.  Application of the Quasi-Inverse Method to Data Assimilation , 2000 .

[64]  Stephen G. Nash,et al.  Algorithm 711: BTN: software for parallel unconstrained optimization , 1992, TOMS.

[65]  Jorge Nocedal,et al.  Representations of quasi-Newton matrices and their use in limited memory methods , 1994, Math. Program..

[66]  Jean Charles Gilbert,et al.  A truncated SQP algorithm for solving nonconvex equality constrained optimization problems , 2003 .

[67]  Michael A. Saunders,et al.  Procedures for optimization problems with a mixture of bounds and general linear constraints , 1984, ACM Trans. Math. Softw..

[68]  Stephen J. Wright.  Effects of Finite-Precision Arithmetic on Interior-Point Methods for Nonlinear Programming , 2001, SIAM J. Optim..

[69]  Stephen G. Nash,et al.  Preconditioning Reduced Matrices , 1996, SIAM J. Matrix Anal. Appl..

[70]  Jack J. Dongarra,et al.  Algorithm 679: A set of level 3 basic linear algebra subprograms: model implementation and test programs , 1990, TOMS.

[71]  Zhi Wang,et al.  The Adjoint Newton Algorithm for Large-Scale Unconstrained Optimization in Meteorology Applications , 1998, Comput. Optim. Appl..

[72]  Patrick R. Amestoy,et al.  Analysis and comparison of two general sparse solvers for distributed memory computers , 2001, TOMS.

[73]  S. Doi,et al.  Large-numbered multicolor milu preconditioning on sx-3/14 , 1992 .

[74]  Yixun Shi,et al.  Solving linear systems involved in constrained optimization , 1995 .

[75]  Jorge Nocedal,et al.  Algorithm 809: PREQN: Fortran 77 subroutines for preconditioning the conjugate gradient method , 2001, TOMS.

[76]  Henk A. van der Vorst,et al.  A generalized domain decomposition paradigm for parallel incomplete LU factorization preconditionings , 2001, Future Gener. Comput. Syst..