A heuristic is proposed for a problem that occurs in the design of thick composite cylinders: the selection of the angles of wrap of all the layers forming a cylinder for given material properties and layer thicknesses. The heuristic consists of a local search algorithm that improves on a given initial design by modifying the angle of a single layer in each iteration. Each design is evaluated b...

In this work Iterative Learning Control is extended to non-uniform trajectory tracking problems for certain classes of nonlinear uncertain systems. The proposed ILC scheme can learn from different motion patterns and guarantee the asymptotic convergence even if the target trajectory varies at every iteration. The concept of Composite Energy Function (CEF) is adopted to facilitate the convergenc...

Some generalizations of the secant method to semismooth equations are presented. In the one-dimensional case the superlinear convergence of the classical secant method for general semismooth equations is proved. Moreover a new quadratically convergent method is proposed that requires two function values per iteration. For the n-dimensional cases, we discuss secant methods for two classes of com...

In this paper, we consider the linearly constrained composite convex optimization problem, whose objective is a sum of a smooth function and a possibly nonsmooth function. We propose an inexact augmented Lagrangian (IAL) framework for solving the problem. The proposed IAL framework requires solving the augmented Lagrangian (AL) subproblem at each iteration less accurately than most of the exist...

‎In this paper we propose a new iteration process‎, ‎called the $K^{ast }$ iteration process‎, ‎for approximation of fixed‎ ‎points‎. ‎We show that our iteration process is faster than the existing well-known iteration processes using numerical examples‎. ‎Stability of the $K^{ast‎}‎$ iteration process is also discussed‎. ‎Finally we prove some weak and strong convergence theorems for Suzuki ge...

Abstract Various strategies are available to construct iteratively a common fixed point of nonexpansive operators by activating only block at each iteration. In the more challenging class composite problems involving that do not share points, current methods require activation all iteration, and question maintaining convergence while updating blocks is open. We propose method achieves this goal...