Recent approaches to global optimization problems through particle swarm optimization
This paper presents an overview of our most recent results concerning the Particle Swarm
Optimization (PSO) method. Techniques for the alleviation of local minima, and for detecting …
Optimization (PSO) method. Techniques for the alleviation of local minima, and for detecting …
Formulating an n-person noncooperative game as a tensor complementarity problem
In this paper, we consider a class of n-person noncooperative games, where the utility
function of every player is given by a homogeneous polynomial defined by the payoff tensor …
function of every player is given by a homogeneous polynomial defined by the payoff tensor …
Tensor complementarity problems—part II: solution methods
This work, with its three parts, reviews the state-of-the-art of studies for the tensor
complementarity problem and some related models. In the first part of this paper, we have …
complementarity problem and some related models. In the first part of this paper, we have …
Smoothing method for minimax problems
S Xu - Computational Optimization and Applications, 2001 - Springer
In this paper, we propose a smoothing method for minimax problem. The method is based
on the exponential penalty function of Kort and Bertsekas for constrained optimization …
on the exponential penalty function of Kort and Bertsekas for constrained optimization …
A survey of some nonsmooth equations and smoothing Newton methods
7 A SURVEY OF SOME NONSMOOTH EQUATIONS AND SMOOTHING NEWTON
METHODS1 Page 1 7 A SURVEY OF SOME NONSMOOTH EQUATIONS AND …
METHODS1 Page 1 7 A SURVEY OF SOME NONSMOOTH EQUATIONS AND …
Smoothing algorithms for complementarity problems over symmetric cones
ZH Huang, T Ni - Computational Optimization and Applications, 2010 - Springer
There recently has been much interest in studying optimization problems over symmetric
cones. In this paper, we first investigate a smoothing function in the context of symmetric …
cones. In this paper, we first investigate a smoothing function in the context of symmetric …
Predictor-Corrector Smoothing Newton Method, Based on a New Smoothing Function, for Solving the Nonlinear Complementarity Problem with a P 0 Function
ZH Huang, J Han, Z Chen - Journal of Optimization Theory and …, 2003 - Springer
By smoothing a perturbed minimum function, we propose in this paper a new smoothing
function. The existence and continuity of a smooth path for solving the nonlinear …
function. The existence and continuity of a smooth path for solving the nonlinear …
[책][B] Theorie und numerik restringierter optimierungsaufgaben
C Geiger, C Kanzow - 2013 - books.google.com
Dieses Buch ist aus verschiedenen Vorlesungen der Autoren an den Universitäten
Hamburg und Trier entstanden. Es bietet eine umfassende und aktuelle Darstellung des …
Hamburg und Trier entstanden. Es bietet eine umfassende und aktuelle Darstellung des …
A Global and Local Superlinear Continuation-Smoothing Method for P0 and R0 NCP or Monotone NCP
We propose a continuation method for a class of nonlinear complementarity problems
(NCPs), including the NCP with a P 0 and R 0 function and the monotone NCP with a …
(NCPs), including the NCP with a P 0 and R 0 function and the monotone NCP with a …
Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
Recently, based upon the Chen-Harker-Kanzow-Smale smoothing function and the
trajectory and the neighbourhood techniques, Hotta and Yoshise proposed a noninterior …
trajectory and the neighbourhood techniques, Hotta and Yoshise proposed a noninterior …