101 research outputs found
A Conjugate Gradient Method with Global Convergence for Large-Scale Unconstrained Optimization Problems
The conjugate gradient (CG) method has played a special role in solving large-scale nonlinear
optimization problems due to the simplicity of their very low memory requirements. This paper
proposes a conjugate gradient method which is similar to Dai-Liao conjugate gradient method (Dai and Liao, 2001)
but has stronger convergence properties. The given method possesses the sufficient descent condition,
and is globally convergent under strong Wolfe-Powell (SWP) line search for general function. Our
numerical results show that the proposed method is very efficient for the test problems
A New Conjugate Gradient Algorithm with Sufficient Descent Property for Unconstrained Optimization
A new nonlinear conjugate gradient formula, which satisfies the sufficient descent condition, for solving unconstrained optimization problem is proposed. The global convergence of the algorithm is established under weak Wolfe line search. Some numerical experiments show that this new WWPNPRP+ algorithm is competitive to the SWPPRP+ algorithm, the SWPHS+ algorithm, and the WWPDYHS+ algorithm
Modification of Nonlinear Conjugate Gradient Method with Weak Wolfe-Powell Line Search
Conjugate gradient (CG) method is used to find the optimum solution for the large scale unconstrained optimization problems. Based on its simple algorithm, low memory requirement, and the speed of obtaining the solution, this method is widely used in many fields, such as engineering, computer science, and medical science. In this paper, we modified CG method to achieve the global convergence with various line searches. In addition, it passes the sufficient descent condition without any line search. The numerical computations under weak Wolfe-Powell line search shows that the efficiency of the new method is superior to other conventional methods
Unconstrained Optimization Methods: Conjugate Gradient Methods and Trust-Region Methods
Here, we consider two important classes of unconstrained optimization methods: conjugate gradient methods and trust region methods. These two classes of methods are very interesting; it seems that they are never out of date. First, we consider conjugate gradient methods. We also illustrate the practical behavior of some conjugate gradient methods. Then, we study trust region methods. Considering these two classes of methods, we analyze some recent results
A Modified Conjugacy Condition and Related Nonlinear Conjugate Gradient Method
The conjugate gradient (CG) method has played a special role in solving large-scale nonlinear optimization problems due to the simplicity of their very low memory requirements. In this paper, we propose a new conjugacy condition which is similar to Dai-Liao (2001). Based on this condition, the related nonlinear conjugate gradient method is given. With some mild conditions, the given method is globally convergent under the strong Wolfe-Powell line search for general functions. The numerical experiments show that the proposed method is very robust and efficient
Normalized Wolfe-Powell-type local minimax method for finding multiple unstable solutions of nonlinear elliptic PDEs
The local minimax method (LMM) proposed in [Y. Li and J. Zhou, SIAM J. Sci.
Comput., 23(3), 840--865 (2001)] and [Y. Li and J. Zhou, SIAM J. Sci. Comput.,
24(3), 865--885 (2002)] is an efficient method to solve nonlinear elliptic
partial differential equations (PDEs) with certain variational structures for
multiple solutions. The steepest descent direction and the Armijo-type
step-size search rules are adopted in [Y. Li and J. Zhou, SIAM J. Sci. Comput.,
24(3), 865--885 (2002)] and play a significant role in the performance and
convergence analysis of traditional LMMs. In this paper, a new algorithm
framework of the LMMs is established based on general descent directions and
two normalized (strong) Wolfe-Powell-type step-size search rules. The
corresponding algorithm framework named as the normalized Wolfe-Powell-type LMM
(NWP-LMM) is introduced with its feasibility and global convergence rigorously
justified for general descent directions. As a special case, the global
convergence of the NWP-LMM algorithm combined with the preconditioned steepest
descent (PSD) directions is also verified. Consequently, it extends the
framework of traditional LMMs. In addition, conjugate gradient-type (CG-type)
descent directions are utilized to speed up the NWP-LMM algorithm. Finally,
extensive numerical results for several semilinear elliptic PDEs are reported
to profile their multiple unstable solutions and compared for different
algorithms in the LMM's family to indicate the effectiveness and robustness of
our algorithms. In practice, the NWP-LMM combined with the CG-type direction
indeed performs much better than its known LMM companions.Comment: 27 pages, 9 figures; Accepted by SCIENCE CHINA Mathematics on January
17, 202
A Modified Nonlinear Conjugate Gradient Method for Engineering Computation
A general criterion for the global convergence of the nonlinear conjugate gradient method is established, based on which the global convergence of a new modified three-parameter nonlinear conjugate gradient method is proved under some mild conditions. A large amount of numerical experiments is executed and reported, which show that the proposed method is competitive and alternative. Finally, one engineering example has been analyzed for illustrative purposes
Nonmonotone local minimax methods for finding multiple saddle points
In this paper, by designing a normalized nonmonotone search strategy with the
Barzilai--Borwein-type step-size, a novel local minimax method (LMM), which is
a globally convergent iterative method, is proposed and analyzed to find
multiple (unstable) saddle points of nonconvex functionals in Hilbert spaces.
Compared to traditional LMMs with monotone search strategies, this approach,
which does not require strict decrease of the objective functional value at
each iterative step, is observed to converge faster with less computations.
Firstly, based on a normalized iterative scheme coupled with a local peak
selection that pulls the iterative point back onto the solution submanifold, by
generalizing the Zhang--Hager (ZH) search strategy in the optimization theory
to the LMM framework, a kind of normalized ZH-type nonmonotone step-size search
strategy is introduced, and then a novel nonmonotone LMM is constructed. Its
feasibility and global convergence results are rigorously carried out under the
relaxation of the monotonicity for the functional at the iterative sequences.
Secondly, in order to speed up the convergence of the nonmonotone LMM, a
globally convergent Barzilai--Borwein-type LMM (GBBLMM) is presented by
explicitly constructing the Barzilai--Borwein-type step-size as a trial
step-size of the normalized ZH-type nonmonotone step-size search strategy in
each iteration. Finally, the GBBLMM algorithm is implemented to find multiple
unstable solutions of two classes of semilinear elliptic boundary value
problems with variational structures: one is the semilinear elliptic equations
with the homogeneous Dirichlet boundary condition and another is the linear
elliptic equations with semilinear Neumann boundary conditions. Extensive
numerical results indicate that our approach is very effective and speeds up
the LMMs significantly.Comment: 32 pages, 7 figures; Accepted by Journal of Computational Mathematics
on January 3, 202
A vision-based optical character recognition system for real-time identification of tractors in a port container terminal
Automation has been seen as a promising solution to increase the productivity of modern sea port container terminals. The potential of increase in throughput, work efficiency and reduction of labor cost have lured stick holders to strive for the introduction of automation in the overall terminal operation. A specific container handling process that is readily amenable to automation is the deployment and control of gantry cranes in the container yard of a container terminal where typical operations of truck identification, loading and unloading containers, and job management are primarily performed manually in a typical terminal. To facilitate the overall automation of the gantry crane operation, we devised an approach for the real-time identification of tractors through the recognition of the corresponding number plates that are located on top of the tractor cabin. With this crucial piece of information, remote or automated yard operations can then be performed. A machine vision-based system is introduced whereby these number plates are read and identified in real-time while the tractors are operating in the terminal. In this paper, we present the design and implementation of the system and highlight the major difficulties encountered including the recognition of character information printed on the number plates due to poor image integrity. Working solutions are proposed to address these problems which are incorporated in the overall identification system.postprin
Job shop scheduling with artificial immune systems
The job shop scheduling is complex due to the dynamic environment. When the information of the jobs and machines are pre-defined and no unexpected events occur, the job shop is static. However, the real scheduling environment is always dynamic due to the constantly changing information and different uncertainties. This study discusses this complex job shop scheduling environment, and applies the AIS theory and switching strategy that changes the sequencing approach to the dispatching approach by taking into account the system status to solve this problem. AIS is a biological inspired computational paradigm that simulates the mechanisms of the biological immune system. Therefore, AIS presents appealing features of immune system that make AIS unique from other evolutionary intelligent algorithm, such as self-learning, long-lasting memory, cross reactive response, discrimination of self from non-self, fault tolerance, and strong adaptability to the environment. These features of AIS are successfully used in this study to solve the job shop scheduling problem. When the job shop environment is static, sequencing approach based on the clonal selection theory and immune network theory of AIS is applied. This approach achieves great performance, especially for small size problems in terms of computation time. The feature of long-lasting memory is demonstrated to be able to accelerate the convergence rate of the algorithm and reduce the computation time. When some unexpected events occasionally arrive at the job shop and disrupt the static environment, an extended deterministic dendritic cell algorithm (DCA) based on the DCA theory of AIS is proposed to arrange the rescheduling process to balance the efficiency and stability of the system. When the disturbances continuously occur, such as the continuous jobs arrival, the sequencing approach is changed to the dispatching approach that involves the priority dispatching rules (PDRs). The immune network theory of AIS is applied to propose an idiotypic network model of PDRs to arrange the application of various dispatching rules. The experiments show that the proposed network model presents strong adaptability to the dynamic job shop scheduling environment.postprin
- …