Search

This paper presents a new optimal window design method with a general window design specification for the passband and stopband. The design problem is formulated as a semi-infinite linear programming problem. With suitable discretizations, an exchange algorithm is employed. The convergence of the proposed algorithm is established. In the formulation, since the stopband is minimized, the method can be employed for the design of very highly optimized windows. [ABSTRACT FROM PUBLISHER]

This paper first proposes a trust region algorithm to obtain a stationary point of unconstrained multiobjective optimisation problem. Under suitable assumptions, the global convergence of the new algorithm is established. We then extend the trust region method to solve the non-smooth multiobjective optimisation problem. [ABSTRACT FROM PUBLISHER]

In this paper we propose a filter-trust-region algorithm for solving nonlinear optimization problems with simple bounds. It extends the technique of Gould et al. [Gould, N.I.M. Sainvitu, C. and Toint, Ph.L., 2005, A filter-trust-region method for unconstrained optimization. SIAM Journal on Optimization, 16(2), 341-357.] designed for unconstrained optimization problems. The two main ingredients of the method are a filter-trust-region algorithm and a gradient-projection method. The algorithm is shown to be globally convergent to at least one first-order critical point. Numerical experiments on a large set of problems are also reported. [ABSTRACT FROM AUTHOR]

Direct search optimization algorithms are becoming an important alternative to well-established gradient based methods. Due to the fact that a single cost function evaluation may take a substantial amount of time, optimization can be a lengthy process. In order to shorten the run time one often resorts to parallel algorithms. Asynchronous algorithms are particularly efficient since they have no synchronization points. This paper is an attempt to establish a convergence theory for a class of such parallel direct search algorithms. The notion of a search direction generator (SDG) is introduced. An algorithmic framework for parallel distributed optimization methods based on SDGs is presented along with the corresponding convergence theory. The theory almost completely decouples the stepsize control from the sufficient descent requirement, which is necessary for the finite termination of the algorithm's inner loop. The proposed framework has several attributes considered very favourable in loosely coupled parallel systems (e.g. clusters of workstations), such as fault tolerance and scalability. The framework is illustrated by optimizing a set of test problems on a cluster of workstations. In all tested cases, a speedup was obtained that increased with the increasing number of workstations. Fault tolerance and scalability of the framework were also demonstrated by removing and adding workstations to the cluster while an optimization run was in progress. [ABSTRACT FROM AUTHOR]

A framework for proving global convergence for a class of line search filter-type methods for nonlinear programming is presented without assuming that the Jacobian has full rank everywhere. The underlying method is based on the filter concept where trial points are accepted, provided there is a sufficient decrease in the objective function or constraints violation function. The proposed methods solve a sequence of quadratic programming subproblems via line search techniques to induce global convergence. Under mild conditions, we will also show that the algorithm converges two step superlinearly when the iterates are near to the solution. [ABSTRACT FROM AUTHOR]

We consider the stochastic nonlinear complementarity problem (SNCP). We first formulate the problem as a stochastic mathematical program with equilibrium constraints and then, in order to develop efficient algorithms, we give some reformulations of the problem. Furthermore, based on the reformulations, we propose a smoothed penalty method for solving SNCP. A rigorous convergence analysis is also given. [ABSTRACT FROM AUTHOR]