Search

Inspired by the first-order method of Malitsky and Pock, we propose a new variational framework for compressed MR image reconstruction which introduces the application of a rotation-invariant discretization of total variation functional into MR imaging while exploiting BM3D frame as a sparsifying transform. In the first step, we provide theoretical and numerical analysis establishing the exceptional rotation-invariance property of this total variation functional and observe its superiority over other well-known variational regularization terms in both upright and rotated imaging setups. Thereupon, the proposed MRI reconstruction model is presented as a constrained optimization problem, however, we do not use conventional ADMM-type algorithms designed for constrained problems to obtain a solution, but rather we tailor the linesearch-equipped method of Malitsky and Pock to our model, which was originally proposed for unconstrained problems. As attested by numerical experiments, this framework significantly outperforms various state-of-the-art algorithms from variational methods to adaptive and learning approaches and in particular, it eliminates the stagnating behavior of a previous work on BM3D-MRI which compromised the solution beyond a certain iteration. [ABSTRACT FROM AUTHOR]

For the structured systems of linear equations arising from the Galerkin finite element discretizations of elliptic PDE-constrained optimization problems, some preconditioners are proposed to accelerate the convergence rate of Krylov subspace methods such as GMRES for both cases of the Tikhonov parameter β not very small (equal or greater than 1e−6) and sufficiently small (less than 1e−6), respectively. We derive the explicit expressions for the eigenvalues and eigenvectors of the corresponding preconditioned matrices. Numerical results show that the corresponding preconditioned GMRES methods perform and match well with the theoretical results. [ABSTRACT FROM AUTHOR]

In this article, we focus on mobile wellness and health-related applications from the perspective of the level of imprecision present in the data used in the recommendation systems. We propose a general fuzzy optimization model based on chanced constrained optimization to design recommendation systems that can take into consideration (i) the imprecision in the data and (ii) the imprecision by which one can estimate the effect of a recommendation on the user of the system. Our proposal is one of the first to use fuzzy optimization models in health-related decision making problems and the first to define a chance constrained optimization problem for interval-valued fuzzy numbers. The proposed approach identifies a set of actions to be taken by the users in order to optimize general health-related and/or wellness condition of the user from various perspectives. The model is illustrated through the example of walking speed optimization, with an additional numerical experiment offering a comparison with traditional methods. [ABSTRACT FROM AUTHOR]

This paper deals with the numerical investigation of nonlinear optimal control problems with multiple delays in which the state trajectory and control input are subject to mixed state-control constraints. A direct approach based on a hybrid of block-pulse functions and Lagrange interpolation is proposed. The constrained optimal control problem is first reformulated as an unconstrained optimization one using a penalty function technique. The resulting optimization problem is then solved by means of the Lagrange multipliers procedure. The proposed framework is an extension and also a modification of the conventional Lagrange interpolation. Combining block-pulse functions and Lagrange interpolation allows one to simultaneously make use the advantages of the two mentioned bases. The operational matrices of delay and derivative associated with the hybrid functions are presented. An upper error bound for the proposed hybrid functions with respect to the maximum norm is obtained. Simulation studies are provided to verify the validity and reliability of the developed procedure. [ABSTRACT FROM AUTHOR]

In this paper, using an optimize-then-discretize approach, we address the numerical solution of two Fraction Partial Differential Equation constrained optimization problems: the Fractional Advection Dispersion Equation (FADE) and the two-dimensional semilinear Riesz Space Fractional Diffusion equation . Both a theoretical and experimental analysis of the problem is carried out. The algorithmic framework is based on the L-BFGS method coupled with a Krylov subspace solver. A suitable preconditioning strategy by approximate inverses is taken into account. Graphics Processing Unit (GPU) accelerator is used in the construction of the preconditioners. The numerical experiments are performed with benchmarked software/libraries enforcing the reproducibility of the results. [ABSTRACT FROM AUTHOR]

In this paper, we present a QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization. At each iteration, three systems of linear equations with the same coefficient matrix are solved to yield search direction; the nonmonotone line search ensures that the objective function or constraint violation function is sufficiently reduced. There is no feasibility restoration phase in our algorithm, which is necessary for filter methods. The algorithm possesses global convergence as well as superlinear convergence under some mild conditions including a weaker assumption of positive definiteness. Finally, some preliminary numerical results are reported. [ABSTRACT FROM AUTHOR]

The design of a propeller for a high-speed craft is addressed by using a multi-objective numerical optimization approach. By combining a fast and reliable Boundary Elements Method (BEM), a viscous flow solver based on the RANSE approximation, a parametric 3D description of the blade and a genetic algorithm, the new propeller shape is designed to improve the propulsive efficiency, reduce the cavitation extension, increase the cavitation inception speed and maximize, at the same time, the ship speed. Rather than by constraining the propeller delivered thrust, indeed, the proposed procedure works together with an engine-propeller matching algorithm that, each time a new propeller is defined, identifies the achievable maximum ship speed and the resulting engine functioning point that turn in additional goals for the multi-objective optimization. A set of optimal propellers, obtained through the design by optimization based on potential flow calculations (via the Boundary Elements Method), are selected for additional viscous analyses (RANSE calculations) in order to further validate the results of the BEM calculations and provide a deeper insight into the complex flow fields of high speed propellers. Among this subset of optimal configurations, a final geometry is selected to verify the reliability of the design procedure by means of dedicated cavitation tunnel tests and full-scale measurements on a high-speed craft provided by Azimut|Benetti. [ABSTRACT FROM AUTHOR]

This paper presents a new powerful nature-inspired method named Virus Colony Search (VCS). VCS simulates diffusion and infection strategies for the host cells adopted by virus to survive and propagate in the cell environment. With the strategies, the individual in the new algorithm explores and exploits the search space more efficiently. To verify the performance of our VCS, both the unconstrained classic and CEC2014 modern benchmark functions, and constrained engineering design optimization problems are employed. The experimental results, considering both convergence and accuracy simultaneously, demonstrate the effectiveness of VCS for global numerical and engineering optimization problems. [ABSTRACT FROM AUTHOR]

A trust-region algorithm in association with line search filter technique for solving nonlinear equality constrained programming is proposed in this paper. In the current iteration, the trial step providing sufficient descent is generated by solving a corresponding trust-region subproblem. Then, the step size is decided by backtracking line search together with filter technique to obtain the next iteration point. The advantage of this method is that resolving trust-region subproblem many times to determine a new iteration point in traditional trust-region method can be avoided and hence the expensive computation can be lessened. And the difficult decisions in regard to the choice of penalty parameters in the merit functions can be avoided by using filter technique. Second order correction steps are introduced in the proposed algorithm to overcome Maratos effect. Convergence analysis shows that fast local convergence can be achieved under some mild assumptions. The preliminary numerical results are reported. [ABSTRACT FROM AUTHOR]

Inexact Restoration methods have been proved to be effective to solve constrained optimization problems in which some structure of the feasible set induces a natural way of recovering feasibility from arbitrary infeasible points. Sometimes natural ways of dealing with minimization over tangent approximations of the feasible set are also employed. A recent paper [Banihashemi and Kaya (2013)] suggests that the Inexact Restoration approach can be competitive with well-established nonlinear programming solvers when applied to certain control problems without any problem-oriented procedure for restoring feasibility. This result motivated us to revisit the idea of designing general-purpose Inexact Restoration methods, especially for large-scale problems. In this paper we introduce affordable algorithms of Inexact Restoration type for solving arbitrary nonlinear programming problems and we perform the first experiments that aim to assess their reliability. Initially, we define a purely local Inexact Restoration algorithm with quadratic convergence. Then, we modify the local algorithm in order to increase the chances of success of both the restoration and the optimization phase. This hybrid algorithm is intermediate between the local algorithm and a globally convergent one for which, under suitable assumptions, convergence to KKT points can be proved. [ABSTRACT FROM AUTHOR]

This paper presents a one-layer neural network to solve nonsmooth convex optimization problems based on the Tikhonov regularization method. Firstly, it is shown that the optimal solution of the original problem can be approximated by the optimal solution of a strongly convex optimization problems. Then, it is proved that for any initial point, the state of the proposed neural network enters the equality feasible region in finite time, and is globally convergent to the unique optimal solution of the related strongly convex optimization problems. Compared with the existing neural networks, the proposed neural network has lower model complexity and does not need penalty parameters. In the end, some numerical examples and application are given to illustrate the effectiveness and improvement of the proposed neural network. [ABSTRACT FROM AUTHOR]

The paper presents a constrained optimization procedure (COP) for the dynamic analysis of hybrid base isolation systems under earthquake excitation. After a description of the hybrid system considered, the mechanical model used for its representation is introduced, along with the governing equations. Mid-point central difference time-discretization is used to cast the computations in each time increment as a quadratic optimization problem with non-linear constraints. Numerical applications illustrate the accuracy and robustness of the formulation and highlight some typical performance characteristics of hybrid base isolation systems. [ABSTRACT FROM AUTHOR]

Seeker optimization algorithm is one of the recent swarm intelligence metaheuristics for hard optimization problems. It is based on the human group search behavior and it was successfully applied to various numerical optimization problems. While the seeker optimization algorithm was proven to be successful for different specific problems, it was not properly tested on a wide set of benchmark functions. Our testing on the standard well-known set of benchmark functions shows that the seeker optimization algorithm has serious problems with some types of functions. In this paper we introduced modifications to the seeker optimization algorithm to control exploitation/exploration balance and hybridized it with elements of the firefly algorithm that improved its exploitation capabilities. The firefly algorithm alone also exhibits deficiencies. Our proposed modified and hybridized seeker optimization algorithm not only overcame shortcomings of the original algorithms, but also outperformed other state-of-the-art swarm intelligence algorithms. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, we study an efficient tridiagonal preconditioner, based on the directional differentiation, applied to the matrix-free truncated Newton method for unconstrained optimization. It is proved that this preconditioner is positive definite for many practical problems. The efficiency of the resulting matrix-free truncated Newton method is demonstrated by results of extensive numerical experiments. [Copyright &y& Elsevier]

Highlights: [•] A new meta-heuristic called Grey Wolf Optimizer inspired by grey wolves is proposed. [•] The GWO algorithm is benchmarked on 29 well-known test functions. [•] The results on the unimodal functions show the superior exploitation of GWO. [•] The exploration ability of GWO is confirmed by the results on multimodal functions. [•] The results on semi-real and real problems confirm the performance of GWO in practice. [ABSTRACT FROM AUTHOR]

Abstract: A new line search method is introduced for solving nonlinear equality constrained optimization problems. It does not use any penalty function or a filter. At each iteration, the trial step is determined such that either the value of the objective function or the measure of the constraint violation is sufficiently reduced. Under usual assumptions, it is shown that every limit point of the sequence of iterates generated by the algorithm is feasible, and there exists at least one limit point that is a stationary point for the problem. A simple modification of the algorithm by introducing second order correction steps is presented. It is shown that the modified method does not suffer from the Maratos’ effect, so that it converges superlinearly. The preliminary numerical results are reported. [Copyright &y& Elsevier]

Abstract: The linear least squares (LLS) technique is widely used in time-difference-of-arrival based positioning because of its computational efficiency. Two-step weighted least squares (2WLS) and constrained weighted least squares (CWLS) algorithms are two common LLS schemes where an additional variable is introduced to obtain linear equations. However, they both have the same measurement matrix that becomes ill-conditioned when the sensor geometry is a uniform circular array and the source is close to the array center. In this paper, a new CWLS estimator is proposed to circumvent this problem. The main strategy is to separate the source coordinates and the additional variable to different sides of the linear equations where the latter is first solved via a quadratic equation. In doing so, the matrix to be inverted has a smaller condition number than that of the conventional LLS approach. The performance of the proposed method is analyzed in the presence of zero-mean white Gaussian disturbances. Numerical examples are also included to evaluate its localization accuracy by comparing with the existing 2WLS and CWLS algorithms as well as the Cramér–Rao lower bound. [Copyright &y& Elsevier]

Abstract: Two families of limited-memory variable metric or quasi-Newton methods for unconstrained minimization based on the quasi-product form of update are derived. As for the first family, four variants how to utilize the Strang recurrences for the Broyden class of variable metric updates are investigated; three of them use the same number of stored vectors as the limited-memory BFGS method. Moreover, one of the variants does not require any additional matrix by vector multiplication. The second family uses vectors from the preceding iteration to construct a new class of variable metric updates. The resulting methods again require neither any additional matrix by vector multiplication nor any additional stored vector. Global convergence of four of the presented methods is established for convex sufficiently smooth functions. Numerical results indicate that two of the new methods can save computational time substantially for certain problems. [Copyright &y& Elsevier]

Abstract: A simple three-term conjugate gradient algorithm which satisfies both the descent condition and the conjugacy condition is presented. This algorithm is a modification of the Hestenes and Stiefel algorithm (Hestenes and Stiefel, 1952) [10], or that of Hager and Zhang (Hager and Zhang, 2005) [23] in such a way that the search direction is descent and it satisfies the conjugacy condition. These properties are independent of the line search. Also, the algorithm could be considered as a modification of the memoryless BFGS quasi-Newton method. The new approximation of the minimum is obtained by the general Wolfe line search, now using a standard acceleration technique developed by Andrei (2009) [27]. For uniformly convex functions, under standard assumptions, the global convergence of the algorithm is proved. Numerical comparisons of the suggested three-term conjugate gradient algorithm versus six other three-term conjugate gradient algorithms, using a set of 750 unconstrained optimization problems, show that all these computational schemes have similar performances, the suggested one being slightly faster and more robust. The proposed three-term conjugate gradient algorithm substantially outperforms the well-known Hestenes and Stiefel conjugate gradient algorithm, as well as the more elaborate CG_DESCENT algorithm. Using five applications from the MINPACK-2 test problem collection (Averick et al., 1992) [25], with variables, we show that the suggested three-term conjugate gradient algorithm is the top performer versus CG_DESCENT. [Copyright &y& Elsevier]

Abstract: We present a class of trust region algorithms that do not use any penalty function or a filter for nonlinear equality constrained optimization. In each iteration, the infeasibility is controlled by a progressively decreasing upper limit and trial steps are computed by a Byrd–Omojokun-type trust region strategy. Measures of optimality and infeasibility are computed, whose relationship serves as a criterion on which the algorithm decides which one to focus on improving. As a result, the algorithm keeps a balance between the improvements on optimality and feasibility even if no restoration phase which is required by filter methods is used. The framework of the algorithm ensures the global convergence without assuming regularity or boundedness on the iterative sequence. By using a second order correction strategy, Marato’s effect is avoided and fast local convergence is shown. The preliminary numerical results are reported. [Copyright &y& Elsevier]

Abstract: In this paper, a trust-region sequential quadratic programming algorithm with a modified filter acceptance mechanism is proposed for nonlinear equality constrained optimization. The most important advantage of the proposed algorithm is its avoidance of any feasibility restoration phase, a necessity in traditional filter methods. We solve quadratic programming subproblems based on the well-known Byrd–Omojokun trust-region method. Inexact solutions to these subproblems are allowed. Under some standard assumptions, global convergence of the proposed algorithm is established. Numerical results show our approach is potentially useful. [Copyright &y& Elsevier]

Abstract: A 2D Unconstrained Third Order Shear Deformation Theory (UTSDT) is presented for the evaluation of tangential and normal stresses in moderately thick functionally graded cylindrical shells subjected to mechanical loadings. Eight types of graded materials are investigated. The functionally graded material consists of ceramic and metallic constituents. A four parameter power law function is used. The UTSDT allows the presence of a finite transverse shear stress at the top and bottom surfaces of the graded cylindrical shell. In addition, the initial curvature effect included in the formulation leads to the generalization of the present theory (GUTSDT). The Generalized Differential Quadrature (GDQ) method is used to discretize the derivatives in the governing equations, the external boundary conditions and the compatibility conditions. Transverse and normal stresses are also calculated by integrating the three dimensional equations of equilibrium in the thickness direction. In this way, the six components of the stress tensor at a point of the cylindrical shell or panel can be given. The initial curvature effect and the role of the power law functions are shown for a wide range of functionally cylindrical shells under various loading and boundary conditions. Finally, numerical examples of the available literature are worked out. [Copyright &y& Elsevier]

Abstract: In this paper a mathematical problem with linear flexible constraints is considered. In order to solve the problem an approach is proposed based on multiobjective linear programming. Indeed, allowing violations for the constraints, and using multiobjective linear programming to minimize these violations, a subset of solution set which has less violations, namely efficiently feasible set, is obtained. Then, the corresponding objective function is optimized over efficiently feasible set in order to obtain an optimal solution. An application of the proposed approach in pattern classification is introduced. [Copyright &y& Elsevier]

Abstract: A higher order numerical discretization technique based on Minimum Sobolev Norm (MSN) interpolation was introduced in our previous work. In this article, the discretization technique is presented as a tool to solve two hard classes of PDEs, namely, the exterior Laplace problem and the biharmonic problem. The exterior Laplace problem is compactified and the resultant near singular PDE is solved using this technique. This finite difference type method is then used to discretize and solve biharmonic type PDEs. A simple book keeping trick of using Ghost points is used to obtain a perfectly constrained discrete system. Numerical results such as discretization error, condition number estimate, and solution error are presented. For both classes of PDEs, variable coefficient examples on complicated geometries and irregular grids are considered. The method is seen to have high order of convergence in all these cases through numerical evidence. Perhaps for the first time, such a systematic higher order procedure for irregular grids and variable coefficient cases is now available. Though not discussed in the paper, the idea seems to be easily generalizable to finite element type techniques as well. [Copyright &y& Elsevier]

Abstract: In this paper we propose a simple meshless method of fundamental solutions (MFS) for detecting a sound-soft scatterer embedded in a host acoustic homogeneous medium from the measurement of the far-field pattern of the scattered wave for only one incoming direction. Further, when this measurement is contaminated with noise, we augment the MFS with a nonlinear constrained regularized minimization for obtaining a stable numerical solution of the inverse problem. Numerical results are presented and discussed. [Copyright &y& Elsevier]

Abstract: A derivative-free iterative method for solving bound-constrained underdetermined nonlinear systems is presented. The procedure consists of a quasi-Newton method that uses the Broyden update formula and a globalized line search that combines the strategy of Grippo, Lampariello and Lucidi with the Li and Fukushima one. Global convergence results are proved and numerical experiments are presented. [Copyright &y& Elsevier]

Abstract: In this paper, we extend the filled function method proposed in Lin et al. (2009) [10] to solve the constrained system of nonlinear equations, and we propose two methods to find a solution of such a system. Finally the efficiency of the present method is illustrated through some examples. [Copyright &y& Elsevier]

Abstract: In this paper, we consider the Polak–Ribière (or Polak–Ribière plus) conjugate gradient method for solving optimality condition of an unconstrained minimization problem. We give two new steplength rules only using gradient, and under gradient-Lipschitz assumption prove this method’s global convergence correspondingly. Then, we develop a practical Polak–Ribière plus method whose steplength is located by one inequality only using gradient, and report promising numerical results on high accuracy solution for some standard test problems when compared to the state-of-art methods in this research direction. Importantly, our work provides a new idea of devising a practical version of the celebrated Polak–Ribière (or Polak–Ribière plus) method. [Copyright &y& Elsevier]

Abstract: Conjugate gradient methods have been paid attention to, because they can be directly applied to large-scale unconstrained optimization problems. In order to incorporate second order information of the objective function into conjugate gradient methods, Dai and Liao (2001) proposed a conjugate gradient method based on the secant condition. However, their method does not necessarily generate a descent search direction. On the other hand, Hager and Zhang (2005) proposed another conjugate gradient method which always generates a descent search direction. In this paper, combining Dai–Liao’s idea and Hager–Zhang’s idea, we propose conjugate gradient methods based on secant conditions that generate descent search directions. In addition, we prove global convergence properties of the proposed methods. Finally, preliminary numerical results are given. [Copyright &y& Elsevier]

Abstract: The generation of priority vectors from pairwise comparison matrices is an essential part of the Analytic Hierarchy Process. Perhaps the most popular approach for deriving the priority weights is the right eigenvalue method (REV) which was proposed by Saaty. Despite its popularity some shortcomings of the REV have been reported in literature. Among the alternative approaches one can find the statistical estimation techniques, methods founded on constrained optimization models and models based on fuzzy description of decision maker preferences. In this paper new optimization techniques for deriving priority weights are introduced. In the proposed approach, the constrained optimization models are based on the same idea which underlies the REV. The properties of the resulting prioritization techniques are studied via computer simulations. This study demonstrates that the new methods perform very well in comparison with other popular techniques known from literature. What is especially important, the new approach provides the decision maker with a meaningful index that can be used to measure consistency of his/her judgments. The new index is closely related to the well-known Saaty’s consistency index CI, but in difference to the latter, it can be applied to both reciprocal as well as nonreciprocal comparison matrices. Hence the new index can be considered as a natural extension of the CI to all types of matrices. Some additional advantages resulting from the new approach are discussed and illustrated by numerical examples. [Copyright &y& Elsevier]

Abstract: In this paper, we consider numerical simulation to a class of constrained dynamic problems where the overall dynamics are determined by the interactions between two sub-systems. We present an iterative algorithm that naturally decouples the computation of the two sub-systems and that ensures an accurate and efficient solution procedure. We conduct rigorous error analysis for the convergence of the iterative algorithm, and verify the analytical results through careful numerical tests. [Copyright &y& Elsevier]

Abstract: A new trust-region algorithm for solving a constrained optimization problem is introduced. In this algorithm, an active set strategy is used together with multiplier method to convert the computation of the trial step to easy trust-region subproblem similar to this for the unconstrained case. A convergence theory for this algorithm is presented. Under reasonable assumptions, it is shown that the algorithm is globally convergent. In particular, it is shown that, in the limit, a subsequence of the iteration sequence satisfies one of four types of stationary conditions. Namely, the infeasible Mayer–Bliss conditions, Fritz John’s conditions, the infeasible Fritz John’s conditions or KKT conditions. Preliminary numerical experiment on the algorithm is presented. The performance of the algorithm is reported. The numerical results show that our approach is of value and merit further investigation. [Copyright &y& Elsevier]

Abstract: Simple modifications of the limited-memory BFGS method (L-BFGS) for large scale unconstrained optimization are considered, which consist in corrections (derived from the idea of conjugate directions) of the used difference vectors, utilizing information from the preceding iteration. For quadratic objective functions, the improvement of convergence is the best one in some sense and all stored difference vectors are conjugate for unit stepsizes. Global convergence of the algorithm is established for convex sufficiently smooth functions. Numerical experiments indicate that the new method often improves the L-BFGS method significantly. [Copyright &y& Elsevier]

Abstract: A new sequential quadratic programming (SQP) method for nonlinear inequality constrained optimization is proposed. The aim of this paper is to promote global convergence for SQP methods using a flexible step acceptance strategy which combines merit functions and filter techniques. Global convergence is proved under some reasonable assumptions and preliminary numerical results are reported. [Copyright &y& Elsevier]

Abstract: This paper introduces the concept and characterization of Disturbance-Dwell-Time invariance (DDT-invariance) and Constraint Admissible DDT-invariance (CADDT-invariance) for constrained systems with additive disturbance under dwell-time switching. Using the characterization, necessary and sufficient conditions for DDT-invariance and algorithms for the computation of the minimal and maximal constraint admissible convex DDT-invariant sets are provided. Numerical examples of such sets for several systems are also provided. [Copyright &y& Elsevier]

Abstract: Nonlinear conjugate gradient (CG) methods have played an important role in solving large-scale unconstrained optimization. Their wide application in many fields is due to their low memory requirements and global convergence properties. Numerous studies and modifications have been conducted recently to improve this method. In this paper, a new class of conjugate gradient coefficients (βk ) that possess global convergence properties is presented. The global convergence result is established using exact line searches. Numerical result shows that the proposed formula is superior and more efficient when compared to other CG coefficients. [Copyright &y& Elsevier]

Abstract: In this paper, we propose a new penalty-free-type method for nonlinear equality constrained problems. The new algorithm uses trust region framework and feasibility safeguarding technique. Moreover, it has no choice of penalty parameter and penalty function as a merit function, and it does not use the filter technique to avoid the penalty function either. We analyze the global convergence of the main algorithm under the standard assumptions. The preliminary numerical tests are reported. [Copyright &y& Elsevier]

Abstract: A modified Artificial Bee Colony algorithm to solve constrained numerical optimization problems is presented in this paper. Four modifications related with the selection mechanism, the scout bee operator, and the equality and boundary constraints are made to the algorithm with the aim to modify its behavior in a constrained search space. Six performance measures found in the specialized literature are employed to analyze different capabilities in the proposed algorithm such as the ability and cost to generate feasible solutions, the capacity and cost to locate the feasible global optimum solution and the competency to improve feasible solutions. Three experiments, including a comparison with state-of-the-art algorithms, are considered in the test design where twenty four well-known benchmark problems with different features are utilized. The overall results show that the proposed algorithm differs in its behavior with respect to the original Artificial Bee Colony algorithm but its performance is improved, mostly in problems with small feasible regions due to the presence of equality constraints. [Copyright &y& Elsevier]

For solving large-scale unconstrained minimization problems, the nonlinear conjugate gradient method is welcome due to its simplicity, low storage, efficiency and nice convergence properties. Among all the methods in the framework, the conjugate gradient descent algorithm — CG_DESCENT is very popular, in which the generated directions descend automatically, and this nice property is independent of any line search used. In this paper, we generalize CG_DESCENT with two Barzilai–Borwein steplength reused cyclically. We show that the resulting algorithm owns attractive sufficient descent property and converges globally under some mild conditions. We test the proposed algorithm by using a large set of unconstrained problems with high dimensions in CUTEr library. The numerical comparisons with the state-of-the-art algorithm CG_DESCENT illustrate that the proposed method is effective, competitive, and promising. [ABSTRACT FROM AUTHOR]

Abstract: This article presents a suite of numerical methods contained within a Matlab toolbox for constructing complete particle-size distributions from diverse particle-size data. These centre around the application of a constrained cubic-spline interpolation to logit-transformed cumulative percentage frequency data. This approach allows for the robust prediction of frequency values for a set of common particle-size categories. The scheme also calculates realistic, smoothly tapering tails for open-ended distributions using a non-linear extrapolation algorithm. An inversion of established graphic measures to calculate graphic cumulative percentiles is also presented. The robustness of the interpolation–extrapolation model is assessed using particle-size data from 4885 sediment samples from The Netherlands. The influence of the number, size and position of particle-size categories on the accuracy of modeled particle-size distributions was investigated by running a series of simulations using the empirical data set. Goodness-of-fit statistics between modeled distributions and input data are calculated by measuring the Euclidean distance between log-ratio transformed particle-size distributions. Technique accuracy, estimated as the mean goodness-of-fit between repeat sample measurements, was used to identify optimum model parameters. Simulations demonstrate that the data can be accurately characterized by 22 equal-width particle-size categories and 63 equiprobable particle-size categories. Optimal interpolation parameters are highly dependent on the density and position of particle-size categories in the original data set and on the overall level of technique accuracy. [Copyright &y& Elsevier]

Abstract: Hypothesis testing via numerical models has emerged as a powerful tool which permits the verification of theoretical frameworks against canonical experimental and clinical observations. Cleverly designed computational experiments also inspire new methodologies by elucidating important biological processes and restricting parametric spaces. Constrained mixture models of arterial growth and remodeling (G&R) can facilitate the design of computational experiments which can bypass technical limitations in the laboratory, by considering illustrative special cases. The resulting data may then inform the design of focused experimental techniques and the development of improved theories. This work is a survey of computational hypothesis-testing studies, which exploit the unique abilities offered by the constrained mixture theory of arterial G&R. Specifically, we explore the core hypotheses integrated in these models, review their basic mathematical conceptualizations, and recapitulate their most salient and illuminating findings. We then assess how a decade''s worth of constrained mixture models have contributed to a lucid, emerging picture of G&R mechanisms. [Copyright &y& Elsevier]

Abstract: Hybridization of genetic algorithms with local search approaches can enhance their performance in global optimization. Genetic algorithms, as most population based algorithms, require a considerable number of function evaluations. This may be an important drawback when the functions involved in the problem are computationally expensive as it occurs in most real world problems. Thus, in order to reduce the total number of function evaluations, local and global techniques may be combined. Moreover, the hybridization may provide a more effective trade-off between exploitation and exploration of the search space. In this study, we propose a new hybrid genetic algorithm based on a local pattern search that relies on an augmented Lagrangian function for constraint-handling. The local search strategy is used to improve the best approximation found by the genetic algorithm. Convergence to an -global minimizer is proved. Numerical results and comparisons with other stochastic algorithms using a set of benchmark constrained problems are provided. [Copyright &y& Elsevier]

Abstract: Since the appearance of the Barzilai–Borwein (BB) step sizes strategy for unconstrained optimization problems, it received more and more attention of the researchers. It was applied in various fields of the nonlinear optimization problems and recently was also extended to optimization problems with bound constraints. In this paper, we further extend the BB step sizes to more general variational inequality (VI) problems, i.e., we adopt them in projection methods. Under the condition that the underlying mapping of the VI problem is strongly monotone and Lipschitz continuous and the modulus of strong monotonicity and the Lipschitz constant satisfy some further conditions, we establish the global convergence of the projection methods with BB step sizes. A series of numerical examples are presented, which demonstrate that the proposed methods are convergent under mild conditions, and are more efficient than some classical projection-like methods. [Copyright &y& Elsevier]

Abstract: The solution of the augmented Lagrangian related system is a key ingredient of many iterative algorithms for the solution of saddle-point problems in constrained optimization with quasi-Newton methods. However, such problems are ill-conditioned when the penalty parameter tends to zero, whereas the error vanishes as . We present a new fast method based on a splitting penalty scheme to solve such problems with a judicious prediction–correction method. We prove that, due to the adapted right-hand side, the solution of the correction step only requires the approximation of operators independent of , when is taken sufficiently small. Hence, the proposed method is as cheaper as tends to zero. We apply the two-step scheme to efficiently solve the saddle-point problem with a penalty method. Indeed, that fully justifies the interest of the vector penalty-projection methods recently proposed by Angot et al. (2008) to solve the unsteady incompressible Navier–Stokes equations, for which we give the stability result and some quasi-optimal error estimates. Moreover, the numerical experiments confirm both the theoretical analysis and the efficiency of the proposed method which produces a fast splitting solution to augmented Lagrangian or penalty problems, possibly used as a suitable preconditioner to the fully coupled system. [Copyright &y& Elsevier]

Abstract: In this paper, a new line search filter algorithm for equality constrained optimization is presented. The approach belongs to the class of inexact Newton-like methods. It can also be regarded as an inexact version of generic sequential quadratic programming (SQP) methods. The trial step is obtained by truncatedly solving the primal–dual system based on any robust and efficient linear system solver. Practical termination tests for the linear system solver are established to ensure global convergence. Preliminary numerical results demonstrate the approach is potentially useful. [Copyright &y& Elsevier]

Abstract: In this fast communication, we derive the statistical resolution limit (SRL), characterizing the minimal parameter separation, to resolve two closely spaced known near-field sources impinging on a linear array. Toward this goal, we conduct on the first-order Taylor expansion of the observation model a Generalized Likelihood Ratio Test (GLRT) based on a Constrained Maximum Likelihood Estimator (CMLE) of the SRL. More precisely, the minimum separation between two near-field sources, that is detectable for a given probability of false alarm and a given probability of detection, is derived herein. Finally, numerical simulations are done to quantify the impact of the array geometry of the signal sources power distribution and of the array aperture on the statistical resolution limit. [Copyright &y& Elsevier]

Abstract: We investigate numerical algorithms for viscoelastic fluid flows with defective boundary conditions, where only flow rates or mean pressures are prescribed on parts of the boundary. The defective boundary condition problem is formulated as a minimization problem, where we seek boundary conditions of the flow equations which yield an optimal functional value. Two different approaches are considered in developing computational algorithms for the constrained optimization problem, and results of numerical experiments are presented to compare performance of the algorithms. [Copyright &y& Elsevier]

Abstract: In this paper, we give new results on the Alienor method of dimension reduction. This technique is used to solve multidimensional global optimization problems of type min x∈X f(x) where f is a non convex Lipschitz function and X a compact set of defined by Lipschitz constraints. The idea is to construct an α-dense curve h in the feasible set X. The global minimum of f on X is then approximated by the global minimum of f on the curve h. That is, our problem has become a one-dimensional problem which can be solved by the Piyavskii–Shubert method. Examples of these curves and numerical implementations on several test functions are given. [Copyright &y& Elsevier]