Sciweavers

155 search results - page 2 / 31
» On global and local convergence of half-quadratic algorithms
Sort
View
JGO
2010
112views more  JGO 2010»
13 years 3 months ago
An information global minimization algorithm using the local improvement technique
In this paper, the global optimization problem with an objective function that is multiextremal that satisfies the Lipschitz condition over a hypercube is considered. An algorithm...
Daniela Lera, Yaroslav D. Sergeyev
ICTAI
2010
IEEE
13 years 3 months ago
Metropolis Particle Swarm Optimization Algorithm with Mutation Operator for Global Optimization Problems
When a local optimal solution is reached with classical Particle Swarm Optimization (PSO), all particles in the swarm gather around it, and escaping from this local optima becomes...
Lhassane Idoumghar, M. Idrissi-Aouad, Mahmoud Melk...
TSP
2008
106views more  TSP 2008»
13 years 5 months ago
Guaranteeing Practical Convergence in Algorithms for Sensor and Source Localization
This paper considers localization of a source or a sensor from distance measurements. We argue that linear algorithms proposed for this purpose are susceptible to poor noise perfor...
Baris Fidan, Soura Dasgupta, Brian D. O. Anderson
OL
2007
133views more  OL 2007»
13 years 4 months ago
An SQP-type algorithm for nonlinear second-order cone programs
We propose an SQP-type algorithm for solving nonlinear second-order cone programming (NSOCP) problems. At every iteration, the algorithm solves a convex SOCP subproblem in which th...
Hirokazu Kato, Masao Fukushima
MP
2010
154views more  MP 2010»
13 years 3 months ago
A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties
Abstract. We present a null-space primal-dual interior-point algorithm for solving nonlinear optimization problems with general inequality and equality constraints. The algorithm a...
Xinwei Liu, Yaxiang Yuan