AAAAAA

   
Results: 1-7 |
Results: 7
Superlinear convergence of primal-dual interior point algorithms for nonlinear programming
Authors: Gould, NIM Orban, D Sartenaer, A Toint, PL
Citation: Nim. Gould et al., Superlinear convergence of primal-dual interior point algorithms for nonlinear programming, SIAM J OPTI, 11(4), 2001, pp. 974-1002
Constraint preconditioning for indefinite linear systems
Authors: Keller, C Gould, NIM Wathen, AJ
Citation: C. Keller et al., Constraint preconditioning for indefinite linear systems, SIAM J MATR, 21(4), 2000, pp. 1300-1317
A primal-dual trust-region algorithm for non-convex nonlinear programming
Authors: Conn, AR Gould, NIM Orban, D Toint, PL
Citation: Ar. Conn et al., A primal-dual trust-region algorithm for non-convex nonlinear programming, MATH PROGR, 87(2), 2000, pp. 215-249
Subspace-by-subspace preconditioners for structured linear systems
Authors: Dayde, MJ Decamps, JP Gould, NIM
Citation: Mj. Dayde et al., Subspace-by-subspace preconditioners for structured linear systems, NUM LIN ALG, 6(3), 1999, pp. 213-234
On modified factorizations for large-scale linearly constrained optimization
Authors: Gould, NIM
Citation: Nim. Gould, On modified factorizations for large-scale linearly constrained optimization, SIAM J OPTI, 9(4), 1999, pp. 1041-1063
Solving the trust-region subproblem using the Lanczos method
Authors: Gould, NIM Lucidi, S Roma, M Toint, PL
Citation: Nim. Gould et al., Solving the trust-region subproblem using the Lanczos method, SIAM J OPTI, 9(2), 1999, pp. 504-525
A note on the convergence of barrier algorithms to second-order necessary points
Authors: Gould, NIM Toint, PL
Citation: Nim. Gould et Pl. Toint, A note on the convergence of barrier algorithms to second-order necessary points, MATH PROGR, 85(2), 1999, pp. 433-438
Risultati: 1-7 |