Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Numer Algor

Search In Journal Title:

Abbravation: Numerical Algorithms

Search In Journal Abbravation:

Publisher

Springer US

Search In Publisher:

DOI

10.1016/0921-4534(94)90426-x

Search In DOI:

ISSN

1572-9265

Search In ISSN:
Search In Title Of Papers:

Nonmonotone line search methods with variable samp

Authors: Nataša Krejić Nataša Krklec Jerinkić
Publish Date: 2014/05/29
Volume: 68, Issue: 4, Pages: 711-739
PDF Link

Abstract

Nonmonotone line search methods for unconstrained minimization with the objective functions in the form of mathematical expectation are considered The objective function is approximated by the sample average approximation SAA with a large sample of fixed size The nonmonotone line search framework is embedded with a variable sample size strategy such that different sample size at each iteration allow us to reduce the cost of the sample average approximation The variable sample scheme we consider takes into account the decrease in the approximate objective function and the quality of the approximation of the objective function at each iteration and thus the sample size may increase or decrease at each iteration Nonmonotonicity of the line search combines well with the variable sample size scheme as it allows more freedom in choosing the search direction and the step size while the sample size is not the maximal one and increases the chances of finding a global solution Eventually the maximal sample size is used so the variable sample size strategy generates the solution of the same quality as the SAA method but with significantly smaller number of function evaluations Various nonmonotone strategies are compared on a set of test problems

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. Correction of eigenvalues estimated by the Legendre–Gauss Tau method
  2. Design with L-splines
  3. Accelerated Landweber methods based on co-dilated orthogonal polynomials
  4. A small note on the scaling of symmetric positive definite semiseparable matrices
  5. Solitary wave solutions of the one-dimensional Boussinesq equations
  6. Numerical solutions of index-1 differential algebraic equations can be computed in polynomial time
  7. Recursive self preconditioning method based on Schur complement for Toeplitz matrices
  8. A subspace conjugate gradient algorithm for large-scale unconstrained optimization
  9. The sparse cardinal sine decomposition and its application for fast numerical convolution
  10. A family of Steffensen type methods with seventh-order convergence
  11. On linearly related orthogonal polynomials in several variables
  12. Orthogonal polynomials—centroid of their zeroes
  13. Numerical methods for computing sensitivities for ODEs and DDEs
  14. The impact of parameter selection on the performance of an automatic adaptive code for solving reaction–diffusion equations in three dimensions
  15. A new subtraction-free formula for lower bounds of the minimal singular value of an upper bidiagonal matrix
  16. Extrapolation algorithms for solving nonlinear boundary integral equations by mechanical quadrature methods
  17. A global convergent derivative-free method for solving a system of non-linear equations
  18. A new constrained total variational deblurring model and its fast algorithm
  19. Numerical solution to generalized Lyapunov/Stein and rational Riccati equations in stochastic control
  20. Tracing the Pareto frontier in bi-objective optimization problems by ODE techniques
  21. A study of accelerated Newton methods for multiple polynomial roots
  22. A binary powering Schur algorithm for computing primary matrix roots
  23. Non-uniform exponential tension splines
  24. Galerkin-Chebyshev spectral method and block boundary value methods for two-dimensional semilinear parabolic equations
  25. On approximated ILU and UGS preconditioning methods for linearized discretized steady incompressible Navier-Stokes equations
  26. Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization
  27. A marching-on in time meshless kernel based solver for full-wave electromagnetic simulation
  28. Algorithms and software for total variation image reconstruction via first-order methods
Search Result: