A new active set algorithm (ASA) for large-scale box constrained optimization is introduced. The algorithm consists of a nonmonotone gradient projection step, an unconstrained optimization step, and a set of rules for switching between the two steps. Numerical experiments and comparisons are presented using box constrained problems in the CUTEr and MINPACK test problem libraries. keywords: Nonm...

It is well known that the gradient-projection algorithm GPA is very useful in solving constrained convex minimization problems. In this paper, we combine a general iterative method with the gradient-projection algorithm to propose a hybrid gradient-projection algorithm and prove that the sequence generated by the hybrid gradient-projection algorithm converges in norm to a minimizer of constrain...

In this paper we present a fast iterative image superresolution algorithm using preconditioned conjugate gradient method. To avoid explicitly computing the tolerance in the inverse filter based preconditioner scheme, a new Wiener filter based preconditioner for the conjugate gradient method is proposed to speed up the convergence. The circulant-block structure of the preconditioner allows effic...

In this paper, a modified conjugate gradient method is presented for solving large-scale unconstrained optimization problems, which possesses the sufficient descent property with Strong Wolfe-Powell line search. A global convergence result was proved when the (SWP) line search was used under some conditions. Computational results for a set consisting of 138 unconstrained optimization test probl...

2 Method 1 2.1 Optical Flow . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 2.2 Lucas Kanade . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2.3 Gradient Descent . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.4 Conjugate Gradient Descent . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.5 Newton’s Method . . . . . . ...

Reconstruction of target images from phase-only hologram (POH) has the advantages high diffraction efficiency and no conjugate terms. The Gerchberg-Saxton (GS) algorithm is a classical applied to recover phase, but it most likely stagnantes after few iterations. This paper proposes hybrid iterative Amplitude Weighting Phase Gradient Descent (AW-PGD) generate higher-quality POH. Firstly, quadrat...

This paper is concerned with proving theoretical results related to the convergence of the Conjugate Gradient method for solving positive definite symmetric linear systems. New relations for ratios of the A-norm of the error and the norm of the residual are provided starting from some earlier results of Sadok [13]. These results use the well-known correspondence between the Conjugate Gradient m...