-
1
-
-
84919713045
-
Evolutionary optimization versus particle swarm optimization: Philosophy and performance differences
-
P.J. Angeline, "Evolutionary Optimization Versus Particle Swarm Optimization: Philosophy and Performance Differences", Evolutionary Programming VII, pp. 601-610, 1998.
-
(1998)
Evolutionary Programming
, vol.7
, pp. 601-610
-
-
Angeline, P.J.1
-
2
-
-
0016068976
-
Nonlinear programming using minimax techniques
-
J.W. Bandler and C. Charalambous, "Nonlinear Programming Using Minimax Techniques", J. Optim. Th. Appl., Vol. 13, pp. 607-619, 1974.
-
(1974)
J. Optim. Th. Appl
, vol.13
, pp. 607-619
-
-
Bandler, J.W.1
Charalambous, C.2
-
5
-
-
0017014214
-
A new algorithm for solution of nonlinear resistive networks involving diodes
-
D.P. Bertsekas, "A New Algorithm for Solution of Nonlinear Resistive Networks Involving Diodes", IEEE Trans. Circ. Th., Vol. 23, pp. 599-608, 1976.
-
(1976)
IEEE Trans. Circ. Th
, vol.23
, pp. 599-608
-
-
Bertsekas, D.P.1
-
6
-
-
0000176002
-
An efficient method to solve the minimax problem directly
-
C. Charalambous and A.R. Conn, "An Efficient Method to Solve the Minimax Problem Directly", SIAM J. Numer. Anal., Vol. 15, pp. 162-187, 1978.
-
(1978)
SIAM J. Numer. Anal.
, vol.15
, pp. 162-187
-
-
Charalambous, C.1
Conn, A.R.2
-
11
-
-
84947807745
-
Comparison between genetic algorithms and particle swarm optimization
-
R.C. Eberhart and Y.H. Shi, "Comparison Between Genetic Algorithms and Particle Swarm Optimization", Evolutionary Programming VII, pp. 611-615, 1998.
-
(1998)
Evolutionary Programming
, vol.7
, pp. 611-615
-
-
Eberhart, R.C.1
Shi, Y.H.2
-
15
-
-
37049013963
-
The behavior of particles
-
J. Kennedy, "The Behavior of Particles", Evolutionary Programming VII, pp. 581-587, 1998.
-
(1998)
Evolutionary Programming
, vol.7
, pp. 581-587
-
-
Kennedy, J.1
-
16
-
-
0029535737
-
Particle swarm optimization
-
Piscataway, NJ, USA
-
J. Kennedy and R.C. Eberhart, "Particle Swarm Optimization", Proc. of the IEEE International Conference on Neural Networks, Piscataway, NJ, USA, pp. 1942-1948, 1995.
-
(1995)
Proc. of the IEEE International Conference on Neural Networks
, pp. 1942-1948
-
-
Kennedy, J.1
Eberhart, R.C.2
-
18
-
-
21044435906
-
A new penalty function algorithm for constrained minimization
-
New Orlean, Louisiana
-
B.W. Kort and D.P. Bertsekas, "A New Penalty Function Algorithm for Constrained Minimization", Proc. 1972 IEEE Conf. Decision and Control, New Orlean, Louisiana, 1972.
-
(1972)
Proc 1972 IEEE Conf. Decision and Control
-
-
Kort, B.W.1
Bertsekas, D.P.2
-
19
-
-
0000158651
-
An aggregate function method for nonlinear programming
-
X.S. Li, "An Aggregate Function Method for Nonlinear Programming", Science in China (A), Vol. 34, pp. 1467-1473, 1991.
-
(1991)
Science in China (A)
, vol.34
, pp. 1467-1473
-
-
Li, X.S.1
-
20
-
-
4043154785
-
Test problems for nonsmooth unconstrained and linearly constrained optimization
-
Institut of Computer Science, Academy of Sciences of the Czech Republic
-
L. Lukšan and J. Vlček, "Test Problems for Nonsmooth Unconstrained and Linearly Constrained Optimization", Technical Report No. 798, Institut of Computer Science, Academy of Sciences of the Czech Republic, 2000.
-
(2000)
Technical Report
, vol.798
-
-
Lukšan, L.1
Vlček, J.2
-
21
-
-
0003412346
-
A projected lagrangian algorithm for nonlinear minimax optimization
-
W. Murray and M.L. Overton, "A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization", SIAM J. Scient. Stat. Camp., Vol. 1, pp. 345-370, 1980.
-
(1980)
SIAM J. Scient. Stat. Camp
, vol.1
, pp. 345-370
-
-
Murray, W.1
Overton, M.L.2
-
22
-
-
0003412348
-
An algorithm for minimax approximation in the non-linear case
-
M.R. Osborne and G.A. Watson, "An Algorithm for Minimax Approximation in the Non-linear Case", Comput. J., Vol. 12, pp. 63-68, 1969.
-
(1969)
Comput. J
, vol.12
, pp. 63-68
-
-
Osborne, M.R.1
Watson, G.A.2
-
23
-
-
0035418888
-
Objective function stretching to alleviate convergence to local minima
-
RE. Parsopoulos, V.P. Plagianakos, G.D. Magoulas and M.N. Vrahatis, "Objective Function "Stretching" to Alleviate Convergence to Local Minima", Nonlinear Analysis TMA, Vol. 47(5), pp. 3419-3424, 2001.
-
(2001)
Nonlinear Analysis TMA
, vol.47
, Issue.5
, pp. 3419-3424
-
-
Parsopoulos, R.E.1
Plagianakos, V.P.2
Magoulas, G.D.3
Vrahatis, M.N.4
-
24
-
-
0002395440
-
Stretching technique for obtaining global minimizers through particle swarm optimization
-
RE. Parsopoulos, V.P. Plagianakos, G.D. Magoulas and M.N. Vrahatis, "Stretching Technique for Obtaining Global Minimizers Through Particle Swarm Optimization", Proc. of the Particle Swarm Optimization Workshop, Indianapolis (IN), USA, pp. 22-29, 2001.
-
(2001)
Proc. of the Particle Swarm Optimization Workshop, Indianapolis (IN), USA
, pp. 22-29
-
-
Parsopoulos, R.E.1
Plagianakos, V.P.2
Magoulas, G.D.3
Vrahatis, M.N.4
-
25
-
-
0002189485
-
Modification of the particle swarm optimizer for locating all the global minima
-
V. Kurkova, N. Steele, R. Neruda, M. Karny (Eds.) Springer: Wien (Computer Science Series)
-
N.E. Parsopoulos and M.N. Vrahatis, "Modification of the Particle Swarm Optimizer for Locating All the Global Minima", V. Kurkova, N. Steele, R. Neruda, M. Karny (Eds.), Artificial Neural Networks and Genetic Algorithms, Springer: Wien (Computer Science Series), pp. 324-327, 2001.
-
(2001)
Artificial Neural Networks and Genetic Algorithms
, pp. 324-327
-
-
Parsopoulos, N.E.1
Vrahatis, M.N.2
-
26
-
-
0005260335
-
Particle swarm optimizer in noisy and continuously changing environments
-
M.H. Hamza (Ed.), IASTED/ACTA Press
-
N.E. Parsopoulos and M.N. Vrahatis, "Particle Swarm Optimizer in Noisy and Continuously Changing Environments", M.H. Hamza (Ed.), Artificial Intelligence and Soft Computing, IASTED/ACTA Press, pp. 289 294, 2001.
-
(2001)
Artificial Intelligence and Soft Computing
, vol.294
, pp. 289
-
-
Parsopoulos, N.E.1
Vrahatis, M.N.2
-
29
-
-
34250653849
-
-
Cambridge University Press Cambridge
-
W.H. Press, W.T. Vetterling, S.A. Teukolsky and B.P. Flannery, Numerical Recipes in Fortran 77, Cambridge University Press: Cambridge, 1992.
-
(1992)
Numerical Recipes in Fortran
, vol.77
-
-
Press, W.H.1
Vetterling, W.T.2
Teukolsky, S.A.3
Flannery, B.P.4
-
31
-
-
84879015433
-
Parameter selection in particle swarm optimization
-
Y. Shi and R.C. Eberhart, "Parameter Selection in Particle Swarm Optimization", EvolutionaryProgramming VII, pp. 591-600, 1998.
-
(1998)
Evolutionary Programming
, vol.7
, pp. 591-600
-
-
Shi, Y.1
Eberhart, R.C.2
-
32
-
-
0033899834
-
A class of gradient unconstrained minimization algorithms with adaptive step size
-
M.N. Vrahatis, G.S. Androulakis, J.N. Lambrinos and G.D. Magoulas, "A Class of Gradient Unconstrained Minimization Algorithms with Adaptive Step Size", J. Camp. Appi. Math., Vol. 114, 367-386, 2000.
-
(2000)
J. Camp. Appi. Math
, vol.114
, pp. 367-386
-
-
Vrahatis, M.N.1
Androulakis, G.S.2
Lambrinos, J.N.3
Magoulas, G.D.4
-
33
-
-
0035546518
-
Smoothing method for minimax problems
-
S. Xu, "Smoothing Method for Minimax Problems", Comp. Optim. Appl., Vol. 20, pp. 267-279, 2001.
-
(2001)
Comp. Optim. Appl
, vol.20
, pp. 267-279
-
-
Xu, S.1
-
34
-
-
2842536882
-
Solving minimax problems by interval methods
-
S. Zuhe, A. Neumaier and M.C. Eiermann, "Solving Minimax Problems by Interval Methods", BIT, Vol. 30, pp. 742-751, 1990.
-
(1990)
BIT
, vol.30
, pp. 742-751
-
-
Zuhe, S.1
Neumaier, A.2
Eiermann, M.C.3
|