Sciweavers

1137 search results - page 11 / 228
» The GLOBAL optimization method revisited
Sort
View
NC
2002
210views Neural Networks» more  NC 2002»
13 years 7 months ago
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 detectin...
Konstantinos E. Parsopoulos, Michael N. Vrahatis
SIAMJO
2010
87views more  SIAMJO 2010»
13 years 5 months ago
A Second Derivative SQP Method: Global Convergence
Abstract. Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second deri...
Nicholas I. M. Gould, Daniel P. Robinson
SIAMSC
2008
147views more  SIAMSC 2008»
13 years 7 months ago
Global and Finite Termination of a Two-Phase Augmented Lagrangian Filter Method for General Quadratic Programs
We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian...
Michael P. Friedlander, Sven Leyffer
CORR
2011
Springer
167views Education» more  CORR 2011»
13 years 2 months ago
Fast global convergence of gradient methods for high-dimensional statistical recovery
Many statistical M-estimators are based on convex optimization problems formed by the weighted sum of a loss function with a norm-based regularizer. We analyze the convergence rat...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...
OL
2007
121views more  OL 2007»
13 years 7 months ago
Global optimization by continuous grasp
We introduce a novel global optimization method called Continuous GRASP (C-GRASP) which extends Feo and Resende’s greedy randomized adaptive search procedure (GRASP) from the dom...
Michael J. Hirsch, Cláudio Nogueira de Mene...