Abstract: The problem of minimizing an L2-sensitivity measure subject to L2-norm dynamic-range scaling constraints for two-dimensional (2-D) separable-denominator digital filters is formulated. The constrained optimization problem is converted into an unconstrained optimization problem by using linear-algebraic techniques. Next, an efficient quasi-Newton algorithm is applied with closed-form fo...

In this study, the finite element model updating was simulated by reducing the stiffness of the members. Due to lack of access to the experimental results, the data obtained from an analytical model were used in the proposed structural damage scenarios. The updating parameters for the studied structures were defined as a reduction coefficient applied to the stiffness of the members. Parameter v...

‎based on an eigenvalue analysis‎, ‎a new proof for the sufficient‎ ‎descent property of the modified polak-ribière-polyak conjugate‎ ‎gradient method proposed by yu et al‎. ‎is presented‎.

A new approach to the problem of minimizing L2sensitivity subject to L2-norm scaling constraints for state-space digital filters is proposed. Using linearalgebraic techniques, the problem at hand is converted into an unconstrained optimization problem, and the unconstrained problem obtained is then solved by applying an efficient quasi-Newton algorithm. Computer simulation results are presented...

An active set algorithm (ASA) for box constrained optimization is developed. The algorithm consists of a nonmonotone gradient projection step, an unconstrained optimization step, and a set of rules for branching between the two steps. Global convergence to a stationary point is established. For a nondegenerate stationary point, the algorithm eventually reduces to unconstrained optimization with...

Constrained optimization via the Genetic Algorithm (GA) is often a challenging endeavor, as the GA is most directly suited to unconstrained optimization. Traditionally, external penalty functions have been used to convert a constrained optimization problem into an unconstrained problem for GA-based optimization. This approach requires the somewhat arbitrary selection of penalty draw-down coeffi...

In this paper‎, ‎two extended three-term conjugate gradient methods based on the Liu-Storey ({tt LS})‎ ‎conjugate gradient method are presented to solve unconstrained optimization problems‎. ‎A remarkable property of the proposed methods is that the search direction always satisfies‎ ‎the sufficient descent condition independent of line search method‎, ‎based on eigenvalue analysis‎. ‎The globa...