A new concept of separation
A new diagonal quasi-Newton algorithm for unconstrained optimization problems
We present a new diagonal quasi-Newton method for solving unconstrained optimization problems based on the weak secant equation. To control the diagonal elements, the new method uses new criteria to generate the Hessian approximation. We establish the global convergence of the proposed method with the Armijo line search. Numerical results on a collection of standard test problems demonstrate the superiority of the proposed method over several existing diagonal methods.
A New Efficient Transformation of the Generalized Vehicle Routing Problem into the Classical Vehicle Routing Problem
A new evolutionary algorithm for multiobjective optimization based on endocrine paradigm.
A new evolutionary algorithm for the multiobjective knapasck problem.
A new evolutionary optimization technique.
A New Exterior Point Algorithm for Linear Programming Problems
A new formulation and solution of the sequencing problem: mathematical model
A New Genetic Representation for Quadratic Assignment Problem
A new global optimization algorithm for solving generalized geometric programming.
A new heuristic for the quadratic assignment problem.
A new heuristic for the traveling salesman problem
A new method for nonsmooth convex optimization.
A new method for solving monotone generalized variational inequalities.
A new minimal point theorem in product spaces.
A new modeling and solution approach for the number partitioning problem.
A new non-interior continuation method for -NCP based on a SSPM-function
In this paper, we consider a new non-interior continuation method for the solution of nonlinear complementarity problem with -function (-NCP). The proposed algorithm is based on a smoothing symmetric perturbed minimum function (SSPM-function), and one only needs to solve one system of linear equations and to perform only one Armijo-type line search at each iteration. The method is proved to possess global and local convergence under weaker conditions. Preliminary numerical results indicate that...
A New Nonlinear Model for the Two-Dimensional Packing Problem
A new nonmonotone adaptive trust region algorithm
We propose a new and efficient nonmonotone adaptive trust region algorithm to solve unconstrained optimization problems. This algorithm incorporates two novelties: it benefits from a radius dependent shrinkage parameter for adjusting the trust region radius that avoids undesirable directions and exploits a new strategy to prevent sudden increments of objective function values in nonmonotone trust region techniques. Global convergence of this algorithm is investigated under some mild conditions....
A new one-step smoothing newton method for second-order cone programming
In this paper, we present a new one-step smoothing Newton method for solving the second-order cone programming (SOCP). Based on a new smoothing function of the well-known Fischer-Burmeister function, the SOCP is approximated by a family of parameterized smooth equations. Our algorithm solves only one system of linear equations and performs only one Armijo-type line search at each iteration. It can start from an arbitrary initial point and does not require the iterative points to be in the sets...